Combining Texts

All the ideas for 'Behaviorism', 'Logical Consequence' and 'Set Theory'

unexpand 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
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)
5. Theory of Logic / B. Logical Consequence / 1. Logical Consequence
Validity is explained as truth in all models, because that relies on the logical terms [McGee]
     Full Idea: A model of a language assigns values to non-logical terms. If a sentence is true in every model, its truth doesn't depend on those non-logical terms. Hence the validity of an argument comes from its logical form. Thus models explain logical validity.
     From: Vann McGee (Logical Consequence [2014], 4)
     A reaction: [compressed] Thus you get a rigorous account of logical validity by only allowing the rigorous input of model theory. This is the modern strategy of analytic philosophy. But is 'it's red so it's coloured' logically valid?
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
Natural language includes connectives like 'because' which are not truth-functional [McGee]
     Full Idea: Natural language includes connectives that are not truth-functional. In order for 'p because q' to be true, both p and q have to be true, but knowing the simpler sentences are true doesn't determine whether the larger sentence is true.
     From: Vann McGee (Logical Consequence [2014], 2)
5. Theory of Logic / G. Quantification / 5. Second-Order Quantification
Second-order variables need to range over more than collections of first-order objects [McGee]
     Full Idea: To get any advantage from moving to second-order logic, we need to assign to second-order variables a role different from merely ranging over collections made up of things the first-order variables range over.
     From: Vann McGee (Logical Consequence [2014], 7)
     A reaction: Thus it is exciting if they range over genuine properties, but not so exciting if you merely characterise those properties as sets of first-order objects. This idea leads into a discussion of plural quantification.
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
An ontologically secure semantics for predicate calculus relies on sets [McGee]
     Full Idea: We can get a less ontologically perilous presentation of the semantics of the predicate calculus by using sets instead of concepts.
     From: Vann McGee (Logical Consequence [2014], 4)
     A reaction: The perilous versions rely on Fregean concepts, and notably Russell's 'concept that does not fall under itself'. The sets, of course, have to be ontologically secure, and so will involve the iterative conception, rather than naive set theory.
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
Logically valid sentences are analytic truths which are just true because of their logical words [McGee]
     Full Idea: Logically valid sentences are a species of analytic sentence, being true not just in virtue of the meanings of their words, but true in virtue of the meanings of their logical words.
     From: Vann McGee (Logical Consequence [2014], 4)
     A reaction: A helpful link between logical truths and analytic truths, which had not struck me before.
5. Theory of Logic / K. Features of Logics / 3. Soundness
Soundness theorems are uninformative, because they rely on soundness in their proofs [McGee]
     Full Idea: Soundness theorems are seldom very informative, since typically we use informally, in proving the theorem, the very same rules whose soundness we are attempting to establish.
     From: Vann McGee (Logical Consequence [2014], 5)
     A reaction: [He cites Quine 1935]
6. Mathematics / B. Foundations for Mathematics / 3. Axioms for Geometry
The culmination of Euclidean geometry was axioms that made all models isomorphic [McGee]
     Full Idea: One of the culminating achievements of Euclidean geometry was categorical axiomatisations, that describe the geometric structure so completely that any two models of the axioms are isomorphic. The axioms are second-order.
     From: Vann McGee (Logical Consequence [2014], 7)
     A reaction: [He cites Veblen 1904 and Hilbert 1903] For most mathematicians, categorical axiomatisation is the best you can ever dream of (rather than a single true axiomatisation).
19. Language / F. Communication / 2. Assertion
A maxim claims that if we are allowed to assert a sentence, that means it must be true [McGee]
     Full Idea: If our linguistic conventions entitle us to assert a sentence, they thereby make it true, because of the maxim that 'truth is the norm of assertion'.
     From: Vann McGee (Logical Consequence [2014], 8)
     A reaction: You could only really deny that maxim if you had no belief at all in truth, but then you can assert anything you like (with full entitlement). Maybe you can assert anything you like as long as it doesn't upset anyone? Etc.
22. Metaethics / A. Ethics Foundations / 2. Source of Ethics / e. Human nature
I could take a healthy infant and train it up to be any type of specialist I choose [Watson,JB]
     Full Idea: Give me a dozen healthy infants, and my own specified world to bring them up in, and I'll guarantee to take any one at random and train him to become any type of specialist I might select - doctor, artist, beggar, thief - regardless of his ancestry.
     From: J.B. Watson (Behaviorism [1924], Ch.2), quoted by Steven Pinker - The Blank Slate
     A reaction: This was a famous pronouncement rejecting the concept of human nature as in any way fixed - a total assertion of nurture over nature. Modern research seems to be suggesting that Watson is (alas?) wrong.