53 ideas
| 10170 | While true-in-a-model seems relative, true-in-all-models seems not to be [Reck/Price] |
| 15945 | Second-order set theory just adds a version of Replacement that quantifies over functions [Lavine] |
| 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] |
| 10166 | ZFC set theory has only 'pure' sets, without 'urelements' [Reck/Price] |
| 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] |
| 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] |
| 15926 | Second-order logic presupposes a set of relations already fixed by the first-order domain [Lavine] |
| 15934 | Mathematical proof by contradiction needs the law of excluded middle [Lavine] |
| 10175 | Three types of variable in second-order logic, for objects, functions, and predicates/sets [Reck/Price] |
| 15907 | Mathematics is nowadays (thanks to set theory) regarded as the study of structure, not of quantity [Lavine] |
| 15942 | Every rational number, unlike every natural number, is divisible by some other number [Lavine] |
| 15922 | For the real numbers to form a set, we need the Continuum Hypothesis to be true [Lavine] |
| 10165 | 'Analysis' is the theory of the real numbers [Reck/Price] |
| 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] |
| 15949 | The theory of infinity must rest on our inability to distinguish between very large sizes [Lavine] |
| 15947 | The infinite is extrapolation from the experience of indefinitely large size [Lavine] |
| 15940 | The intuitionist endorses only the potential infinite [Lavine] |
| 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] |
| 10174 | Mereological arithmetic needs infinite objects, and function definitions [Reck/Price] |
| 10164 | Peano Arithmetic can have three second-order axioms, plus '1' and 'successor' [Reck/Price] |
| 10172 | Set-theory gives a unified and an explicit basis for mathematics [Reck/Price] |
| 15929 | Set theory will found all of mathematics - except for the notion of proof [Lavine] |
| 10167 | Structuralism emerged from abstract algebra, axioms, and set theory and its structures [Reck/Price] |
| 10169 | Relativist Structuralism just stipulates one successful model as its arithmetic [Reck/Price] |
| 10179 | There are 'particular' structures, and 'universal' structures (what the former have in common) [Reck/Price] |
| 10181 | Pattern Structuralism studies what isomorphic arithmetic models have in common [Reck/Price] |
| 10182 | There are Formalist, Relativist, Universalist and Pattern structuralism [Reck/Price] |
| 10168 | Formalist Structuralism says the ontology is vacuous, or formal, or inference relations [Reck/Price] |
| 10178 | Maybe we should talk of an infinity of 'possible' objects, to avoid arithmetic being vacuous [Reck/Price] |
| 10176 | Universalist Structuralism is based on generalised if-then claims, not one particular model [Reck/Price] |
| 10177 | Universalist Structuralism eliminates the base element, as a variable, which is then quantified out [Reck/Price] |
| 10171 | The existence of an infinite set is assumed by Relativist Structuralism [Reck/Price] |
| 15935 | Modern mathematics works up to isomorphism, and doesn't care what things 'really are' [Lavine] |
| 15928 | Intuitionism rejects set-theory to found mathematics [Lavine] |
| 21846 | Bergson was a rallying point, because he emphasised becomings and multiplicities [Bergson, by Deleuze] |
| 10173 | A nominalist might avoid abstract objects by just appealing to mereological sums [Reck/Price] |
| 21854 | Bergson showed that memory is not after the event, but coexists with it [Bergson, by Deleuze] |