display all the ideas for this combination of texts
13 ideas
8077 | Stoic propositional logic is like chemistry - how atoms make molecules, not the innards of atoms [Chrysippus, by Devlin] |
Full Idea: In Stoic logic propositions are treated the way atoms are treated in present-day chemistry, where the focus is on the way atoms fit together to form molecules, rather than on the internal structure of the atoms. | |
From: report of Chrysippus (fragments/reports [c.240 BCE]) by Keith Devlin - Goodbye Descartes Ch.2 | |
A reaction: A nice analogy to explain the nature of Propositional Logic, which was invented by the Stoics (N.B. after Aristotle had invented predicate logic). |
20791 | Chrysippus has five obvious 'indemonstrables' of reasoning [Chrysippus, by Diog. Laertius] |
Full Idea: Chrysippus has five indemonstrables that do not need demonstration:1) If 1st the 2nd, but 1st, so 2nd; 2) If 1st the 2nd, but not 2nd, so not 1st; 3) Not 1st and 2nd, the 1st, so not 2nd; 4) 1st or 2nd, the 1st, so not 2nd; 5) 1st or 2nd, not 2nd, so 1st. | |
From: report of Chrysippus (fragments/reports [c.240 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 07.80-81 | |
A reaction: [from his lost text 'Dialectics'; squashed to fit into one quote] 1) is Modus Ponens, 2) is Modus Tollens. 4) and 5) are Disjunctive Syllogisms. 3) seems a bit complex to be an indemonstrable. |
10098 | The 'power set' of A is all the subsets of A [George/Velleman] |
Full Idea: The 'power set' of A is all the subsets of A. P(A) = {B : B ⊆ A}. | |
From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) |
10099 | The 'ordered pair' <a, b>, for two sets a and b, is the set {{a, b},{a}} [George/Velleman] |
Full Idea: The 'ordered pair' <a, b>, for two sets a and b, is the set {{a, b},{a}}. The existence of this set is guaranteed by three applications of the Axiom of Pairing. | |
From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
A reaction: See Idea 10100 for the Axiom of Pairing. |
10101 | Cartesian Product A x B: the set of all ordered pairs in which a∈A and b∈B [George/Velleman] |
Full Idea: The 'Cartesian Product' of any two sets A and B is the set of all ordered pairs <a, b> in which a ∈ A and b ∈ B, and it is denoted as A x B. | |
From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) |
10103 | Grouping by property is common in mathematics, usually using equivalence [George/Velleman] |
Full Idea: The idea of grouping together objects that share some property is a common one in mathematics, ...and the technique most often involves the use of equivalence relations. | |
From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) |
10104 | 'Equivalence' is a reflexive, symmetric and transitive relation; 'same first letter' partitions English words [George/Velleman] |
Full Idea: A relation is an equivalence relation if it is reflexive, symmetric and transitive. The 'same first letter' is an equivalence relation on the set of English words. Any relation that puts a partition into clusters will be equivalence - and vice versa. | |
From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
A reaction: This is a key concept in the Fregean strategy for defining numbers. |
10096 | Even the elements of sets in ZFC are sets, resting on the pure empty set [George/Velleman] |
Full Idea: ZFC is a theory concerned only with sets. Even the elements of all of the sets studied in ZFC are also sets (whose elements are also sets, and so on). This rests on one clearly pure set, the empty set Φ. ..Mathematics only needs pure sets. | |
From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
A reaction: This makes ZFC a much more metaphysically comfortable way to think about sets, because it can be viewed entirely formally. It is rather hard to disentangle a chair from the singleton set of that chair. |
10097 | Axiom of Extensionality: for all sets x and y, if x and y have the same elements then x = y [George/Velleman] |
Full Idea: The Axiom of Extensionality says that for all sets x and y, if x and y have the same elements then x = y. | |
From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
A reaction: This seems fine in pure set theory, but hits the problem of renates and cordates in the real world. The elements coincide, but the axiom can't tell you why they coincide. |
10100 | Axiom of Pairing: for all sets x and y, there is a set z containing just x and y [George/Velleman] |
Full Idea: The Axiom of Pairing says that for all sets x and y, there is a set z containing x and y, and nothing else. In symbols: ∀x∀y∃z∀w(w ∈ z ↔ (w = x ∨ w = y)). | |
From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) | |
A reaction: See Idea 10099 for an application of this axiom. |
17900 | The Axiom of Reducibility made impredicative definitions possible [George/Velleman] |
Full Idea: The Axiom of Reducibility ...had the effect of making impredicative definitions possible. | |
From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.3) |
10109 | ZFC can prove that there is no set corresponding to the concept 'set' [George/Velleman] |
Full Idea: Sets, unlike extensions, fail to correspond to all concepts. We can prove in ZFC that there is no set corresponding to the concept 'set' - that is, there is no set of all sets. | |
From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.4) | |
A reaction: This is rather an important point for Frege. However, all concepts have extensions, but they may be proper classes, rather than precisely defined sets. |
10108 | As a reduction of arithmetic, set theory is not fully general, and so not logical [George/Velleman] |
Full Idea: The problem with reducing arithmetic to ZFC is not that this theory is inconsistent (as far as we know it is not), but rather that is not completely general, and for this reason not logical. For example, it asserts the existence of sets. | |
From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.4) | |
A reaction: Note that ZFC has not been proved consistent. |