55 ideas
| 17926 | Rejecting double negation elimination undermines reductio proofs [Colyvan] |
| 17925 | Showing a disproof is impossible is not a proof, so don't eliminate double negation [Colyvan] |
| 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] |
| 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] |
| 17924 | Excluded middle says P or not-P; bivalence says P is either true or false [Colyvan] |
| 17929 | Löwenheim proved his result for a first-order sentence, and Skolem generalised it [Colyvan] |
| 17930 | Axioms are 'categorical' if all of their models are isomorphic [Colyvan] |
| 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] |
| 17928 | Ordinal numbers represent order relations [Colyvan] |
| 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] |
| 15949 | The theory of infinity must rest on our inability to distinguish between very large sizes [Lavine] |
| 17923 | Intuitionists only accept a few safe infinities [Colyvan] |
| 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] |
| 17941 | Infinitesimals were sometimes zero, and sometimes close to zero [Colyvan] |
| 17922 | Reducing real numbers to rationals suggested arithmetic as the foundation of maths [Colyvan] |
| 17936 | Transfinite induction moves from all cases, up to the limit ordinal [Colyvan] |
| 15929 | Set theory will found all of mathematics - except for the notion of proof [Lavine] |
| 17940 | Most mathematical proofs are using set theory, but without saying so [Colyvan] |
| 17931 | Structuralism say only 'up to isomorphism' matters because that is all there is to it [Colyvan] |
| 17932 | If 'in re' structures relies on the world, does the world contain rich enough structures? [Colyvan] |
| 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] |
| 3061 | Anaxarchus said that he was not even sure that he knew nothing [Anaxarchus, by Diog. Laertius] |
| 17943 | Probability supports Bayesianism better as degrees of belief than as ratios of frequencies [Colyvan] |
| 17939 | Mathematics can reveal structural similarities in diverse systems [Colyvan] |
| 17938 | Mathematics can show why some surprising events have to occur [Colyvan] |
| 17934 | Proof by cases (by 'exhaustion') is said to be unexplanatory [Colyvan] |
| 17933 | Reductio proofs do not seem to be very explanatory [Colyvan] |
| 17935 | If inductive proofs hold because of the structure of natural numbers, they may explain theorems [Colyvan] |
| 17942 | Can a proof that no one understands (of the four-colour theorem) really be a proof? [Colyvan] |
| 17937 | Mathematical generalisation is by extending a system, or by abstracting away from it [Colyvan] |