75 ideas
| 9955 | Contextual definitions replace a complete sentence containing the expression [George/Velleman] |
| 10031 | Impredicative definitions quantify over the thing being defined [George/Velleman] |
| 15945 | Second-order set theory just adds a version of Replacement that quantifies over functions [Lavine] |
| 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] |
| 15914 | An 'upper bound' is the greatest member of a subset; there may be several of these, so there is a 'least' one [Lavine] |
| 15921 | Collections of things can't be too big, but collections by a rule seem unlimited in size [Lavine] |
| 15937 | Those who reject infinite collections also want to reject the Axiom of Choice [Lavine] |
| 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] |
| 15936 | The Power Set is just the collection of functions from one collection to another [Lavine] |
| 15899 | Replacement was immediately accepted, despite having very few implications [Lavine] |
| 15930 | Foundation says descending chains are of finite length, blocking circularity, or ungrounded sets [Lavine] |
| 15920 | Pure collections of things obey Choice, but collections defined by a rule may not [Lavine] |
| 15898 | The controversy was not about the Axiom of Choice, but about functions as arbitrary, or given by rules [Lavine] |
| 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] |
| 15919 | The 'logical' notion of class has some kind of definition or rule to characterise the class [Lavine] |
| 15900 | The iterative conception of set wasn't suggested until 1947 [Lavine] |
| 15931 | The iterative conception needs the Axiom of Infinity, to show how far we can iterate [Lavine] |
| 15932 | The iterative conception doesn't unify the axioms, and has had little impact on mathematical proofs [Lavine] |
| 15933 | Limitation of Size: if it's the same size as a set, it's a set; it uses Replacement [Lavine] |
| 15913 | A collection is 'well-ordered' if there is a least element, and all of its successors can be identified [Lavine] |
| 10108 | As a reduction of arithmetic, set theory is not fully general, and so not logical [George/Velleman] |
| 15926 | Second-order logic presupposes a set of relations already fixed by the first-order domain [Lavine] |
| 10111 | Asserting Excluded Middle is a hallmark of realism about the natural world [George/Velleman] |
| 15934 | Mathematical proof by contradiction needs the law of excluded middle [Lavine] |
| 10129 | A 'model' is a meaning-assignment which makes all the axioms true [George/Velleman] |
| 10105 | Differences between isomorphic structures seem unimportant [George/Velleman] |
| 10126 | A 'consistent' theory cannot contain both a sentence and its negation [George/Velleman] |
| 10119 | Consistency is a purely syntactic property, unlike the semantic property of soundness [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] |
| 15907 | Mathematics is nowadays (thanks to set theory) regarded as the study of structure, not of quantity [Lavine] |
| 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] |
| 15942 | Every rational number, unlike every natural number, is divisible by some other number [Lavine] |
| 10107 | Real numbers provide answers to square root problems [George/Velleman] |
| 15922 | For the real numbers to form a set, we need the Continuum Hypothesis to be true [Lavine] |
| 18250 | Cauchy gave a necessary condition for the convergence of a sequence [Lavine] |
| 15904 | The two sides of the Cut are, roughly, the bounding commensurable ratios [Lavine] |
| 15912 | Counting results in well-ordering, and well-ordering makes counting possible [Lavine] |
| 9946 | Logicists say mathematics is applicable because it is totally general [George/Velleman] |
| 15947 | The infinite is extrapolation from the experience of indefinitely large size [Lavine] |
| 15949 | The theory of infinity must rest on our inability to distinguish between very large sizes [Lavine] |
| 15940 | The intuitionist endorses only the potential infinite [Lavine] |
| 10125 | The classical mathematician believes the real numbers form an actual set [George/Velleman] |
| 15909 | 'Aleph-0' is cardinality of the naturals, 'aleph-1' the next cardinal, 'aleph-ω' the ω-th cardinal [Lavine] |
| 15915 | Ordinals are basic to Cantor's transfinite, to count the sets [Lavine] |
| 15917 | Paradox: the class of all ordinals is well-ordered, so must have an ordinal as type - giving a bigger ordinal [Lavine] |
| 15918 | Paradox: there is no largest cardinal, but the class of everything seems to be the largest [Lavine] |
| 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] |
| 15929 | Set theory will found all of mathematics - except for the notion of proof [Lavine] |
| 10089 | Talk of 'abstract entities' is more a label for the problem than a solution to it [George/Velleman] |
| 15935 | Modern mathematics works up to isomorphism, and doesn't care what things 'really are' [Lavine] |
| 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] |
| 15928 | Intuitionism rejects set-theory to found mathematics [Lavine] |
| 3061 | Anaxarchus said that he was not even sure that he knew nothing [Anaxarchus, by Diog. Laertius] |
| 10110 | Corresponding to every concept there is a class (some of them sets) [George/Velleman] |