13 ideas
18369 | There are at least fourteen candidates for truth-bearers [Kirkham] |
19318 | A 'sequence' of objects is an order set of them [Kirkham] |
19319 | If one sequence satisfies a sentence, they all do [Kirkham] |
19320 | If we define truth by listing the satisfactions, the supply of predicates must be finite [Kirkham] |
17750 | The first clear proof of the consistency of the first order predicate logic was in 1928 [Hilbert/Ackermann, by Walicki] |
19315 | In quantified language the components of complex sentences may not be sentences [Kirkham] |
19317 | An open sentence is satisfied if the object possess that property [Kirkham] |
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] |
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] |
19322 | Why can there not be disjunctive, conditional and negative facts? [Kirkham] |