95 ideas
| 9641 | Definitions should be replaceable by primitives, and should not be creative [Brown,JR] |
| 10170 | While true-in-a-model seems relative, true-in-all-models seems not to be [Reck/Price] |
| 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] |
| 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] |
| 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] |
| 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] |
| 9634 | Set theory says that natural numbers are an actual infinity (to accommodate their powerset) [Brown,JR] |
| 10166 | ZFC set theory has only 'pure' sets, without 'urelements' [Reck/Price] |
| 9613 | Naïve set theory assumed that there is a set for every condition [Brown,JR] |
| 9615 | Nowadays conditions are only defined on existing sets [Brown,JR] |
| 9617 | The 'iterative' view says sets start with the empty set and build up [Brown,JR] |
| 9642 | A flock of birds is not a set, because a set cannot go anywhere [Brown,JR] |
| 9605 | If a proposition is false, then its negation is true [Brown,JR] |
| 9725 | 'Predicate abstraction' abstracts predicates from formulae, giving scope for constants and functions [Fitting/Mendelsohn] |
| 10175 | Three types of variable in second-order logic, for objects, functions, and predicates/sets [Reck/Price] |
| 9649 | Axioms are either self-evident, or stipulations, or fallible attempts [Brown,JR] |
| 9638 | Berry's Paradox finds a contradiction in the naming of huge numbers [Brown,JR] |
| 9604 | Mathematics is the only place where we are sure we are right [Brown,JR] |
| 9622 | 'There are two apples' can be expressed logically, with no mention of numbers [Brown,JR] |
| 10165 | 'Analysis' is the theory of the real numbers [Reck/Price] |
| 9648 | π is a 'transcendental' number, because it is not the solution of an equation [Brown,JR] |
| 9621 | Mathematics represents the world through structurally similar models. [Brown,JR] |
| 9646 | There is no limit to how many ways something can be proved in mathematics [Brown,JR] |
| 9647 | Computers played an essential role in proving the four-colour theorem of maps [Brown,JR] |
| 10174 | Mereological arithmetic needs infinite objects, and function definitions [Reck/Price] |
| 10164 | Peano Arithmetic can have three second-order axioms, plus '1' and 'successor' [Reck/Price] |
| 10172 | Set-theory gives a unified and an explicit basis for mathematics [Reck/Price] |
| 9643 | Set theory may represent all of mathematics, without actually being mathematics [Brown,JR] |
| 9644 | When graphs are defined set-theoretically, that won't cover unlabelled graphs [Brown,JR] |
| 10167 | Structuralism emerged from abstract algebra, axioms, and set theory and its structures [Reck/Price] |
| 10169 | Relativist Structuralism just stipulates one successful model as its arithmetic [Reck/Price] |
| 10179 | There are 'particular' structures, and 'universal' structures (what the former have in common) [Reck/Price] |
| 10181 | Pattern Structuralism studies what isomorphic arithmetic models have in common [Reck/Price] |
| 10182 | There are Formalist, Relativist, Universalist and Pattern structuralism [Reck/Price] |
| 10168 | Formalist Structuralism says the ontology is vacuous, or formal, or inference relations [Reck/Price] |
| 10178 | Maybe we should talk of an infinity of 'possible' objects, to avoid arithmetic being vacuous [Reck/Price] |
| 9625 | To see a structure in something, we must already have the idea of the structure [Brown,JR] |
| 10176 | Universalist Structuralism is based on generalised if-then claims, not one particular model [Reck/Price] |
| 10177 | Universalist Structuralism eliminates the base element, as a variable, which is then quantified out [Reck/Price] |
| 9628 | Sets seem basic to mathematics, but they don't suit structuralism [Brown,JR] |
| 10171 | The existence of an infinite set is assumed by Relativist Structuralism [Reck/Price] |
| 9606 | The irrationality of root-2 was achieved by intellect, not experience [Brown,JR] |
| 9612 | There is an infinity of mathematical objects, so they can't be physical [Brown,JR] |
| 9610 | Numbers are not abstracted from particulars, because each number is a particular [Brown,JR] |
| 9620 | Empiricists base numbers on objects, Platonists base them on properties [Brown,JR] |
| 9639 | Does some mathematics depend entirely on notation? [Brown,JR] |
| 9629 | For nomalists there are no numbers, only numerals [Brown,JR] |
| 9630 | The most brilliant formalist was Hilbert [Brown,JR] |
| 9608 | There are no constructions for many highly desirable results in mathematics [Brown,JR] |
| 9645 | Constructivists say p has no value, if the value depends on Goldbach's Conjecture [Brown,JR] |
| 9619 | David's 'Napoleon' is about something concrete and something abstract [Brown,JR] |
| 10173 | A nominalist might avoid abstract objects by just appealing to mereological sums [Reck/Price] |
| 13730 | The Indiscernibility of Identicals has been a big problem for modal logic [Fitting/Mendelsohn] |
| 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] |
| 9611 | 'Abstract' nowadays means outside space and time, not concrete, not physical [Brown,JR] |
| 9609 | The older sense of 'abstract' is where 'redness' or 'group' is abstracted from particulars [Brown,JR] |
| 9640 | A term can have not only a sense and a reference, but also a 'computational role' [Brown,JR] |
| 9635 | Given atomism at one end, and a finite universe at the other, there are no physical infinities [Brown,JR] |