Combining Texts

All the ideas for '', 'Set Theory' and 'Abstraction Reconsidered'

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

20 ideas

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 / A. Overview of Logic / 1. Overview of Logic
11211 If a sound conclusion comes from two errors that cancel out, the path of the argument must matter [Rumfitt]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
11210 Standardly 'and' and 'but' are held to have the same sense by having the same truth table [Rumfitt]
11212 The sense of a connective comes from primitively obvious rules of inference [Rumfitt]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / c. Against mathematical empiricism
10735 Abstraction from objects won't reveal an operation's being performed 'so many times' [Geach]
15. Nature of Minds / C. Capacities of Minds / 5. Generalisation by mind
10732 If concepts are just recognitional, then general judgements would be impossible [Geach]
18. Thought / D. Concepts / 3. Ontology of Concepts / b. Concepts as abilities
10731 For abstractionists, concepts are capacities to recognise recurrent features of the world [Geach]
18. Thought / E. Abstraction / 8. Abstractionism Critique
10733 The abstractionist cannot explain 'some' and 'not' [Geach]
10734 Only a judgement can distinguish 'striking' from 'being struck' [Geach]
19. Language / F. Communication / 3. Denial
11214 We learn 'not' along with affirmation, by learning to either affirm or deny a sentence [Rumfitt]