Grzegorczyk Hierarchy

The Grzegorczyk hierarchy (, ), named after the Polish logician Andrzej Grzegorczyk, is a hierarchy of functions used in computability theory. 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 levels 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 $E_0(x,y)=x+y$ and $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 2, we define $E_n(x)=E^_(2)$, i.e. the ''x''-th iterate of $E_$ evaluated at 2.

From these functions we define the Grzegorczyk hierarchy. $\mathcal^n$, the ''n''-th set in the hierarchy, contains the following functions:
# ''E_k'' for ''k'' < ''n''
# the zero function (''Z''(''x'') = 0);
# the successor function (''S''(''x'') = ''x'' + 1);
# the projection functions ($p_i^m(t_1, t_2, \dots, t_m) = t_i$);
# the (generalized) compositions of functions in the set (if ''h'', ''g''₁, ''g''₂, ... and ''g''_m are in $\mathcal^n$, then $f(\bar) = h(g_1(\bar), g_2(\bar), \dots, g_m(\bar))$ is as well);Here $\bar$ represents a tuple of inputs to ''f''. The notation $f(\bar)$ means that ''f'' takes some arbitrary number of arguments and if $\bar = (x, y, z)$, then $f(\bar) = f(x, y, z)$. In the notation $f(t, \bar)$, the first argument, ''t'', is specified explicitly and the rest as the arbitrary tuple $\bar$. Thus, if $\bar = (x, y, z)$, then $f(t, \bar) = f(t, x, y, z)$. This notation allows composition and limited recursion to be defined for functions, ''f'', of any number of arguments. and
# the results of limited (primitive) recursion applied to functions in the set, (if ''g'', ''h'' and ''j'' are in $\mathcal^n$ and $f(t, \bar) \leq j(t, \bar)$ for all ''t'' and $\bar$, and further $f(0, \bar) = g(\bar)$ and $f(t+1, \bar) = h(t,\bar,f(t,\bar))$, then ''f'' is in $\mathcal^n$ as well).

In other words, $\mathcal^n$ is the closure of set $B_n = \$ with respect to function composition and limited recursion (as defined above).

Properties

These sets clearly form the hierarchy
:$\mathcal^0 \subseteq \mathcal^1 \subseteq \mathcal^2 \subseteq \cdots$
because they are closures over the $B_n$'s and $B_0 \subseteq B_1 \subseteq B_2 \subseteq \cdots$.

They are strict subsets. In other words
:$\mathcal^0 \subsetneq \mathcal^1 \subsetneq \mathcal^2 \subsetneq \cdots$
because the hyper operation $H_n$ is in $\mathcal^n$ but not in $\mathcal^$.

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

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

Relation to primitive recursive functions

The definition of $\mathcal^n$ is the same as that of the primitive recursive functions, , except that recursion is ''limited'' ($f(t, \bar) \leq j(t, \bar)$ for some ''j'' in $\mathcal^n$) and the functions $(E_k)_$ are explicitly included in $\mathcal^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. $\mathcal^n \subseteq \mathsf$) and thus:
:$\bigcup_n \subseteq \mathsf$

It can also be shown that all primitive recursive functions are in some level of the hierarchy, thus
:$\bigcup_n = \mathsf$
and the sets $\mathcal^0, \mathcal^1 - \mathcal^0, \mathcal^2 - \mathcal^1, \dots, \mathcal^n - \mathcal^, \dots$ partition the set of primitive recursive functions, .

Extensions

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

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

See also

* ELEMENTARY
* Fast-growing hierarchy
* Ordinal analysis

Notes

References

Bibliography

*

*

*

*

*

*

*

{{Large numbers
Computability theory
Hierarchy of functions