Kripke–Platek set theory
The Kripke–Platek set theory (KP), pronounced /ˈkrɪpki ˈplɑːtɛk/, is an axiomatic set theory developed by Saul Kripke and Richard Platek. The theory can be thought of as roughly the predicative part of ZFC and is considerably weaker than it.
Axioms
In its formulation, a Δ0 formula is one all of whose quantifiers are bounded. This means any quantification is the form [math]\displaystyle{ \forall u \in v }[/math] or [math]\displaystyle{ \exist u \in v. }[/math] (See the Lévy hierarchy.)
- Axiom of extensionality: Two sets are the same if and only if they have the same elements.
- Axiom of induction: φ(a) being a formula, if for all sets x the assumption that φ(y) holds for all elements y of x entails that φ(x) holds, then φ(x) holds for all sets x.
- Axiom of empty set: There exists a set with no members, called the empty set and denoted {}.
- Axiom of pairing: If x, y are sets, then so is {x, y}, a set containing x and y as its only elements.
- Axiom of union: For any set x, there is a set y such that the elements of y are precisely the elements of the elements of x.
- Axiom of Δ0-separation: Given any set and any Δ0 formula φ(x), there is a subset of the original set containing precisely those elements x for which φ(x) holds. (This is an axiom schema.)
- Axiom of Δ0-collection: Given any Δ0 formula φ(x, y), if for every set x there exists a set y such that φ(x, y) holds, then for all sets X there exists a set Y such that for every x in X there is a y in Y such that φ(x, y) holds.
Some but not all authors include an
KP with infinity is denoted by KPω. These axioms lead to close connections between KP, generalized recursion theory, and the theory of admissible ordinals. KP can be studied as a constructive set theory by dropping the law of excluded middle, without changing any axioms.
Empty set
If any set [math]\displaystyle{ c }[/math] is postulated to exist, such as in the axiom of infinity, then the axiom of empty set is redundant because it is equal to the subset [math]\displaystyle{ \{x\in c\mid x\neq x\} }[/math]. Furthermore, the existence of a member in the universe of discourse, i.e., ∃x(x=x), is implied in certain formulations[1] of first-order logic, in which case the axiom of empty set follows from the axiom of Δ0-separation, and is thus redundant.
Comparison with Zermelo-Fraenkel set theory
As noted, the above are weaker than ZFC as they exclude the power set axiom, choice, and sometimes infinity. Also the axioms of separation and collection here are weaker than the corresponding axioms in ZFC because the formulas φ used in these are limited to bounded quantifiers only.
The axiom of induction in the context of KP is stronger than the usual axiom of regularity, which amounts to applying induction to the complement of a set (the class of all sets not in the given set).
Related definitions
- A set [math]\displaystyle{ A\, }[/math] is called admissible if it is transitive and [math]\displaystyle{ \langle A,\in \rangle }[/math] is a model of Kripke–Platek set theory.
- An ordinal number [math]\displaystyle{ \alpha }[/math] is called an admissible ordinal if [math]\displaystyle{ L_\alpha }[/math] is an admissible set.
- [math]\displaystyle{ L_\alpha }[/math] is called an amenable set if it is a standard model of KP set theory without the axiom of Δ0-collection.
Theorems
Admissible sets
The ordinal α is an admissible ordinal if and only if α is a limit ordinal and there does not exist a γ < α for which there is a Σ1(Lα) mapping from γ onto α. If M is a standard model of KP, then the set of ordinals in M is an admissible ordinal.
Cartesian products exist
Theorem: If A and B are sets, then there is a set A×B which consists of all ordered pairs (a, b) of elements a of A and b of B.
Proof:
The singleton set with member a, written {a}, is the same as the unordered pair {a, a}, by the axiom of extensionality.
The singleton, the set {a, b}, and then also the ordered pair
- [math]\displaystyle{ (a,b) := \{ \{a\}, \{a,b\} \} }[/math]
all exist by pairing. A possible Δ0-formula [math]\displaystyle{ \psi (a, b, p) }[/math] expressing that p stands for the pair (a, b) is given by the lengthy
- [math]\displaystyle{ \exist r \in p\, \big(a \in r\, \land\, \forall x \in r\, (x = a) \big) }[/math]
- [math]\displaystyle{ \land\, \exist s \in p\, \big(a \in s \,\land\, b \in s\, \land\, \forall x \in s\, (x = a \,\lor\, x = b) \big) }[/math]
- [math]\displaystyle{ \land\, \forall t \in p\, \Big(\big(a \in t\, \land\, \forall x \in t\, (x = a)\big)\, \lor\, \big(a \in t \land b \in t \land \forall x \in t\, (x = a \,\lor\, x = b)\big)\Big). }[/math]
- [math]\displaystyle{ \land\, \exist s \in p\, \big(a \in s \,\land\, b \in s\, \land\, \forall x \in s\, (x = a \,\lor\, x = b) \big) }[/math]
What follows are two steps of collection of sets, followed by a restriction through separation. All results are also expressed using set builder notation.
Firstly, given [math]\displaystyle{ b }[/math] and collecting with respect to [math]\displaystyle{ A }[/math], some superset of [math]\displaystyle{ A\times\{b\} = \{(a,b)\mid a\in A\} }[/math] exists by collection.
The Δ0-formula
- [math]\displaystyle{ \exist a \in A \,\psi (a, b, p) }[/math]
grants that just [math]\displaystyle{ A\times\{b\} }[/math] itself exists by separation.
If [math]\displaystyle{ P }[/math] ought to stand for this collection of pairs [math]\displaystyle{ A\times\{b\} }[/math], then a Δ0-formula characterizing it is
- [math]\displaystyle{ \forall a \in A\, \exist p \in P\, \psi (a, b, p)\, \land\, \forall p \in P\, \exist a \in A\, \psi (a, b, p) \,. }[/math]
Given [math]\displaystyle{ A }[/math] and collecting with respect to [math]\displaystyle{ B }[/math], some superset of [math]\displaystyle{ \{A\times \{b\} \mid b\in B\} }[/math] exists by collection.
Putting [math]\displaystyle{ \exist b \in B }[/math] in front of that last formula and one finds the set [math]\displaystyle{ \{A\times \{b\} \mid b\in B\} }[/math] itself exists by separation.
Finally, the desired
- [math]\displaystyle{ A\times B := \bigcup \{A\times \{b\} \mid b\in B\} }[/math]
exists by union. Q.E.D.
Metalogic
The consistency strength of KPω is given by the Bachmann–Howard ordinal. KP fails to prove some common theorems in set theory, such as the Mostowski collapse lemma. [2]
See also
- Constructible universe
- Admissible ordinal
- Hereditarily countable set
- Kripke–Platek set theory with urelements
References
- ↑ Poizat, Bruno (2000). A course in model theory: an introduction to contemporary mathematical logic. Springer. ISBN 0-387-98655-3. https://archive.org/details/courseinmodelthe0000poiz., note at end of §2.3 on page 27: "Those who do not allow relations on an empty universe consider (∃x)x=x and its consequences as theses; we, however, do not share this abhorrence, with so little logical ground, of a vacuum."
- ↑ P. Odifreddi, Classical Recursion Theory (1989) p.421. North-Holland, 0-444-87295-7
Bibliography
- Devlin, Keith J. (1984). Constructibility. Berlin: Springer-Verlag. ISBN 0-387-13258-9.
- Gostanian, Richard (1980). "Constructible Models of Subsystems of ZF". Journal of Symbolic Logic (Association for Symbolic Logic) 45 (2): 237. doi:10.2307/2273185
- Kripke, S. (1964), "Transfinite recursion on admissible ordinals", Journal of Symbolic Logic 29: 161–162, doi:10.2307/2271646
- Platek, Richard Alan (1966), Foundations of recursion theory, Thesis (Ph.D.)–Stanford University
 |  |
