Combining Texts

All the ideas for 'works', 'Isolation and Non-arbitrary Division' and 'Set Theory'

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


17 ideas

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]
     Full Idea: Axiom of Extensionality: ∀x ∀y (∀z (z ∈ x ↔ z ∈ y) → x = y). That is, a set is determined by its members. If every z in one set is also in the other set, then the two sets are the same.
     From: Kenneth Kunen (Set Theory [1980], §1.5)
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]
     Full Idea: Axiom of Pairing: ∀x ∀y ∃z (x ∈ z ∧ y ∈ z). Any pair of entities must form a set.
     From: Kenneth Kunen (Set Theory [1980], §1.6)
     A reaction: Repeated applications of this can build the hierarchy of sets.
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]
     Full Idea: Axiom of Union: ∀F ∃A ∀Y ∀x (x ∈ Y ∧ Y ∈ F → x ∈ A). That is, the union of a set (all the members of the members of the set) must also be a set.
     From: Kenneth Kunen (Set Theory [1980], §1.6)
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]
     Full Idea: Axiom of Infinity: ∃x (0 ∈ x ∧ ∀y ∈ x (S(y) ∈ x). That is, there is a set which contains zero and all of its successors, hence all the natural numbers. The principal of induction rests on this axiom.
     From: Kenneth Kunen (Set Theory [1980], §1.7)
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]
     Full Idea: Power Set Axiom: ∀x ∃y ∀z(z ⊂ x → z ∈ y). That is, there is a set y which contains all of the subsets of a given set. Hence we define P(x) = {z : z ⊂ x}.
     From: Kenneth Kunen (Set Theory [1980], §1.10)
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / h. Axiom of Replacement VII
Replacement: ∀x∈A ∃!y φ(x,y) → ∃Y ∀X∈A ∃y∈Y φ(x,y) [Kunen]
     Full Idea: Axiom of Replacement Scheme: ∀x ∈ A ∃!y φ(x,y) → ∃Y ∀X ∈ A ∃y ∈ Y φ(x,y). That is, any function from a set A will produce another set Y.
     From: Kenneth Kunen (Set Theory [1980], §1.6)
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]
     Full Idea: Axiom of Foundation: ∀x (∃y(y ∈ x) → ∃y(y ∈ x ∧ ¬∃z(z ∈ x ∧ z ∈ y))). Aka the 'Axiom of Regularity'. Combined with Choice, it means there are no downward infinite chains.
     From: Kenneth Kunen (Set Theory [1980], §3.4)
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
Choice: ∀A ∃R (R well-orders A) [Kunen]
     Full Idea: Axiom of Choice: ∀A ∃R (R well-orders A). That is, for every set, there must exist another set which imposes a well-ordering on it. There are many equivalent versions. It is not needed in elementary parts of set theory.
     From: Kenneth Kunen (Set Theory [1980], §1.6)
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / k. Axiom of Existence
Set Existence: ∃x (x = x) [Kunen]
     Full Idea: Axiom of Set Existence: ∃x (x = x). This says our universe is non-void. Under most developments of formal logic, this is derivable from the logical axioms and thus redundant, but we do so for emphasis.
     From: Kenneth Kunen (Set Theory [1980], §1.5)
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / n. Axiom of Comprehension
Comprehension: ∃y ∀x (x ∈ y ↔ x ∈ z ∧ φ) [Kunen]
     Full Idea: Comprehension Scheme: for each formula φ without y free, the universal closure of this is an axiom: ∃y ∀x (x ∈ y ↔ x ∈ z ∧ φ). That is, there must be a set y if it can be defined by the formula φ.
     From: Kenneth Kunen (Set Theory [1980], §1.5)
     A reaction: Unrestricted comprehension leads to Russell's paradox, so restricting it in some way (e.g. by the Axiom of Specification) is essential.
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]
     Full Idea: Axiom of Constructability: this is the statement V = L (i.e. ∀x ∃α(x ∈ L(α)). That is, the universe of well-founded von Neumann sets is the same as the universe of sets which are actually constructible. A possible axiom.
     From: Kenneth Kunen (Set Theory [1980], §6.3)
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / a. Units
Objects do not naturally form countable units [Koslicki]
     Full Idea: Objects do not by themselves naturally fall into countable units.
     From: Kathrin Koslicki (Isolation and Non-arbitrary Division [1997], 2.2)
     A reaction: Hm. This seems to be modern Fregean orthodoxy. Why did the institution of counting ever get started if the things in the world didn't demand counting? Even birds are aware of the number of eggs in their nest (because they miss a stolen one).
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / c. Counting procedure
We can still count squares, even if they overlap [Koslicki]
     Full Idea: The fact that there is overlap does not seem to inhibit our ability to count squares.
     From: Kathrin Koslicki (Isolation and Non-arbitrary Division [1997], 2.2)
     A reaction: She has a diagram of three squares overlapping slightly at their corners. Contrary to Frege, these seems to depend on a subliminal concept of the square that doesn't depend on language.
There is no deep reason why we count carrots but not asparagus [Koslicki]
     Full Idea: Why do speakers of English count carrots but not asparagus? There is no 'deep' reason.
     From: Kathrin Koslicki (Isolation and Non-arbitrary Division [1997])
     A reaction: Koslick is offering this to defend the Fregean conceptual view of counting, but what seems to matter is what is countable, and not whether we happen to count it. You don't need to know what carrots are to count them. Cooks count asparagus.
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / d. Counting via concepts
We struggle to count branches and waves because our concepts lack clear boundaries [Koslicki]
     Full Idea: The reason we have a hard time counting the branches and the waves is because our concepts 'branches on the tree' and 'waves on the ocean' do not determine sufficiently precise boundaries: the concepts do not draw a clear invisible line around each thing.
     From: Kathrin Koslicki (Isolation and Non-arbitrary Division [1997], 2.2)
     A reaction: This is the 'isolation' referred to in Frege.
6. Mathematics / B. Foundations for Mathematics / 3. Axioms for Geometry
Archimedes defined a straight line as the shortest distance between two points [Archimedes, by Leibniz]
     Full Idea: Archimedes gave a sort of definition of 'straight line' when he said it is the shortest line between two points.
     From: report of Archimedes (fragments/reports [c.240 BCE]) by Gottfried Leibniz - New Essays on Human Understanding 4.13
     A reaction: Commentators observe that this reduces the purity of the original Euclidean axioms, because it involves distance and measurement, which are absent from the purest geometry.
7. Existence / C. Structure of Existence / 8. Stuff / a. Pure stuff
We talk of snow as what stays the same, when it is a heap or drift or expanse [Koslicki]
     Full Idea: Talk of snow concerns what stays the same when some snow changes, as it might be, from a heap of snow to a drift, to an expanse.
     From: Kathrin Koslicki (Isolation and Non-arbitrary Division [1997], 2.2)
     A reaction: The whiteness also stays the same, but isn't stuff.