Combining Texts

All the ideas for 'Necessary Existents', 'Sophistical Refutations' and 'Set Theory'

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


19 ideas

2. Reason / A. Nature of Reason / 1. On Reason
Didactic argument starts from the principles of the subject, not from the opinions of the learner [Aristotle]
     Full Idea: Didactic arguments are those which reason from the principles appropriate to each branch of learning and not from the opinions of the answerer (for he who is learning must take things on trust).
     From: Aristotle (Sophistical Refutations [c.331 BCE], 165b01)
2. Reason / A. Nature of Reason / 4. Aims of Reason
Reasoning is a way of making statements which makes them lead on to other statements [Aristotle]
     Full Idea: Reasoning is based on certain statements made in such a way as necessarily to cause the assertion of things other than those statements and as a result of those statements.
     From: Aristotle (Sophistical Refutations [c.331 BCE], 165a01)
2. Reason / C. Styles of Reason / 1. Dialectic
Dialectic aims to start from generally accepted opinions, and lead to a contradiction [Aristotle]
     Full Idea: Dialectical arguments are those which, starting from generally accepted opinions, reason to establish a contradiction.
     From: Aristotle (Sophistical Refutations [c.331 BCE], 165b03)
2. Reason / C. Styles of Reason / 3. Eristic
Competitive argument aims at refutation, fallacy, paradox, solecism or repetition [Aristotle]
     Full Idea: Those who compete and contend in argument aim at five objects: refutation, fallacy, paradox, solecism, and the reduction of one's opponent to a state of babbling, that is, making him say the same thing over and over again.
     From: Aristotle (Sophistical Refutations [c.331 BCE], 165b15)
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 / E. Structures of Logic / 2. Logical Connectives / d. and
'Are Coriscus and Callias at home?' sounds like a single question, but it isn't [Aristotle]
     Full Idea: If you ask 'Are Coriscus and Callias at home or not at home?', whether they are both at home or not there, the number of propositions is more than one. For if the answer is true, it does not follow that the question is a single one.
     From: Aristotle (Sophistical Refutations [c.331 BCE], 176a08)
     A reaction: [compressed] Aristotle is saying that some questions should not receive a 'yes' or 'no' answer, because they are equivocal. Arthur Prior cites this passage, on 'and'. Ordinary use of 'and' need not be the logical use of 'and'.
9. Objects / D. Essence of Objects / 10. Essence as Species
Generic terms like 'man' are not substances, but qualities, relations, modes or some such thing [Aristotle]
     Full Idea: 'Man', and every generic term, denotes not an individual substance but a quality or relation or mode or something of the kind.
     From: Aristotle (Sophistical Refutations [c.331 BCE], 179a01)
     A reaction: This is Aristotle's denial that species constitutes the essence of anything. I take 'man' to be a categorisation of individuals, and is ontologically nothing at all in its own right.
9. Objects / F. Identity among Objects / 8. Leibniz's Law
Only if two things are identical do they have the same attributes [Aristotle]
     Full Idea: It is only to things which are indistinguishable and one in essence [ousia] that all the same attributes are generally held to belong.
     From: Aristotle (Sophistical Refutations [c.331 BCE], 179a37)
     A reaction: This simply IS Leibniz's Law (to which I shall from now on quietly refer to as 'Aristotle's Law'). It seems that it just as plausible to translate 'ousia' as 'being' rather than 'essence'. 'Indistinguishable' and 'one in ousia' are not the same.
19. Language / D. Propositions / 3. Concrete Propositions
Propositions (such as 'that dog is barking') only exist if their items exist [Williamson]
     Full Idea: A proposition about an item exists only if that item exists... how could something be the proposition that that dog is barking in circumstances in which that dog does not exist?
     From: Timothy Williamson (Necessary Existents [2002], p.240), quoted by Trenton Merricks - Propositions
     A reaction: This is a view of propositions I can't make sense of. If I'm under an illusion that there is a dog barking nearby, when there isn't one, can I not say 'that dog is barking'? If I haven't expressed a proposition, what have I done?