P.R.-regulated systems of notation and the subrecursive hierarchy equivalence property
HTML articles powered by AMS MathViewer
- by Fred Zemke PDF
- Trans. Amer. Math. Soc. 234 (1977), 89-118 Request permission
Abstract:
We can attempt to extend the Grzegorczyk Hierarchy transfinitely by defining a sequence of functions indexed by the elements of a system of notation $\mathcal {S}$, using either iteration (majorization) or enumeration techniques to define the functions. (The hierarchy is then the sequence of classes of functions elementary in the functions of the sequence of functions.) In this paper we consider two sequences ${\{ {F_s}\} _{s \in \mathcal {S}}}$ and ${\{ {G_s}\} _{s \in \mathcal {S}}}$ defined by iteration and a sequence ${\{ {E_s}\} _{s \in \mathcal {S}}}$ defined by enumeration; the corresponding hierarchies are $\{ {\mathcal {F}_s}\} ,\{ {\mathcal {G}_s}\} ,\{ \mathcal {E}{_s}\}$. We say that $\mathcal {S}$ has the subrecursive hierarchy equivalence property if these two conditions hold: (I) ${\mathcal {E}_s} = {\mathcal {F}_s} = {\mathcal {G}_s}$ for all $s \in \mathcal {S}$; (II) ${\mathcal {E}_s} = {\mathcal {E}_t}$ for all $s,t \in \mathcal {S}$ such that $|s| = |t|(|s|$ is the ordinal denoted by s). We show that a certain type of system of notation, called p.r.-regulated, has the subrecursive hierarchy equivalence property. We present a nontrivial example of such a system of notation, based on Schütte’s Klammersymbols. The resulting hierarchy extends those previously in print, which used the so-called standard fundamental sequences for limits $< {\varepsilon _0}$.References
- Paul Axt, On a subrecursive hierarchy and primitive recursive degrees, Trans. Amer. Math. Soc. 92 (1959), 85–105. MR 126377, DOI 10.1090/S0002-9947-1959-0126377-3
- Solomon Feferman, Classifications of recursive functions by means of hierarchies, Trans. Amer. Math. Soc. 104 (1962), 101–122. MR 142453, DOI 10.1090/S0002-9947-1962-0142453-3
- Solomon Feferman, Systems of predicative analysis. II. Representations of ordinals, J. Symbolic Logic 33 (1968), 193–220. MR 260589, DOI 10.2307/2269866
- Andrzej Grzegorczyk, Some classes of recursive functions, Rozprawy Mat. 4 (1953), 46. MR 60426 S. C. Kleene, On notation for ordinals, J. Symbolic Logic 3 (1938), 150-155.
- S. C. Kleene, Extension of an effectively generated class of functions by enumeration, Colloq. Math. 6 (1958), 67–78. MR 118672, DOI 10.4064/cm-6-1-67-78
- M. H. Löb and S. S. Wainer, Hierarchies of number-theoretic functions. I, Arch. Math. Logik Grundlag. 13 (1970), 39–51. MR 284339, DOI 10.1007/BF01967649 J. W. Robbin, Subrecursive hierarchies, Dissertation, Princeton Univ., 1965.
- Kurt Schütte, Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen, Math. Ann. 127 (1954), 15–32 (German). MR 60556, DOI 10.1007/BF01361109
- Helmut Schwichtenberg, Eine Klassifikation der $\varepsilon _{0}$-rekursiven Funktionen, Z. Math. Logik Grundlagen Math. 17 (1971), 61–74 (German). MR 282843, DOI 10.1002/malq.19710170113
- Helmut Schwichtenberg, Beweistheoretische Charakterisierung einer Erweiterung der Grzegorczyk-Hierarchie, Arch. Math. Logik Grundlag. 15 (1972), 129–145 (German). MR 325370, DOI 10.1007/BF02008530 —, Charakterisierung einer erweiterten Grzegorczyk-Hierarchie unter Verwendung endlicher Terme (mimeographed).
- Oswald Veblen, Continuous increasing functions of finite and transfinite ordinals, Trans. Amer. Math. Soc. 9 (1908), no. 3, 280–292. MR 1500814, DOI 10.1090/S0002-9947-1908-1500814-9
- S. S. Wainer, A classification of the ordinal recursive functions, Arch. Math. Logik Grundlag. 13 (1970), 136–153. MR 294134, DOI 10.1007/BF01973619
- S. S. Wainer, Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy, J. Symbolic Logic 37 (1972), 281–292. MR 321715, DOI 10.2307/2272973
Additional Information
- © Copyright 1977 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 234 (1977), 89-118
- MSC: Primary 02F20; Secondary 02F35
- DOI: https://doi.org/10.1090/S0002-9947-1977-0498045-0
- MathSciNet review: 0498045