Combining Texts

All the ideas for 'fragments/reports', 'Matter and Motion Cannot Think' 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)
17. Mind and Body / A. Mind-Body Dualism / 3. Panpsychism
That all matter thinks is absurd, and would make each part of our bodies a distinct self-consciousness [Bentley]
     Full Idea: [Belief in thinking matter] leads to monstrous absurdities. …Every stock and stone would be a percipient and rational creature. …every single Atom of our bodies would be a distinct Animal, endued with self-consciousness and personal sensation of its own.
     From: Richard Bentley (Matter and Motion Cannot Think [1692], p.14-15), quoted by Matthew Cobb - The Idea of the Brain 2
     A reaction: Sounds correct, though presumably panpsychists don't think the flickers of consciousness in my toenails and hair constitute full-blown persons. I can't imagine what awareness is being claimed for my toenails.
21. Aesthetics / C. Artistic Issues / 7. Art and Morality
Musical performance can reveal a range of virtues [Damon of Ath.]
     Full Idea: In singing and playing the lyre, a boy will be likely to reveal not only courage and moderation, but also justice.
     From: Damon (fragments/reports [c.460 BCE], B4), quoted by (who?) - where?