display all the ideas for this combination of philosophers
15 ideas
15945 | Second-order set theory just adds a version of Replacement that quantifies over functions [Lavine] |
Full Idea: Second-order set theory is just like first-order set-theory, except that we use the version of Replacement with a universal second-order quantifier over functions from set to sets. | |
From: Shaughan Lavine (Understanding the Infinite [1994], VII.4) |
15914 | An 'upper bound' is the greatest member of a subset; there may be several of these, so there is a 'least' one [Lavine] |
Full Idea: A member m of M is an 'upper bound' of a subset N of M if m is not less than any member of N. A member m of M is a 'least upper bound' of N if m is an upper bound of N such that if l is any other upper bound of N, then m is less than l. | |
From: Shaughan Lavine (Understanding the Infinite [1994], III.4) | |
A reaction: [if you don't follow that, you'll have to keep rereading it till you do] |
15921 | Collections of things can't be too big, but collections by a rule seem unlimited in size [Lavine] |
Full Idea: Since combinatorial collections are enumerated, some multiplicities may be too large to be gathered into combinatorial collections. But the size of a multiplicity seems quite irrelevant to whether it forms a logical connection. | |
From: Shaughan Lavine (Understanding the Infinite [1994], IV.2) |
15937 | Those who reject infinite collections also want to reject the Axiom of Choice [Lavine] |
Full Idea: Many of those who are skeptical about the existence of infinite combinatorial collections would want to doubt or deny the Axiom of Choice. | |
From: Shaughan Lavine (Understanding the Infinite [1994], VI.2) |
15936 | The Power Set is just the collection of functions from one collection to another [Lavine] |
Full Idea: The Power Set is just he codification of the fact that the collection of functions from a mathematical collection to a mathematical collection is itself a mathematical collection that can serve as a domain of mathematical study. | |
From: Shaughan Lavine (Understanding the Infinite [1994], VI.1) |
15899 | Replacement was immediately accepted, despite having very few implications [Lavine] |
Full Idea: The Axiom of Replacement (of Skolem and Fraenkel) was remarkable for its universal acceptance, though it seemed to have no consequences except for the properties of the higher reaches of the Cantorian infinite. | |
From: Shaughan Lavine (Understanding the Infinite [1994], I) |
15930 | Foundation says descending chains are of finite length, blocking circularity, or ungrounded sets [Lavine] |
Full Idea: The Axiom of Foundation (Zermelo 1930) says 'Every (descending) chain in which each element is a member of the previous one is of finite length'. ..This forbids circles of membership, or ungrounded sets. ..The iterative conception gives this centre stage. | |
From: Shaughan Lavine (Understanding the Infinite [1994], V.4) |
15898 | The controversy was not about the Axiom of Choice, but about functions as arbitrary, or given by rules [Lavine] |
Full Idea: The controversy was not about Choice per se, but about the correct notion of function - between advocates of taking mathematics to be about arbitrary functions and advocates of taking it to be about functions given by rules. | |
From: Shaughan Lavine (Understanding the Infinite [1994], I) |
15920 | Pure collections of things obey Choice, but collections defined by a rule may not [Lavine] |
Full Idea: Combinatorial collections (defined just by the members) obviously obey the Axiom of Choice, while it is at best dubious whether logical connections (defined by a rule) do. | |
From: Shaughan Lavine (Understanding the Infinite [1994], IV.2) |
15919 | The 'logical' notion of class has some kind of definition or rule to characterise the class [Lavine] |
Full Idea: The Peano-Russell notion of class is the 'logical' notion, where each collection is associated with some kind of definition or rule that characterises the members of the collection. | |
From: Shaughan Lavine (Understanding the Infinite [1994], IV.1) |
15900 | The iterative conception of set wasn't suggested until 1947 [Lavine] |
Full Idea: The iterative conception of set was not so much as suggested, let alone advocated by anyone, until 1947. | |
From: Shaughan Lavine (Understanding the Infinite [1994], I) |
15931 | The iterative conception needs the Axiom of Infinity, to show how far we can iterate [Lavine] |
Full Idea: The iterative conception of sets does not tell us how far to iterate, and so we must start with an Axiom of Infinity. It also presupposes the notion of 'transfinite iteration'. | |
From: Shaughan Lavine (Understanding the Infinite [1994], V.5) |
15932 | The iterative conception doesn't unify the axioms, and has had little impact on mathematical proofs [Lavine] |
Full Idea: The iterative conception does not provide a conception that unifies the axioms of set theory, ...and it has had very little impact on what theorems can be proved. | |
From: Shaughan Lavine (Understanding the Infinite [1994], V.5) | |
A reaction: He says he would like to reject the iterative conception, but it may turn out that Foundation enables new proofs in mathematics (though it hasn't so far). |
15933 | Limitation of Size: if it's the same size as a set, it's a set; it uses Replacement [Lavine] |
Full Idea: Limitation of Size has it that if a collection is the same size as a set, then it is a set. The Axiom of Replacement is characteristic of limitation of size. | |
From: Shaughan Lavine (Understanding the Infinite [1994], V.5) |
15913 | A collection is 'well-ordered' if there is a least element, and all of its successors can be identified [Lavine] |
Full Idea: A collection M is 'well-ordered' by a relation < if < linearly orders M with a least element, and every subset of M that has an upper bound not in it has an immediate successor. | |
From: Shaughan Lavine (Understanding the Infinite [1994], III.4) |