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

Increase of the complexity of functions by an application of multiple recursion

  • 16 Accesses

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

Literature cited

  1. 1.

    M. H. Löb and S. S. Wainer, “Hierarchies of number-theoretic functions (I),” Arch. Math. Logik Grundlagenforsch.,13, Nos. 1–2 (1970).

  2. 2.

    M. H. Löb, and S. S. Wainer, “Hierarchies of number-theoretic functions (II),” Arch. Math. Logik Grundlagenforsch.,13, Nos. 3–4 (1970).

  3. 3.

    S. S. Wainer, “A classification of the ordinal recursive functions,” Arch. Math. Logik Grundlagenforsch.,13, Nos. 3–4 (1970).

  4. 4.

    C. Parsons, “Hierarchies of primitive recursive functions,” Z. Math. Logik Grundl. Math.,14, 357–376 (1968).

  5. 5.

    R. Peter, Recursive Functions, Budapest (1961).

Download references

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 32, pp. 12–17, 1972.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Dantsih, E.Y. Increase of the complexity of functions by an application of multiple recursion. J Math Sci 6, 353–357 (1976). https://doi.org/10.1007/BF01084072

Download citation