Combining Texts

All the ideas for 'Set Theory', 'Modes of Extension: comment on Fine' and 'What are Sets and What are they For?'

expand these ideas     |    start again     |     specify just one area for these texts

23 ideas

4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
14239 The empty set is usually derived from Separation, but it also seems to need Infinity [Oliver/Smiley]
14240 The empty set is something, not nothing! [Oliver/Smiley]
14241 We don't need the empty set to express non-existence, as there are other ways to do that [Oliver/Smiley]
14242 Maybe we can treat the empty set symbol as just meaning an empty term [Oliver/Smiley]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / c. Unit (Singleton) Sets
14243 The unit set may be needed to express intersections that leave a single member [Oliver/Smiley]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / b. Axiom of Extensionality I
13030 Extensionality: ∀x ∀y (∀z (z ∈ x ↔ z ∈ y) → x = y) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / c. Axiom of Pairing II
13032 Pairing: ∀x ∀y ∃z (x ∈ z ∧ y ∈ z) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / d. Axiom of Unions III
13033 Union: ∀F ∃A ∀Y ∀x (x ∈ Y ∧ Y ∈ F → x ∈ A) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / f. Axiom of Infinity V
13037 Infinity: ∃x (0 ∈ x ∧ ∀y ∈ x (S(y) ∈ x) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / g. Axiom of Powers VI
13038 Power Set: ∀x ∃y ∀z(z ⊂ x → z ∈ y) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / h. Axiom of Replacement VII
13034 Replacement: ∀x∈A ∃!y φ(x,y) → ∃Y ∀X∈A ∃y∈Y φ(x,y) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / i. Axiom of Foundation VIII
13039 Foundation:∀x(∃y(y∈x) → ∃y(y∈x ∧ ¬∃z(z∈x ∧ z∈y))) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
13036 Choice: ∀A ∃R (R well-orders A) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / k. Axiom of Existence
13029 Set Existence: ∃x (x = x) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / n. Axiom of Comprehension
13031 Comprehension: ∃y ∀x (x ∈ y ↔ x ∈ z ∧ φ) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / o. Axiom of Constructibility V = L
13040 Constructibility: V = L (all sets are constructible) [Kunen]
5. Theory of Logic / G. Quantification / 6. Plural Quantification
14234 If you only refer to objects one at a time, you need sets in order to refer to a plurality [Oliver/Smiley]
14237 We can use plural language to refer to the set theory domain, to avoid calling it a 'set' [Oliver/Smiley]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
14245 Logical truths are true no matter what exists - but predicate calculus insists that something exists [Oliver/Smiley]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / g. Applying mathematics
14246 If mathematics purely concerned mathematical objects, there would be no applied mathematics [Oliver/Smiley]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
14247 Sets might either represent the numbers, or be the numbers, or replace the numbers [Oliver/Smiley]
18. Thought / E. Abstraction / 7. Abstracta by Equivalence
18883 Any equivalence relation among similar things allows the creation of an abstractum [Simons]
18884 Abstraction is usually seen as producing universals and numbers, but it can do more [Simons]