Combining Texts

All the ideas for 'Set Theory', 'Mathematics and Philosophy: grand and little' and 'Elements of Set Theory'

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


25 ideas

1. Philosophy / D. Nature of Philosophy / 5. Aims of Philosophy / e. Philosophy as reason
Philosophy aims to reveal the grandeur of mathematics [Badiou]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton]
The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [Enderton]
A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ [Enderton]
The empty set may look pointless, but many sets can be constructed from it [Enderton]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / c. Unit (Singleton) Sets
The singleton is defined using the pairing axiom (as {x,x}) [Enderton]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / b. Axiom of Extensionality I
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
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
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
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
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
Fraenkel added Replacement, to give a theory of ordinal numbers [Enderton]
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
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
We can only define functions if Choice tells us which items are involved [Enderton]
Choice: ∀A ∃R (R well-orders A) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / k. Axiom of Existence
Set Existence: ∃x (x = x) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / n. Axiom of Comprehension
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
Constructibility: V = L (all sets are constructible) [Kunen]
6. Mathematics / A. Nature of Mathematics / 1. Mathematics
In mathematics, if a problem can be formulated, it will eventually be solved [Badiou]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / a. The Infinite
Mathematics shows that thinking is not confined to the finite [Badiou]
7. Existence / A. Nature of Existence / 3. Being / a. Nature of Being
Mathematics inscribes being as such [Badiou]
7. Existence / A. Nature of Existence / 6. Criterion for Existence
It is of the essence of being to appear [Badiou]
21. Aesthetics / B. Nature of Art / 8. The Arts / b. Literature
All great poetry is engaged in rivalry with mathematics [Badiou]