30 ideas
| 19125 | If we define truth, we can eliminate it [Halbach/Leigh] |
| 19128 | If a language cannot name all objects, then satisfaction must be used, instead of unary truth [Halbach/Leigh] |
| 19120 | Semantic theories need a powerful metalanguage, typically including set theory [Halbach/Leigh] |
| 19127 | The T-sentences are deductively weak, and also not deductively conservative [Halbach/Leigh] |
| 19124 | A natural theory of truth plays the role of reflection principles, establishing arithmetic's soundness [Halbach/Leigh] |
| 19126 | If deflationary truth is not explanatory, truth axioms should be 'conservative', proving nothing new [Halbach/Leigh] |
| 19129 | The FS axioms use classical logical, but are not fully consistent [Halbach/Leigh] |
| 19130 | KF is formulated in classical logic, but describes non-classical truth, which allows truth-value gluts [Halbach/Leigh] |
| 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] |
| 17754 | Inductive proof depends on the choice of the ordering [Walicki] |
| 19121 | We can reduce properties to true formulas [Halbach/Leigh] |
| 19122 | Nominalists can reduce theories of properties or sets to harmless axiomatic truth theories [Halbach/Leigh] |
| 17742 | Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki] |
| 20653 | Six reduction levels: groups, lives, cells, molecules, atoms, particles [Putnam/Oppenheim, by Watson] |