16 ideas
| 13913 | The four 'perfect syllogisms' are called Barbara, Celarent, Darii and Ferio [Engelbretsen/Sayward] |
| 13914 | Syllogistic logic has one rule: what is affirmed/denied of wholes is affirmed/denied of their parts [Engelbretsen/Sayward] |
| 13915 | Syllogistic can't handle sentences with singular terms, or relational terms, or compound sentences [Engelbretsen/Sayward] |
| 13916 | Term logic uses expression letters and brackets, and '-' for negative terms, and '+' for compound terms [Engelbretsen/Sayward] |
| 13850 | In modern logic all formal validity can be characterised syntactically [Engelbretsen/Sayward] |
| 13849 | Classical logic rests on truth and models, where constructivist logic rests on defence and refutation [Engelbretsen/Sayward] |
| 13851 | Unlike most other signs, = cannot be eliminated [Engelbretsen/Sayward] |
| 13852 | Axioms are ω-incomplete if the instances are all derivable, but the universal quantification isn't [Engelbretsen/Sayward] |
| 3338 | Numbers have been defined in terms of 'successors' to the concept of 'zero' [Peano, by Blackburn] |
| 13949 | All models of Peano axioms are isomorphic, so the models all seem equally good for natural numbers [Cartwright,R on Peano] |
| 18113 | PA concerns any entities which satisfy the axioms [Peano, by Bostock] |
| 17634 | Peano axioms not only support arithmetic, but are also fairly obvious [Peano, by Russell] |
| 5897 | 0 is a non-successor number, all successors are numbers, successors can't duplicate, if P(n) and P(n+1) then P(all-n) [Peano, by Flew] |
| 15653 | We can add Reflexion Principles to Peano Arithmetic, which assert its consistency or soundness [Halbach on Peano] |
| 17635 | Arithmetic can have even simpler logical premises than the Peano Axioms [Russell on Peano] |
| 9591 | The human intellect has not been, and cannot be, fully formalized [Nagel/Newman] |