17 ideas
| 8083 | Boole applied normal algebra to logic, aiming at an algebra of thought [Boole, by Devlin] |
| Full Idea: Boole proposed to use the entire apparatus of a school algebra class, with operations such as addition and multiplication, methods to solve equations, and the like, to produce an algebra of thought. | |
| From: report of George Boole (The Laws of Thought [1854]) by Keith Devlin - Goodbye Descartes Ch.3 | |
| A reaction: The Stoics didn’t use any algebraic notation for their study of propositions, so Boole's idea launched full blown propositional logic, and the rest of modern logic followed. Nice one. |
| 7727 | Boole's notation can represent syllogisms and propositional arguments, but not both at once [Boole, by Weiner] |
| Full Idea: Boole introduced a new symbolic notation in which it was possible to represent both syllogisms and propositional arguments, ...but not both at once. | |
| From: report of George Boole (The Laws of Thought [1854], Ch.3) by Joan Weiner - Frege | |
| A reaction: How important is the development of symbolic notations for the advancement of civilisations? Is there a perfect notation, as used in logical heaven? |
| 13030 | 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) |
| 13032 | 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. |
| 13033 | 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) |
| 13037 | 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) |
| 13038 | 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) |
| 13034 | 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) |
| 13039 | 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) |
| 13036 | 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) |
| 13029 | 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) |
| 13031 | 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. |
| 13040 | 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) |
| 8686 | Boole made logic more mathematical, with algebra, quantifiers and probability [Boole, by Friend] |
| Full Idea: Boole (followed by Frege) began to turn logic from a branch of philosophy into a branch of mathematics. He brought an algebraic approach to propositions, and introduced the notion of a quantifier and a type of probabilistic reasoning. | |
| From: report of George Boole (The Laws of Thought [1854], 3.2) by Michèle Friend - Introducing the Philosophy of Mathematics | |
| A reaction: The result was that logic not only became more mathematical, but also more specialised. We now have two types of philosopher, those steeped in mathematical logic and the rest. They don't always sing from the same songsheet. |
| 22277 | Boole's method was axiomatic, achieving economy, plus multiple interpretations [Boole, by Potter] |
| Full Idea: Boole's work was an early example of the axiomatic method, whereby intellectual economy is achieved by studying a set of axioms in which the primitive terms have multiple interpretations. | |
| From: report of George Boole (The Laws of Thought [1854]) by Michael Potter - The Rise of Analytic Philosophy 1879-1930 02 'Boole' | |
| A reaction: Unclear about this. I suppose the axioms are just syntactic, and a range of semantic interpretations can be applied. Are De Morgan's Laws interpretations, or implications of the syntactic axioms? The latter, I think. |
| 18465 | 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) |
| 6005 | Animals are dangerous and nourishing, and can't form contracts of justice [Hermarchus, by Sedley] |
| Full Idea: Hermarchus said that animal killing is justified by considerations of human safety and nourishment and by animals' inability to form contractual relations of justice with us. | |
| From: report of Hermarchus (fragments/reports [c.270 BCE]) by David A. Sedley - Hermarchus | |
| A reaction: Could the last argument be used to justify torturing animals? Or could we eat a human who was too brain-damaged to form contracts? |