Combining Texts

All the ideas for 'fragments/reports', 'What are Sets and What are they For?' and 'Set Theory'

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


23 ideas

4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
The empty set is usually derived from Separation, but it also seems to need Infinity [Oliver/Smiley]
     Full Idea: The empty set is usually derived via Zermelo's axiom of separation. But the axiom of separation is conditional: it requires the existence of a set in order to generate others as subsets of it. The original set has to come from the axiom of infinity.
     From: Oliver,A/Smiley,T (What are Sets and What are they For? [2006], 1.2)
     A reaction: They charge that this leads to circularity, as Infinity depends on the empty set.
The empty set is something, not nothing! [Oliver/Smiley]
     Full Idea: Some authors need to be told loud and clear: if there is an empty set, it is something, not nothing.
     From: Oliver,A/Smiley,T (What are Sets and What are they For? [2006], 1.2)
     A reaction: I'm inclined to think of a null set as a pair of brackets, so maybe that puts it into a metalanguage.
We don't need the empty set to express non-existence, as there are other ways to do that [Oliver/Smiley]
     Full Idea: The empty set is said to be useful to express non-existence, but saying 'there are no Us', or ¬∃xUx are no less concise, and certainly less roundabout.
     From: Oliver,A/Smiley,T (What are Sets and What are they For? [2006], 1.2)
Maybe we can treat the empty set symbol as just meaning an empty term [Oliver/Smiley]
     Full Idea: Suppose we introduce Ω not as a term standing for a supposed empty set, but as a paradigm of an empty term, not standing for anything.
     From: Oliver,A/Smiley,T (What are Sets and What are they For? [2006], 1.2)
     A reaction: This proposal, which they go on to explore, seems to mean that Ω (i.e. the traditional empty set symbol) is no longer part of set theory but is part of semantics.
4. Formal Logic / F. Set Theory ST / 3. Types of Set / c. Unit (Singleton) Sets
The unit set may be needed to express intersections that leave a single member [Oliver/Smiley]
     Full Idea: Thomason says with no unit sets we couldn't call {1,2}∩{2,3} a set - but so what? Why shouldn't the intersection be the number 2? However, we then have to distinguish three different cases of intersection (common subset or member, or disjoint).
     From: Oliver,A/Smiley,T (What are Sets and What are they For? [2006], 2.2)
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 / G. Quantification / 6. Plural Quantification
If you only refer to objects one at a time, you need sets in order to refer to a plurality [Oliver/Smiley]
     Full Idea: A 'singularist', who refers to objects one at a time, must resort to the language of sets in order to replace plural reference to members ('Henry VIII's wives') by singular reference to a set ('the set of Henry VIII's wives').
     From: Oliver,A/Smiley,T (What are Sets and What are they For? [2006], Intro)
     A reaction: A simple and illuminating point about the motivation for plural reference. Null sets and singletons give me the creeps, so I would personally prefer to avoid set theory when dealing with ontology.
We can use plural language to refer to the set theory domain, to avoid calling it a 'set' [Oliver/Smiley]
     Full Idea: Plurals earn their keep in set theory, to answer Skolem's remark that 'in order to treat of 'sets', we must begin with 'domains' that are constituted in a certain way'. We can speak in the plural of 'the objects', not a 'domain' of objects.
     From: Oliver,A/Smiley,T (What are Sets and What are they For? [2006], Intro)
     A reaction: [Skolem 1922:291 in van Heijenoort] Zermelo has said that the domain cannot be a set, because every set belongs to it.
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
Logical truths are true no matter what exists - but predicate calculus insists that something exists [Oliver/Smiley]
     Full Idea: Logical truths should be true no matter what exists, so true even if nothing exists. The classical predicate calculus, however, makes it logically true that something exists.
     From: Oliver,A/Smiley,T (What are Sets and What are they For? [2006], 5.1)
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / g. Applying mathematics
If mathematics purely concerned mathematical objects, there would be no applied mathematics [Oliver/Smiley]
     Full Idea: If mathematics was purely concerned with mathematical objects, there would be no room for applied mathematics.
     From: Oliver,A/Smiley,T (What are Sets and What are they For? [2006], 5.1)
     A reaction: Love it! Of course, they are using 'objects' in the rather Fregean sense of genuine abstract entities. I don't see why fictionalism shouldn't allow maths to be wholly 'pure', although we have invented fictions which actually have application.
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
Sets might either represent the numbers, or be the numbers, or replace the numbers [Oliver/Smiley]
     Full Idea: Identifying numbers with sets may mean one of three quite different things: 1) the sets represent the numbers, or ii) they are the numbers, or iii) they replace the numbers.
     From: Oliver,A/Smiley,T (What are Sets and What are they For? [2006], 5.2)
     A reaction: Option one sounds the most plausible to me. I will take numbers to be patterns embedded in nature, and sets are one way of presenting them in shorthand form, in order to bring out what is repeated.
25. Social Practice / E. Policies / 5. Education / b. Education principles
Learned men gain more in one day than others do in a lifetime [Posidonius]
     Full Idea: In a single day there lies open to men of learning more than there ever does to the unenlightened in the longest of lifetimes.
     From: Posidonius (fragments/reports [c.95 BCE]), quoted by Seneca the Younger - Letters from a Stoic 078
     A reaction: These remarks endorsing the infinite superiority of the educated to the uneducated seem to have been popular in late antiquity. It tends to be the religions which discourage great learning, especially in their emphasis on a single book.
27. Natural Reality / D. Time / 1. Nature of Time / d. Time as measure
Time is an interval of motion, or the measure of speed [Posidonius, by Stobaeus]
     Full Idea: Posidonius defined time thus: it is an interval of motion, or the measure of speed and slowness.
     From: report of Posidonius (fragments/reports [c.95 BCE]) by John Stobaeus - Anthology 1.08.42
     A reaction: Hm. Can we define motion or speed without alluding to time? Looks like we have to define them as a conjoined pair, which means we cannot fully understand either of them.