Primitive recursive set function
In mathematics, primitive recursive set functions or primitive recursive ordinal functions are analogs of primitive recursive functions, defined for sets or ordinals rather than natural numbers.
≈ 3 min read
Names in other languages
- Englishprimitive recursive set function
- УкраїнськаОперація примітивної рекурсії
- eoprimitiva rikura arofunkcio
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, primitive recursive set functions or primitive recursive ordinal functions are analogs of primitive recursive functions, defined for sets or ordinals rather than natural numbers. They were introduced by Jensen & Karp (1971).
Definition
edit edit sourceA primitive recursive set function is a function from sets to sets that can be obtained from the following basic functions by repeatedly applying the following rules of substitution and recursion:
The basic functions are:
- Projection: Pn,m (x1, ..., xn) = xm for 0 ≤ m ≤ n
- Zero: F(x) = 0
- Adjoining an element to a set: F(x, y) = x ∪ {y}
- Testing membership: C(x, y, u, v) = x if u ∈ v, and C(x, y, u, v) = y otherwise.
The rules for generating new functions by substitution are
- F(x, y) = G(x, H(x), y)
- F(x, y) = G(H(x), y)
where x and y are finite sequences of variables.
The rule for generating new functions by recursion is
- F(z, x) = G(∪u ∈ z F(u, x), z, x)
A primitive recursive ordinal function is defined in the same way, except that the initial function F(x, y) = x ∪ {y} is replaced by F(x) = x ∪ {x} (the successor of x). The primitive recursive ordinal functions are the same as the primitive recursive set functions that map ordinals to ordinals.
Examples of primitive recursive set functions:
- TC, the function assigning to a set its transitive closure.[1]: 26
- Given hereditarily finite c, the constant function f(x)=c. [1]: 28
Extensions
edit edit sourceOne can also add more initial functions to obtain a larger class of functions. For example, the ordinal function α↦ωα is not primitive recursive, because the constant function with value ω (or any other infinite set) is not primitive recursive, so one might want to add this constant function to the initial functions.
The notion of a set function being primitive recursive in ω has the same definition as that of primitive recursion, except with ω as a parameter kept fixed, not altered by the primitive recursion schemata.
Examples of functions primitive recursive in ω:[1] pp.28--29
- ℙω(x)=⋃n<ωxn.
- The function assigning to α the αth level Lα of Godel's constructible hierarchy.
Primitive recursive closure
edit edit sourceLet f0:Ord2→Ord be the function f(α,β)=α+β, and for all i<ω, f~i(α)=fi(α,α) and fi+1(α,β)=(f~i)β(α). Let Lα denote the αth stage of Godel's constructible universe. Lα is closed under primitive recursive set functions iff α is closed under each fi for all i<ω. [1]: 31
References
edit edit source- Jensen, Ronald B.; Karp, Carol (1971), "Primitive recursive set functions", Axiomatic Set Theory, Proc. Sympos. Pure Math., vol. XIII, Part I, Providence, R.I.: Amer. Math. Soc., pp. 143–176, ISBN 9780821802458, MR 0281602
Inline
edit edit source- ^ a b c d R. B. Jensen, Manuscript on fine structure, inner model theory, and the core model below one Woodin cardinal (pp. 22--31). Accessed 2022-12-07
Text derived from https://en.wikipedia.org/w/index.php?oldid=1316116777 under CC BY-SA 4.0; modifications have been made.