Grzegorczyk hierarchy

The Grzegorczyk hierarchy (/ɡrɛˈɡɔːrtʃək/, Polish pronunciation: [ɡʐɛˈɡɔrt͡ʂɨk]), named after the Polish logician Andrzej Grzegorczyk, is a hierarchy of functions used in computability theory (Wagner and Wechsung 1986:43). Every function in the Grzegorczyk hierarchy is a primitive recursive function, and every primitive recursive function appears in the hierarchy at some level. The hierarchy deals with the rate at which the values of the functions grow; intuitively, functions in lower level of the hierarchy grow slower than functions in the higher levels.

Definition

First we introduce an infinite set of functions, denoted E_i for some natural number i. We define ${\displaystyle E_{0}(x,y)=x+y}$ and ${\displaystyle E_{1}(x)=x^{2}+2}$. I.e., E₀ is the addition function, and E₁ is a unary function which squares its argument and adds two. Then, for each n greater than 1, we define ${\displaystyle E_{n}(x)=E_{n-1}^{x}(2)}$, i.e. the x-th iterate of ${\displaystyle E_{n-1}}$ evaluated at 2.

From these functions we define the Grzegorczyk hierarchy. ${\displaystyle {\mathcal {E}}^{n}}$, the n-th set in the hierarchy, contains the following functions:

1. E_k for k < n
2. the zero function (Z(x) = 0);
3. the successor function (S(x) = x + 1);
4. the projection functions (${\displaystyle p_{i}^{m}(t_{1},t_{2},\dots ,t_{m})=t_{i}}$);
5. the (generalized) compositions of functions in the set (if h, g₁, g₂, ... and g_m are in ${\displaystyle {\mathcal {E}}^{n}}$, then ${\displaystyle f({\bar {u}})=h(g_{1}({\bar {u}}),g_{2}({\bar {u}}),\dots ,g_{m}({\bar {u}}))}$ is as well)[note 1]; and
6. the results of limited (primitive) recursion applied to functions in the set, (if g, h and j are in ${\displaystyle {\mathcal {E}}^{n}}$ and ${\displaystyle f(t,{\bar {u}})\leq j(t,{\bar {u}})}$ for all t and ${\displaystyle {\bar {u}}}$, and further ${\displaystyle f(0,{\bar {u}})=g({\bar {u}})}$ and ${\displaystyle f(t+1,{\bar {u}})=h(t,{\bar {u}},f(t,{\bar {u}}))}$, then f is in ${\displaystyle {\mathcal {E}}^{n}}$ as well)[note 1]

In other words, ${\displaystyle {\mathcal {E}}^{n}}$ is the closure of set ${\displaystyle B_{n}=\{Z,S,(p_{i}^{m})_{i\leq m},E_{k}:k<n\}}$ with respect to function composition and limited recursion (as defined above).

Properties

These sets clearly form the hierarchy

${\displaystyle {\mathcal {E}}^{0}\subseteq {\mathcal {E}}^{1}\subseteq {\mathcal {E}}^{2}\subseteq \cdots }$

because they are closures over the ${\displaystyle B_{n}}$'s and ${\displaystyle B_{0}\subseteq B_{1}\subseteq B_{2}\subseteq \cdots }$.

They are strict subsets (Rose 1984; Gakwaya 1997). In other words

${\displaystyle {\mathcal {E}}^{0}\subsetneq {\mathcal {E}}^{1}\subsetneq {\mathcal {E}}^{2}\subsetneq \cdots }$

because the hyper operation ${\displaystyle H_{n}}$ is in ${\displaystyle {\mathcal {E}}^{n}}$ but not in ${\displaystyle {\mathcal {E}}^{n-1}}$.

• ${\displaystyle {\mathcal {E}}^{0}}$ includes functions such as x+1, x+2, ...
• ${\displaystyle {\mathcal {E}}^{1}}$ provides all addition functions, such as x+y, 4x, ...
• ${\displaystyle {\mathcal {E}}^{2}}$ provides all multiplication functions, such as xy, x⁴
• ${\displaystyle {\mathcal {E}}^{3}}$ provides all exponentiation functions, such as x^y, 2^22x, and is exactly the elementary recursive functions.
• ${\displaystyle {\mathcal {E}}^{4}}$ provides all tetration functions, and so on.

Notably, both the function ${\displaystyle U}$ and the characteristic function of the predicate ${\displaystyle T}$ from the Kleene normal form theorem are definable in a way such that they lie at level ${\displaystyle {\mathcal {E}}^{0}}$ of the Grzegorczyk hierarchy. This implies in particular that every recursively enumerable set is enumerable by some ${\displaystyle {\mathcal {E}}^{0}}$-function.

Relation to primitive recursive functions

The definition of ${\displaystyle {\mathcal {E}}^{n}}$ is the same as that of the primitive recursive functions, PR, except that recursion is limited (${\displaystyle f(t,{\bar {u}})\leq j(t,{\bar {u}})}$ for some j in ${\displaystyle {\mathcal {E}}^{n}}$) and the functions ${\displaystyle (E_{k})_{k<n}}$ are explicitly included in ${\displaystyle {\mathcal {E}}^{n}}$. Thus the Grzegorczyk hierarchy can be seen as a way to limit the power of primitive recursion to different levels.

It is clear from this fact that all functions in any level of the Grzegorczyk hierarchy are primitive recursive functions (i.e. ${\displaystyle {\mathcal {E}}^{n}\subseteq {\mathsf {PR}}}$) and thus:

${\displaystyle \bigcup _{n}{{\mathcal {E}}^{n}}\subseteq {\mathsf {PR}}}$

It can also be shown that all primitive recursive functions are in some level of the hierarchy (Rose 1984; Gakwaya 1997), thus

${\displaystyle \bigcup _{n}{{\mathcal {E}}^{n}}={\mathsf {PR}}}$

and the sets ${\displaystyle {\mathcal {E}}^{0},{\mathcal {E}}^{1}-{\mathcal {E}}^{0},{\mathcal {E}}^{2}-{\mathcal {E}}^{1},\dots ,{\mathcal {E}}^{n}-{\mathcal {E}}^{n-1},\dots }$ partition the set of primitive recursive functions, PR.

Extensions

Main article: Fast-growing hierarchy

The Grzegorczyk hierarchy can be extended to transfinite ordinals. Such extensions define a fast-growing hierarchy. To do this, the generating functions ${\displaystyle E_{\alpha }}$ must be recursively defined for limit ordinals (note they have already been recursively defined for successor ordinals by the relation ${\displaystyle E_{\alpha +1}(n)=E_{\alpha }^{n}(2)}$). If there is a standard way of defining a fundamental sequence ${\displaystyle \lambda _{m}}$, whose limit ordinal is ${\displaystyle \lambda }$, then the generating functions can be defined ${\displaystyle E_{\lambda }(n)=E_{\lambda _{n}}(n)}$. However, this definition depends upon a standard way of defining the fundamental sequence. Rose (1984) suggests a standard way for all ordinals α < ε₀.

The original extension was due to Martin Löb and Stan S. Wainer (1970) and is sometimes called the Löb–Wainer hierarchy.

See also

• ELEMENTARY
• Ordinal analysis

Notes

1. Here ${\displaystyle {\bar {u}}}$ represents a tuple of inputs to f. The notation ${\displaystyle f({\bar {u}})}$ means that f takes some arbitrary number of arguments and if ${\displaystyle {\bar {u}}=(x,y,z)}$, then ${\displaystyle f({\bar {u}})=f(x,y,z)}$. In the notation ${\displaystyle f(t,{\bar {u}})}$, the first argument, t, is specified explicitly and the rest as the arbitrary tuple ${\displaystyle {\bar {u}}}$. Thus, if ${\displaystyle {\bar {u}}=(x,y,z)}$, then ${\displaystyle f(t,{\bar {u}})=f(t,x,y,z)}$. This notation allows composition and limited recursion to be defined for functions, f, of any number of arguments.

References

• Brainerd, W.S., Landweber, L.H. (1974), Theory of Computation, Wiley, ISBN 0-471-09585-0
• Cichon, E. A.; Wainer, S. S. (1983), "The slow-growing and the Grzegorczyk hierarchies", Journal of Symbolic Logic, 48 (2): 399–408, doi:10.2307/2273557, ISSN 0022-4812, MR 0704094
• Gakwaya, J.–S. (1997), A survey on the Grzegorczyk Hierarchy and its Extension through the BSS Model of Computability
• Grzegorczyk, A (1953). "Some classes of recursive functions" (PDF). Rozprawy matematyczne. 4: 1–45.
• Löb, M.H.; Wainer, S.S. (1970). "Hierarchies of Number Theoretic Functions I, II: A Correction". Archiv für mathematische Logik und Grundlagenforschung. 14: 198–199. doi:10.1007/bf01991855.
• Rose, H.E., Subrecursion: Functions and hierarchies, Oxford University Press, 1984. ISBN 0-19-853189-3
• Wagner, K. and Wechsung, G. (1986), Computational Complexity, Mathematics and its Applications v. 21. ISBN 978-90-277-2146-4