In mathematical set theory, a set of Gödel operations is a finite collection of operations on sets that can be used to construct the constructible sets from ordinals. Gödel (1940) introduced the original set of 8 Gödel operations 𝔉1,...,𝔉8 under the name fundamental operations. Other authors sometimes use a slightly different set of about 8 to 10 operations, usually denoted G1, G2,...
Definition
Gödel (1940) used the following eight operations as a set of Gödel operations (which he called fundamental operations):
The second expression in each line gives Gödel's definition in his original notation, where the dot means intersection, V is the universe, E is the membership relation, and so on.
Jech (2003) uses the following set of 10 Gödel operations.
Properties
Gödel's normal form theorem states that if φ(x1,...xn) is a formula in the language of set theory with all quantifiers bounded, then the function {(x1,...,xn) ∈ X1×...×Xn | φ(x1, ..., xn)) of X1, ..., Xn is given by a composition of some Gödel operations. This result is closely related to Jensen's rudimentary functions.[1]
References
- Gödel, Kurt (1940). The Consistency of the Continuum Hypothesis. Annals of Mathematics Studies. Vol. 3. Princeton, N. J.: Princeton University Press. ISBN 978-0-691-07927-1. MR 0002514.
- Jech, Thomas (2003), Set Theory: Millennium Edition, Springer Monographs in Mathematics, Berlin, New York: Springer-Verlag, ISBN 978-3-540-44085-7
Inline references
- ↑ K. Devlin, An introduction to the fine structure of the constructible hierarchy (1974, p.11). Accessed 2022-02-26.