This is a preview of subscription content, log in via an institution to check access.
Literature cited
N. V. Belyakin, “Generalized computations and second-degree arithmetic,” Algebra i Logika,9, No. 4, 375–405 (1970).
H. B. Enderton, “Hierarchies in recursive function theory,” Trans. Amer. Math. Soc.,111, 457–471 (1964).
W. Richter, “Constructively accessible ordinal numbers,” J. Symb. Log.,33, 43–55 (1968).
C. Spector, “Inductively defined sets of natural numbers,” in: Infinitistic Methods, Pergamon (1961), pp. 97–102.
C. Spector, “Recursive well orderings,” J. Symb. Logic,20, 151–163 (1955).
D. L. Kreider, H. Rogers, Jr., “Constructive versions of ordinal numbers classes,” Trans. Amer. Math. Soc.,100, 325–369 (1961).
S. C. Kleene, “Turing-machine computable functionals of finite types,” in: I, Logic, Methodology and Philosophy of Science, Proceedings of the 1960 International Congress, Stanford (1962), pp. 38–45.
Additional information
Translated from Algebra i Logika, Vol. 12, No. 1, pp. 3–21, January–February, 1973.
Rights and permissions
About this article
Cite this article
Belyakin, N.V. On a class of recursive hierarchies. Algebr Logic 12, 1–11 (1973). https://doi.org/10.1007/BF02218636
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02218636