In mathematical set theory, theaxiom of adjunction states that for any two setsx,y there is a setw = x ∪ {y} given by "adjoining" the sety to the setx. It is stated as
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 asgeneral set theory orfinitary set theory. The adjunction operation is also used as one of the operations ofprimitive recursive set functions.
Tarski andSzmielew showed thatRobinson arithmetic () can be interpreted in a weak set theory whose axioms areextensionality, the existence of the empty set, and the axiom of adjunction (Tarski 1953, p.34).In fact, in the language of set theory extended with a function symbol for adjunction, the axioms of empty set and adjunction alone (without extensionality) suffice to interpret.[1] (They are mutually interpretable.)
Addingepsilon-induction to empty set and adjunction yields a theory that is mutually interpretable withPeano arithmetic ().Anotheraxiom schema also yields a theory that is mutually interpretable with:[2]
where is not allowed to have free. This combines axioms of set theory: For trivially true it reduced to the adjunction axiom above, and for it gives theaxiom of separation with.
Thisset theory-related article is astub. You can help Wikipedia byexpanding it. |