33 ideas
17749 | Post proved the consistency of propositional logic in 1921 [Walicki] |
17765 | Propositional language can only relate statements as the same or as different [Walicki] |
17764 | Boolean connectives are interpreted as functions on the set {1,0} [Walicki] |
17752 | The empty set is useful for defining sets by properties, when the members are not yet known [Walicki] |
17753 | The empty set avoids having to take special precautions in case members vanish [Walicki] |
17759 | Ordinals play the central role in set theory, providing the model of well-ordering [Walicki] |
17741 | To determine the patterns in logic, one must identify its 'building blocks' [Walicki] |
17747 | A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki] |
17748 | The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki] |
17761 | A compact axiomatisation makes it possible to understand a field as a whole [Walicki] |
17763 | Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki] |
17758 | Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki] |
17755 | Ordinals are the empty set, union with the singleton, and any arbitrary union of ordinals [Walicki] |
17756 | The union of finite ordinals is the first 'limit ordinal'; 2ω is the second... [Walicki] |
17760 | Two infinite ordinals can represent a single infinite cardinal [Walicki] |
17757 | Members of ordinals are ordinals, and also subsets of ordinals [Walicki] |
17762 | In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki] |
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] |
17754 | Inductive proof depends on the choice of the ordering [Walicki] |
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] |
17742 | Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki] |
19718 | Indefeasibility does not imply infallibility [Grundmann] |
19717 | Can a defeater itself be defeated? [Grundmann] |
19716 | Simple reliabilism can't cope with defeaters of reliably produced beliefs [Grundmann] |
19715 | You can 'rebut' previous beliefs, 'undercut' the power of evidence, or 'reason-defeat' the truth [Grundmann] |
19713 | Defeasibility theory needs to exclude defeaters which are true but misleading [Grundmann] |
19714 | Knowledge requires that there are no facts which would defeat its justification [Grundmann] |
19719 | 'Moderate' foundationalism has basic justification which is defeasible [Grundmann] |