Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

On a class of recursive hierarchies

This is a preview of subscription content, log in to check access.

Literature cited

  1. 1.

    N. V. Belyakin, “Generalized computations and second-degree arithmetic,” Algebra i Logika,9, No. 4, 375–405 (1970).

  2. 2.

    H. B. Enderton, “Hierarchies in recursive function theory,” Trans. Amer. Math. Soc.,111, 457–471 (1964).

  3. 3.

    W. Richter, “Constructively accessible ordinal numbers,” J. Symb. Log.,33, 43–55 (1968).

  4. 4.

    C. Spector, “Inductively defined sets of natural numbers,” in: Infinitistic Methods, Pergamon (1961), pp. 97–102.

  5. 5.

    C. Spector, “Recursive well orderings,” J. Symb. Logic,20, 151–163 (1955).

  6. 6.

    D. L. Kreider, H. Rogers, Jr., “Constructive versions of ordinal numbers classes,” Trans. Amer. Math. Soc.,100, 325–369 (1961).

  7. 7.

    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.

Download references

Additional information

Translated from Algebra i Logika, Vol. 12, No. 1, pp. 3–21, January–February, 1973.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Belyakin, N.V. On a class of recursive hierarchies. Algebr Logic 12, 1–11 (1973).

Download citation


  • Mathematical Logic
  • Recursive Hierarchy