19 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] |
| 13201 | ∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton] |
| 13204 | The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [Enderton] |
| 13206 | A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton] |
| 13200 | Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ [Enderton] |
| 13199 | The empty set may look pointless, but many sets can be constructed from it [Enderton] |
| 13203 | The singleton is defined using the pairing axiom (as {x,x}) [Enderton] |
| 13202 | Fraenkel added Replacement, to give a theory of ordinal numbers [Enderton] |
| 13205 | We can only define functions if Choice tells us which items are involved [Enderton] |
| 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] |
| 22200 | If you eliminate the impossible, the truth will remain, even if it is weird [Conan Doyle] |