98 ideas
| 13466 | We are all post-Kantians, because he set the current agenda for philosophy [Hart,WD] |
| 13477 | The problems are the monuments of philosophy [Hart,WD] |
| 13515 | To study abstract problems, some knowledge of set theory is essential [Hart,WD] |
| 9955 | Contextual definitions replace a complete sentence containing the expression [George/Velleman] |
| 10031 | Impredicative definitions quantify over the thing being defined [George/Velleman] |
| 6334 | The function of the truth predicate? Understanding 'true'? Meaning of 'true'? The concept of truth? A theory of truth? [Horwich] |
| 6342 | Some correspondence theories concern facts; others are built up through reference and satisfaction [Horwich] |
| 13469 | Tarski showed how we could have a correspondence theory of truth, without using 'facts' [Hart,WD] |
| 6332 | The common-sense theory of correspondence has never been worked out satisfactorily [Horwich] |
| 13504 | Truth for sentences is satisfaction of formulae; for sentences, either all sequences satisfy it (true) or none do [Hart,WD] |
| 13503 | A first-order language has an infinity of T-sentences, which cannot add up to a definition of truth [Hart,WD] |
| 6335 | The redundancy theory cannot explain inferences from 'what x said is true' and 'x said p', to p [Horwich] |
| 23299 | Horwich's deflationary view is novel, because it relies on propositions rather than sentences [Horwich, by Davidson] |
| 6344 | Truth is a useful concept for unarticulated propositions and generalisations about them [Horwich] |
| 6336 | No deflationary conception of truth does justice to the fact that we aim for truth [Horwich] |
| 6337 | The deflationary picture says believing a theory true is a trivial step after believing the theory [Horwich] |
| 13500 | Conditional Proof: infer a conditional, if the consequent can be deduced from the antecedent [Hart,WD] |
| 13502 | ∃y... is read as 'There exists an individual, call it y, such that...', and not 'There exists a y such that...' [Hart,WD] |
| 13456 | Set theory articulates the concept of order (through relations) [Hart,WD] |
| 13497 | Nowadays ZFC and NBG are the set theories; types are dead, and NF is only useful for the whole universe [Hart,WD] |
| 13443 | ∈ relates across layers, while ⊆ relates within layers [Hart,WD] |
| 10098 | The 'power set' of A is all the subsets of A [George/Velleman] |
| 10101 |
Cartesian Product A x B: the set of all ordered pairs |
| 10099 | The 'ordered pair' <a, b>, for two sets a and b, is the set {{a, b},{a}} [George/Velleman] |
| 13442 | Without the empty set we could not form a∩b without checking that a and b meet [Hart,WD] |
| 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] |
| 13493 | In the modern view, foundation is the heart of the way to do set theory [Hart,WD] |
| 13495 | Foundation Axiom: an nonempty set has a member disjoint from it [Hart,WD] |
| 13462 | With the Axiom of Choice every set can be well-ordered [Hart,WD] |
| 13461 | We can choose from finite and evident sets, but not from infinite opaque ones [Hart,WD] |
| 13516 | If we accept that V=L, it seems to settle all the open questions of set theory [Hart,WD] |
| 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] |
| 13441 | Naïve set theory has trouble with comprehension, the claim that every predicate has an extension [Hart,WD] |
| 13494 | The iterative conception may not be necessary, and may have fixed points or infinitely descending chains [Hart,WD] |
| 13460 | 'Well-ordering' must have a least member, so it does the natural numbers but not the integers [Hart,WD] |
| 13458 | A partial ordering becomes 'total' if any two members of its field are comparable [Hart,WD] |
| 13457 | A 'partial ordering' is irreflexive and transitive; the sets are ordered, but not the subsets [Hart,WD] |
| 13490 | Von Neumann defines α<β as α∈β [Hart,WD] |
| 13481 | Maybe sets should be rethought in terms of the even more basic categories [Hart,WD] |
| 10108 | As a reduction of arithmetic, set theory is not fully general, and so not logical [George/Velleman] |
| 10111 | Asserting Excluded Middle is a hallmark of realism about the natural world [George/Velleman] |
| 6339 | Logical form is the aspects of meaning that determine logical entailments [Horwich] |
| 13506 | The universal quantifier can't really mean 'all', because there is no universal set [Hart,WD] |
| 13513 | Models are ways the world might be from a first-order point of view [Hart,WD] |
| 13505 | Model theory studies how set theory can model sets of sentences [Hart,WD] |
| 13511 | Model theory is mostly confined to first-order theories [Hart,WD] |
| 13512 | Modern model theory begins with the proof of Los's Conjecture in 1962 [Hart,WD] |
| 10129 | A 'model' is a meaning-assignment which makes all the axioms true [George/Velleman] |
| 10105 | Differences between isomorphic structures seem unimportant [George/Velleman] |
| 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] |
| 13496 | First-order logic is 'compact': consequences of a set are consequences of a finite subset [Hart,WD] |
| 13484 | Berry's Paradox: we succeed in referring to a number, with a term which says we can't do that [Hart,WD] |
| 13482 | The Burali-Forti paradox is a crisis for Cantor's ordinals [Hart,WD] |
| 13507 | The machinery used to solve the Liar can be rejigged to produce a new Liar [Hart,WD] |
| 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] |
| 13459 | The less-than relation < well-orders, and partially orders, and totally orders the ordinal numbers [Hart,WD] |
| 13463 | There are at least as many infinite cardinals as transfinite ordinals (because they will map) [Hart,WD] |
| 13491 | The axiom of infinity with separation gives a least limit ordinal ω [Hart,WD] |
| 13492 | Von Neumann's ordinals generalise into the transfinite better, because Zermelo's ω is a singleton [Hart,WD] |
| 13446 | 19th century arithmetization of analysis isolated the real numbers from geometry [Hart,WD] |
| 10107 | Real numbers provide answers to square root problems [George/Velleman] |
| 9946 | Logicists say mathematics is applicable because it is totally general [George/Velleman] |
| 13509 | We can establish truths about infinite numbers by means of induction [Hart,WD] |
| 10125 | The classical mathematician believes the real numbers form an actual set [George/Velleman] |
| 13474 | Euclid has a unique parallel, spherical geometry has none, and saddle geometry has several [Hart,WD] |
| 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] |
| 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] |
| 13471 | Mathematics makes existence claims, but philosophers usually say those are never analytic [Hart,WD] |
| 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] |
| 13488 | Mass words do not have plurals, or numerical adjectives, or use 'fewer' [Hart,WD] |
| 13480 | Fregean self-evidence is an intrinsic property of basic truths, rules and definitions [Hart,WD] |
| 13476 | The failure of key assumptions in geometry, mereology and set theory throw doubt on the a priori [Hart,WD] |
| 10110 | Corresponding to every concept there is a class (some of them sets) [George/Velleman] |
| 13475 | The Fregean concept of GREEN is a function assigning true to green things, and false to the rest [Hart,WD] |
| 6338 | We could know the truth-conditions of a foreign sentence without knowing its meaning [Horwich] |
| 6340 | There are Fregean de dicto propositions, and Russellian de re propositions, or a mixture [Horwich] |
| 6341 | Right translation is a mapping of languages which preserves basic patterns of usage [Horwich] |