Combining Texts

All the ideas for 'Subjectivist's Guide to Objective Chance', 'Methodological Reflections on Current Linguistic Theory' and 'Set Theory'

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


13 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)
19. Language / C. Assigning Meanings / 2. Semantics
Syntax and semantics are indeterminate, and modern 'semantics' is a bogus subject [Quine, by Lycan]
     Full Idea: Quine has argued tirelessly that syntax and 'semantics' are indeterminate, and linguistic semantics of the sort that is currently in favor is a pseudoscience and a pipe dream.
     From: report of Willard Quine (Methodological Reflections on Current Linguistic Theory [1972]) by William Lycan - The Trouble with Possible Worlds 02
     A reaction: I think the defence of such things is that they may not integrate into science very well (or even integrate at all), but semantics is intended to integrate into philosophy, and is motivated by philosophical concerns. Quine may be right!
26. Natural Theory / D. Laws of Nature / 4. Regularities / b. Best system theory
Lewis later proposed the axioms at the intersection of the best theories (which may be few) [Mumford on Lewis]
     Full Idea: Later Lewis said we must choose between the intersection of the axioms of the tied best systems. He chose for laws the axioms that are in all the tied systems (but then there may be few or no axioms in the intersection).
     From: comment on David Lewis (Subjectivist's Guide to Objective Chance [1980], p.124) by Stephen Mumford - Laws in Nature