92 ideas
| 15357 | Philosophy is the most general intellectual discipline [Horsten] |
| 15352 | A definition should allow the defined term to be eliminated [Horsten] |
| 9955 | Contextual definitions replace a complete sentence containing the expression [George/Velleman] |
| 10031 | Impredicative definitions quantify over the thing being defined [George/Velleman] |
| 10882 | Predicative definitions only refer to entities outside the defined collection [Horsten] |
| 15324 | Semantic theories of truth seek models; axiomatic (syntactic) theories seek logical principles [Horsten] |
| 15323 | Truth is a property, because the truth predicate has an extension [Horsten] |
| 15374 | Truth has no 'nature', but we should try to describe its behaviour in inferences [Horsten] |
| 15348 | Propositions have sentence-like structures, so it matters little which bears the truth [Horsten] |
| 15333 | Modern correspondence is said to be with the facts, not with true propositions [Horsten] |
| 15337 | The correspondence 'theory' is too vague - about both 'correspondence' and 'facts' [Horsten] |
| 15334 | The coherence theory allows multiple coherent wholes, which could contradict one another [Horsten] |
| 15336 | The pragmatic theory of truth is relative; useful for group A can be useless for group B [Horsten] |
| 15354 | Tarski's hierarchy lacks uniform truth, and depends on contingent factors [Horsten] |
| 15340 | Tarski Bi-conditional: if you'll assert φ you'll assert φ-is-true - and also vice versa [Horsten] |
| 15345 | Semantic theories have a regress problem in describing truth in the languages for the models [Horsten] |
| 15373 | Axiomatic approaches avoid limiting definitions to avoid the truth predicate, and limited sizes of models [Horsten] |
| 15346 | Axiomatic approaches to truth avoid the regress problem of semantic theories [Horsten] |
| 15371 | An axiomatic theory needs to be of maximal strength, while being natural and sound [Horsten] |
| 15332 | 'Reflexive' truth theories allow iterations (it is T that it is T that p) [Horsten] |
| 15361 | A good theory of truth must be compositional (as well as deriving biconditionals) [Horsten] |
| 15350 | The Naďve Theory takes the bi-conditionals as axioms, but it is inconsistent, and allows the Liar [Horsten] |
| 15351 | Axiomatic theories take truth as primitive, and propose some laws of truth as axioms [Horsten] |
| 15367 | By adding truth to Peano Arithmetic we increase its power, so truth has mathematical content! [Horsten] |
| 15330 | Friedman-Sheard theory keeps classical logic and aims for maximum strength [Horsten] |
| 15331 | Kripke-Feferman has truth gaps, instead of classical logic, and aims for maximum strength [Horsten] |
| 15325 | Inferential deflationism says truth has no essence because no unrestricted logic governs the concept [Horsten] |
| 15344 | Deflationism skips definitions and models, and offers just accounts of basic laws of truth [Horsten] |
| 15356 | Deflationism concerns the nature and role of truth, but not its laws [Horsten] |
| 15368 | This deflationary account says truth has a role in generality, and in inference [Horsten] |
| 15358 | Deflationism says truth isn't a topic on its own - it just concerns what is true [Horsten] |
| 15359 | Deflation: instead of asserting a sentence, we can treat it as an object with the truth-property [Horsten] |
| 15329 | Nonclassical may accept T/F but deny applicability, or it may deny just T or F as well [Horsten] |
| 10098 | The 'power set' of A is all the subsets of A [George/Velleman] |
| 10099 | The 'ordered pair' <a, b>, for two sets a and b, is the set {{a, b},{a}} [George/Velleman] |
| 10101 |
Cartesian Product A x B: the set of all ordered pairs |
| 10103 | Grouping by property is common in mathematics, usually using equivalence [George/Velleman] |
| 10104 | 'Equivalence' is a reflexive, symmetric and transitive relation; 'same first letter' partitions English words [George/Velleman] |
| 10096 | Even the elements of sets in ZFC are sets, resting on the pure empty set [George/Velleman] |
| 10097 | Axiom of Extensionality: for all sets x and y, if x and y have the same elements then x = y [George/Velleman] |
| 10100 | Axiom of Pairing: for all sets x and y, there is a set z containing just x and y [George/Velleman] |
| 17900 | The Axiom of Reducibility made impredicative definitions possible [George/Velleman] |
| 10109 | ZFC can prove that there is no set corresponding to the concept 'set' [George/Velleman] |
| 10108 | As a reduction of arithmetic, set theory is not fully general, and so not logical [George/Velleman] |
| 15326 | Doubt is thrown on classical logic by the way it so easily produces the liar paradox [Horsten] |
| 15341 | Deduction Theorem: ψ only derivable from φ iff φ→ψ are axioms [Horsten] |
| 10111 | Asserting Excluded Middle is a hallmark of realism about the natural world [George/Velleman] |
| 15328 | A theory is 'non-conservative' if it facilitates new mathematical proofs [Horsten] |
| 15349 | It is easier to imagine truth-value gaps (for the Liar, say) than for truth-value gluts (both T and F) [Horsten] |
| 15366 | Satisfaction is a primitive notion, and very liable to semantical paradoxes [Horsten] |
| 10129 | A 'model' is a meaning-assignment which makes all the axioms true [George/Velleman] |
| 10105 | Differences between isomorphic structures seem unimportant [George/Velleman] |
| 10884 | A theory is 'categorical' if it has just one model up to isomorphism [Horsten] |
| 10119 | Consistency is a purely syntactic property, unlike the semantic property of soundness [George/Velleman] |
| 10126 | A 'consistent' theory cannot contain both a sentence and its negation [George/Velleman] |
| 10120 | Soundness is a semantic property, unlike the purely syntactic property of consistency [George/Velleman] |
| 10127 | A 'complete' theory contains either any sentence or its negation [George/Velleman] |
| 15353 | The first incompleteness theorem means that consistency does not entail soundness [Horsten] |
| 15355 | Strengthened Liar: 'this sentence is not true in any context' - in no context can this be evaluated [Horsten] |
| 10106 | Rational numbers give answers to division problems with integers [George/Velleman] |
| 10102 | The integers are answers to subtraction problems involving natural numbers [George/Velleman] |
| 10107 | Real numbers provide answers to square root problems [George/Velleman] |
| 15364 | English expressions are denumerably infinite, but reals are nondenumerable, so many are unnameable [Horsten] |
| 9946 | Logicists say mathematics is applicable because it is totally general [George/Velleman] |
| 10125 | The classical mathematician believes the real numbers form an actual set [George/Velleman] |
| 10885 | Computer proofs don't provide explanations [Horsten] |
| 13007 | Archimedes defined a straight line as the shortest distance between two points [Archimedes, by Leibniz] |
| 17899 | Second-order induction is stronger as it covers all concepts, not just first-order definable ones [George/Velleman] |
| 10128 | The Incompleteness proofs use arithmetic to talk about formal arithmetic [George/Velleman] |
| 17902 | A successor is the union of a set with its singleton [George/Velleman] |
| 10133 | Frege's Theorem shows the Peano Postulates can be derived from Hume's Principle [George/Velleman] |
| 10881 | The concept of 'ordinal number' is set-theoretic, not arithmetical [Horsten] |
| 15360 | ZFC showed that the concept of set is mathematical, not logical, because of its existence claims [Horsten] |
| 15369 | Set theory is substantial over first-order arithmetic, because it enables new proofs [Horsten] |
| 10130 | Set theory can prove the Peano Postulates [George/Velleman] |
| 10089 | Talk of 'abstract entities' is more a label for the problem than a solution to it [George/Velleman] |
| 10131 | If mathematics is not about particulars, observing particulars must be irrelevant [George/Velleman] |
| 10092 | In the unramified theory of types, the types are objects, then sets of objects, sets of sets etc. [George/Velleman] |
| 10094 | The theory of types seems to rule out harmless sets as well as paradoxical ones. [George/Velleman] |
| 10095 | Type theory has only finitely many items at each level, which is a problem for mathematics [George/Velleman] |
| 17901 | Type theory prohibits (oddly) a set containing an individual and a set of individuals [George/Velleman] |
| 10114 | Bounded quantification is originally finitary, as conjunctions and disjunctions [George/Velleman] |
| 10134 | Much infinite mathematics can still be justified finitely [George/Velleman] |
| 10123 | The intuitionists are the idealists of mathematics [George/Velleman] |
| 10124 | Gödel's First Theorem suggests there are truths which are independent of proof [George/Velleman] |
| 15370 | Predicativism says mathematical definitions must not include the thing being defined [Horsten] |
| 15338 | We may believe in atomic facts, but surely not complex disjunctive ones? [Horsten] |
| 15363 | In the supervaluationist account, disjunctions are not determined by their disjuncts [Horsten] |
| 15362 | If 'Italy is large' lacks truth, so must 'Italy is not large'; but classical logic says it's large or it isn't [Horsten] |
| 15372 | Some claim that indicative conditionals are believed by people, even though they are not actually held true [Horsten] |
| 10110 | Corresponding to every concept there is a class (some of them sets) [George/Velleman] |
| 15347 | A theory of syntax can be based on Peano arithmetic, thanks to the translation by Gödel coding [Horsten] |