Axiom of adjunction
In mathematical set theory, the axiom of adjunction states that for any two sets x, y there is a set w = x ∪ {y} given by "adjoining" the set y to the set x. It is stated as
- [math]\displaystyle{ \forall x. \forall y. \exists w. \forall z. \big( z \in w \leftrightarrow (z \in x \lor z=y) \big). }[/math]
Bernays (1937, page 68, axiom II (2)) introduced the axiom of adjunction as one of the axioms for a system of set theory that he introduced in about 1929. It is a weak axiom, used in some weak systems of set theory such as general set theory or finitary set theory. The adjunction operation is also used as one of the operations of primitive recursive set functions.
Interpretability of arithmetic
Tarski and Szmielew showed that Robinson arithmetic ([math]\displaystyle{ {\mathsf{Q}} }[/math]) can be interpreted in a weak set theory whose axioms are extensionality, the existence of the empty set, and the axiom of adjunction (Tarski 1953). In fact, empty set and adjunction alone (without extensionality) suffice to interpret [math]\displaystyle{ {\mathsf{Q}} }[/math].[1] (They are mutually interpretable.)
Adding epsilon-induction to empty set and adjunction yields a theory that is mutually interpretable with Peano arithmetic ([math]\displaystyle{ {\mathsf{PA}} }[/math]). Another axiom schema also yields a theory that is mutually interpretable with [math]\displaystyle{ {\mathsf{PA}} }[/math]:[2]
- [math]\displaystyle{ \forall x. \forall y. \exists w. \forall z. \Big(z \in w \leftrightarrow \big((z \in x \lor z = y) \land \phi\big)\Big) }[/math],
where [math]\displaystyle{ \phi }[/math] is not allowed to have [math]\displaystyle{ w }[/math] free. This combines axioms of set theory: For [math]\displaystyle{ \phi }[/math] trivially true it reduced to the adjunction axiom above, and for [math]\displaystyle{ (z\neq y)\land P }[/math] it gives the axiom of separation with [math]\displaystyle{ P }[/math].
References
- ↑ Mancini, Antonella; Montagna, Franco (Spring 1994). "A minimal predicative set theory". Notre Dame Journal of Formal Logic 35 (2): 186–203. doi:10.1305/ndjfl/1094061860. https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-35/issue-2/A-minimal-predicative-set-theory/10.1305/ndjfl/1094061860.full. Retrieved 23 November 2021.
- ↑ Friedman, Harvey M. (June 2, 2002). "Issues in the foundations of mathematics". Ohio State University. https://cpb-us-w2.wpmucdn.com/u.osu.edu/dist/1/1952/files/2014/01/GodelLect060202-n2gdjc.pdf.
- Bernays, Paul (1937), "A System of Axiomatic Set Theory--Part I", The Journal of Symbolic Logic (Association for Symbolic Logic) 2 (1): 65–77, doi:10.2307/2268862
- Kirby, Laurence (2009), "Finitary Set Theory", Notre Dame J. Formal Logic 50 (3): 227–244, doi:10.1215/00294527-2009-009
- Tarski, Alfred (1953), Undecidable theories, Studies in Logic and the Foundations of Mathematics, Amsterdam: North-Holland Publishing Company
- Tarski, A., and Givant, Steven (1987) A Formalization of Set Theory without Variables. Providence RI: AMS Colloquium Publications, v. 41.
 |  |
