Combining Philosophers

All the ideas for Lynch,MP/Glasgow,JM, Hans-Georg Gadamer and Kenneth Kunen

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


18 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)
7. Existence / A. Nature of Existence / 3. Being / a. Nature of Being
Only language is understandable Being [Gadamer]
     Full Idea: Being that can be understood is language.
     From: Hans-Georg Gadamer (Truth and Method [1960], p.450), quoted by Hans-Johann Glock - What is Analytic Philosophy? 5.2
     A reaction: [also 1967 p.19] Glock quotes this to show that continental philosophers are just as linguistic in their approach as the analytic school. I think the main aim of representational painting is to grasp non-linguistic Being.
7. Existence / C. Structure of Existence / 3. Levels of Reality
A necessary relation between fact-levels seems to be a further irreducible fact [Lynch/Glasgow]
     Full Idea: It seems unavoidable that the facts about logically necessary relations between levels of facts are themselves logically distinct further facts, irreducible to the microphysical facts.
     From: Lynch,MP/Glasgow,JM (The Impossibility of Superdupervenience [2003], C)
     A reaction: I'm beginning to think that rejecting every theory of reality that is proposed by carefully exposing some infinite regress hidden in it is a rather lazy way to do philosophy. Almost as bad as rejecting anything if it can't be defined.
7. Existence / C. Structure of Existence / 5. Supervenience / c. Significance of supervenience
If some facts 'logically supervene' on some others, they just redescribe them, adding nothing [Lynch/Glasgow]
     Full Idea: Logical supervenience, restricted to individuals, seems to imply strong reduction. It is said that where the B-facts logically supervene on the A-facts, the B-facts simply re-describe what the A-facts describe, and the B-facts come along 'for free'.
     From: Lynch,MP/Glasgow,JM (The Impossibility of Superdupervenience [2003], C)
     A reaction: This seems to be taking 'logically' to mean 'analytically'. Presumably an entailment is logically supervenient on its premisses, and may therefore be very revealing, even if some people think such things are analytic.
7. Existence / D. Theories of Reality / 6. Physicalism
Nonreductive materialism says upper 'levels' depend on lower, but don't 'reduce' [Lynch/Glasgow]
     Full Idea: The root intuition behind nonreductive materialism is that reality is composed of ontologically distinct layers or levels. …The upper levels depend on the physical without reducing to it.
     From: Lynch,MP/Glasgow,JM (The Impossibility of Superdupervenience [2003], B)
     A reaction: A nice clear statement of a view which I take to be false. This relationship is the sort of thing that drives people fishing for an account of it to use the word 'supervenience', which just says two things seem to hang out together. Fluffy materialism.
The hallmark of physicalism is that each causal power has a base causal power under it [Lynch/Glasgow]
     Full Idea: Jessica Wilson (1999) says what makes physicalist accounts different from emergentism etc. is that each individual causal power associated with a supervenient property is numerically identical with a causal power associated with its base property.
     From: Lynch,MP/Glasgow,JM (The Impossibility of Superdupervenience [2003], n 11)
     A reaction: Hence the key thought in so-called (serious, rather than self-evident) 'emergentism' is so-called 'downward causation', which I take to be an idle daydream.
8. Modes of Existence / A. Relations / 4. Formal Relations / b. Equivalence relation
An 'equivalence' relation is one which is reflexive, symmetric and transitive [Kunen]
     Full Idea: R is an equivalence relation on A iff R is reflexive, symmetric and transitive on A.
     From: Kenneth Kunen (The Foundations of Mathematics (2nd ed) [2012], I.7.1)
22. Metaethics / B. Value / 1. Nature of Value / b. Fact and value
Facts don't oppose values; they are integrated into each person's aspirations [Gadamer, by Zimmermann,J]
     Full Idea: Gadamer shows that we cannot oppose facts to values, but that all facts are integrated into meaningful wholes through a personal commitment to some kind of vision of how things ought to be.
     From: report of Hans-Georg Gadamer (Truth and Method [1960]) by Jens Zimmermann - Hermeneutics: a very short introduction
     A reaction: Straw man here. Whoever said that facts were 'opposed' to values? Certainly not David Hume. Any sensible empiricist of that type would try to develop values that integrated nicely with the facts. Gadamer seems to be denying facts.