| 13017 | Zermelo introduced Pairing in 1930, and it seems fairly obvious [Zermelo, by Maddy] |
| Full Idea: Zermelo's Pairing Axiom superseded (in 1930) his original 1908 Axiom of Elementary Sets. Like Union, its only justification seems to rest on 'limitations of size' and on the 'iterative conception'. | |
| From: report of Ernst Zermelo (Investigations in the Foundations of Set Theory I [1908]) by Penelope Maddy - Believing the Axioms I §1.3 | |
| A reaction: Maddy says of this and Union, that they seem fairly obvious, but that their justification is of prime importance, if we are to understand what the axioms should be. |
| 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. |
| 18851 | Pairing (with Extensionality) guarantees an infinity of sets, just from a single element [Rosen] |
| Full Idea: In conjunction with Extensionality, Pairing entails that given a single non-set, infinitely many sets exist. | |
| From: Gideon Rosen (The Limits of Contingency [2006], 04) |
| 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. |
| 10875 | Pairing: For any two sets there exists a set to which they both belong [Clegg] |
| Full Idea: Axiom of Pairing: For any two sets there exists a set to which they both belong. So you can make a set out of two other sets. | |
| From: Brian Clegg (Infinity: Quest to Think the Unthinkable [2003], Ch.15) |