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] |
23445 | Naïve set theory says any formula defines a set, and coextensive sets are identical [Linnebo] |
23447 | In classical semantics singular terms refer, and quantifiers range over domains [Linnebo] |
23443 | The axioms of group theory are not assertions, but a definition of a structure [Linnebo] |
23444 | To investigate axiomatic theories, mathematics needs its own foundational axioms [Linnebo] |
23446 | You can't prove consistency using a weaker theory, but you can use a consistent theory [Linnebo] |
23448 | Mathematics is the study of all possible patterns, and is thus bound to describe the world [Linnebo] |
23441 | Logical truth is true in all models, so mathematical objects can't be purely logical [Linnebo] |
23442 | Game Formalism has no semantics, and Term Formalism reduces the semantics [Linnebo] |
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] |
11003 | The best version of reductionist actualism around is Armstrong's combinatorial account [Armstrong, by Read] |