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] |
| 10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
| 10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
| 10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
| 10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
| 10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
| 10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
| 10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
| 10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
| 10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp] |
| 10765 | Soundness would seem to be an essential requirement of a proof procedure [Tharp] |
| 10763 | Completeness and compactness together give axiomatizability [Tharp] |
| 10770 | If completeness fails there is no algorithm to list the valid formulas [Tharp] |
| 10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
| 10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
| 10764 | A complete logic has an effective enumeration of the valid formulas [Tharp] |
| 10768 | Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp] |
| 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] |
| 1554 | Contradiction is impossible, since only one side of the argument refers to the true facts [Prodicus, by Didymus the Blind] |
| 1555 | People used to think anything helpful to life was a god, as the Egyptians think the Nile a god [Prodicus] |
| 535 | The gods are just personified human benefits [Prodicus] |
| 1543 | He denied the existence of the gods, saying they are just exaltations of things useful for life [Prodicus] |