97 ideas
| 21959 | Metaphysics is the most general attempt to make sense of things [Moore,AW] |
| 9738 | Each line of a truth table is a model [Fitting/Mendelsohn] |
| 9727 | Modal logic adds □ (necessarily) and ◊ (possibly) to classical logic [Fitting/Mendelsohn] |
| 9726 | We let 'R' be the accessibility relation: xRy is read 'y is accessible from x' [Fitting/Mendelsohn] |
| 9737 | The symbol ||- is the 'forcing' relation; 'Γ ||- P' means that P is true in world Γ [Fitting/Mendelsohn] |
| 13136 | The prefix σ names a possible world, and σ.n names a world accessible from that one [Fitting/Mendelsohn] |
| 13727 | A 'constant' domain is the same for all worlds; 'varying' domains can be entirely separate [Fitting/Mendelsohn] |
| 9734 | Modern modal logic introduces 'accessibility', saying xRy means 'y is accessible from x' [Fitting/Mendelsohn] |
| 9736 | A 'model' is a frame plus specification of propositions true at worlds, written < G,R,||- > [Fitting/Mendelsohn] |
| 9735 | A 'frame' is a set G of possible worlds, with an accessibility relation R, written < G,R > [Fitting/Mendelsohn] |
| 9741 | Accessibility relations can be 'reflexive' (self-referring), 'transitive' (carries over), or 'symmetric' (mutual) [Fitting/Mendelsohn] |
| 13149 | S5: a) if n ◊X then kX b) if n ¬□X then k ¬X c) if n □X then k X d) if n ¬◊X then k ¬X [Fitting/Mendelsohn] |
| 13141 | Negation: if σ ¬¬X then σ X [Fitting/Mendelsohn] |
| 13138 | Disj: a) if σ ¬(X∨Y) then σ ¬X and σ ¬Y b) if σ X∨Y then σ X or σ Y [Fitting/Mendelsohn] |
| 13142 | Existential: a) if σ ◊X then σ.n X b) if σ ¬□X then σ.n ¬X [n is new] [Fitting/Mendelsohn] |
| 13144 | T reflexive: a) if σ □X then σ X b) if σ ¬◊X then σ ¬X [Fitting/Mendelsohn] |
| 13145 | D serial: a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X [Fitting/Mendelsohn] |
| 13146 | B symmetric: a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [n occurs] [Fitting/Mendelsohn] |
| 13147 | 4 transitive: a) if σ □X then σ.n □X b) if σ ¬◊X then σ.n ¬◊X [n occurs] [Fitting/Mendelsohn] |
| 13148 | 4r rev-trans: a) if σ.n □X then σ □X b) if σ.n ¬◊X then σ ¬◊X [n occurs] [Fitting/Mendelsohn] |
| 9740 | If a proposition is possibly true in a world, it is true in some world accessible from that world [Fitting/Mendelsohn] |
| 9739 | If a proposition is necessarily true in a world, it is true in all worlds accessible from that world [Fitting/Mendelsohn] |
| 13137 | Conj: a) if σ X∧Y then σ X and σ Y b) if σ ¬(X∧Y) then σ ¬X or σ ¬Y [Fitting/Mendelsohn] |
| 13140 | Bicon: a)if σ(X↔Y) then σ(X→Y) and σ(Y→X) b) [not biconditional, one or other fails] [Fitting/Mendelsohn] |
| 13139 | Implic: a) if σ ¬(X→Y) then σ X and σ ¬Y b) if σ X→Y then σ ¬X or σ Y [Fitting/Mendelsohn] |
| 13143 | Universal: a) if σ ¬◊X then σ.m ¬X b) if σ □X then σ.m X [m exists] [Fitting/Mendelsohn] |
| 9742 | The system K has no accessibility conditions [Fitting/Mendelsohn] |
| 13114 | □P → P is not valid in D (Deontic Logic), since an obligatory action may be not performed [Fitting/Mendelsohn] |
| 9743 | The system D has the 'serial' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
| 9744 | The system T has the 'reflexive' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
| 9746 | The system K4 has the 'transitive' condition on its accessibility relation [Fitting/Mendelsohn] |
| 9745 | The system B has the 'reflexive' and 'symmetric' conditions on its accessibility relation [Fitting/Mendelsohn] |
| 9747 | The system S4 has the 'reflexive' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
| 9748 | System S5 has the 'reflexive', 'symmetric' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
| 9404 | Modality affects content, because P→◊P is valid, but ◊P→P isn't [Fitting/Mendelsohn] |
| 13112 | In epistemic logic knowers are logically omniscient, so they know that they know [Fitting/Mendelsohn] |
| 13111 | Read epistemic box as 'a knows/believes P' and diamond as 'for all a knows/believes, P' [Fitting/Mendelsohn] |
| 13113 | F: will sometime, P: was sometime, G: will always, H: was always [Fitting/Mendelsohn] |
| 13728 | The Barcan says nothing comes into existence; the Converse says nothing ceases; the pair imply stability [Fitting/Mendelsohn] |
| 13729 | The Barcan corresponds to anti-monotonicity, and the Converse to monotonicity [Fitting/Mendelsohn] |
| 8625 | What physical facts could underlie 0 or 1, or very large numbers? [Frege on Mill] |
| 17895 | Combining two distinct assertions does not necessarily lead to a single 'complex proposition' [Mill] |
| 10427 | All names are names of something, real or imaginary [Mill] |
| 4944 | Mill says names have denotation but not connotation [Mill, by Kripke] |
| 7762 | Proper names are just labels for persons or objects, and the meaning is the object [Mill, by Lycan] |
| 9725 | 'Predicate abstraction' abstracts predicates from formulae, giving scope for constants and functions [Fitting/Mendelsohn] |
| 9801 | Numbers must be assumed to have identical units, as horses are equalised in 'horse-power' [Mill] |
| 8742 | The only axioms needed are for equality, addition, and successive numbers [Mill, by Shapiro] |
| 9800 | Arithmetic is based on definitions, and Sums of equals are equal, and Differences of equals are equal [Mill] |
| 5201 | Mill says logic and maths is induction based on a very large number of instances [Mill, by Ayer] |
| 9360 | If two black and two white objects in practice produced five, what colour is the fifth one? [Lewis,CI on Mill] |
| 9888 | Mill mistakes particular applications as integral to arithmetic, instead of general patterns [Dummett on Mill] |
| 9794 | There are no such things as numbers in the abstract [Mill] |
| 9796 | Things possess the properties of numbers, as quantity, and as countable parts [Mill] |
| 9795 | Numbers have generalised application to entities (such as bodies or sounds) [Mill] |
| 9798 | Different parcels made from three pebbles produce different actual sensations [Mill] |
| 9797 | '2 pebbles and 1 pebble' and '3 pebbles' name the same aggregation, but different facts [Mill] |
| 9799 | 3=2+1 presupposes collections of objects ('Threes'), which may be divided thus [Mill] |
| 9802 | Numbers denote physical properties of physical phenomena [Mill] |
| 9803 | We can't easily distinguish 102 horses from 103, but we could arrange them to make it obvious [Mill] |
| 9804 | Arithmetical results give a mode of formation of a given number [Mill] |
| 9805 | 12 is the cube of 1728 means pebbles can be aggregated a certain way [Mill] |
| 8741 | Numbers must be of something; they don't exist as abstractions [Mill] |
| 12411 | Mill is too imprecise, and is restricted to simple arithmetic [Kitcher on Mill] |
| 5656 | Empirical theories of arithmetic ignore zero, limit our maths, and need probability to get started [Frege on Mill] |
| 9624 | Numbers are a very general property of objects [Mill, by Brown,JR] |
| 9806 | Whatever is made up of parts is made up of parts of those parts [Mill] |
| 11156 | The essence is that without which a thing can neither be, nor be conceived to be [Mill] |
| 13730 | The Indiscernibility of Identicals has been a big problem for modal logic [Fitting/Mendelsohn] |
| 12190 | Necessity is what will be, despite any alternative suppositions whatever [Mill] |
| 22623 | Necessity can only mean what must be, without conditions of any kind [Mill] |
| 13725 | □ must be sensitive as to whether it picks out an object by essential or by contingent properties [Fitting/Mendelsohn] |
| 13731 | Objects retain their possible properties across worlds, so a bundle theory of them seems best [Fitting/Mendelsohn] |
| 13726 | Counterpart relations are neither symmetric nor transitive, so there is no logic of equality for them [Fitting/Mendelsohn] |
| 21958 | Appearances are nothing beyond representations, which is transcendental ideality [Moore,AW] |
| 16859 | Most perception is one-tenth observation and nine-tenths inference [Mill] |
| 9082 | Clear concepts result from good observation, extensive experience, and accurate memory [Mill] |
| 16860 | Inductive generalisation is more reliable than one of its instances; they can't all be wrong [Mill] |
| 16845 | The whole theory of induction rests on causes [Mill] |
| 16843 | Mill's methods (Difference,Agreement,Residues,Concomitance,Hypothesis) don't nail induction [Mill, by Lipton] |
| 17086 | Surprisingly, empiricists before Mill ignore explanation, which seems to transcend experience [Mill, by Ruben] |
| 17091 | Explanation is fitting of facts into ever more general patterns of regularity [Mill, by Ruben] |
| 16805 | Causal inference is by spotting either Agreements or Differences [Mill, by Lipton] |
| 16835 | The Methods of Difference and of Agreement are forms of inference to the best explanation [Mill, by Lipton] |
| 9079 | We can focus our minds on what is common to a whole class, neglecting other aspects [Mill] |
| 9081 | We don't recognise comparisons by something in our minds; the concepts result from the comparisons [Mill] |
| 9080 | General conceptions are a necessary preliminary to Induction [Mill] |
| 9078 | The study of the nature of Abstract Ideas does not belong to logic, but to a different science [Mill] |
| 8345 | A cause is the total of all the conditions which inevitably produce the result [Mill] |
| 10391 | Causes and conditions are not distinct, because we select capriciously from among them [Mill] |
| 14547 | The strict cause is the total positive and negative conditions which ensure the consequent [Mill] |
| 8377 | Causation is just invariability of succession between every natural fact and a preceding fact [Mill] |
| 14545 | A cause is an antecedent which invariably and unconditionally leads to a phenomenon [Mill] |
| 4773 | Mill's regularity theory of causation is based on an effect preceded by a conjunction of causes [Mill, by Psillos] |
| 4775 | In Mill's 'Method of Agreement' cause is the common factor in a range of different cases [Mill, by Psillos] |
| 4776 | In Mill's 'Method of Difference' the cause is what stops the effect when it is removed [Mill, by Psillos] |
| 9417 | What are the fewest propositions from which all natural uniformities could be inferred? [Mill] |