Skip to main content
Log in

A classification of the ordinal recursive functions

  • Published:
Archiv für mathematische Logik und Grundlagenforschung Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Davis, M., Computability and Unsolvability, McGraw-Hill (1958).

  2. Gödel, K., Über eine bisher noch nicht benützte Erweiterung des Finiten Standpunktes, Dialectica12 (1958), pp. 280–287.

    Google Scholar 

  3. Grzegorczyk, A., Some Classes of Recursive Functions, Rozprawy Matematyczne No.4, Warsaw (1953).

  4. Kino, A., On Provably Recursive Functions and Ordinal Recursive Functions, J. Math. Soc. Japan, Vol. 20, No. 3, (1968), pp. 456–476.

    Google Scholar 

  5. Kreisel, G., On the Interpretation of Non-Finitist Proofs, J. Symbolic Logic17 (1952), pp. 43–58.

    Google Scholar 

  6. Kreisel, G., Inessential Extensions of Heyting's Arithmetic by means of Functionals of Finite Types, abstract, J. Symbolic Logic,24 (1959), p. 284.

    Google Scholar 

  7. Löb, M. H., and Wainer, S. S., Hierarchies of Number-Theoretic Functions, this vol.

  8. Péter, R., Recursive Functions, Academic Press (1967).

  9. Robbin, J. W., Ph. D. Dissertation, Princeton University (1965).

  10. Tait, W. W., Nested Recursion, Math. Annalen,143 (1961), pp. 236–250.

    Article  Google Scholar 

  11. Tait, W. W., A Characterization of Ordinal Recursive Functions, abstract, J. Symbolic Logic,24 (1959), p. 325.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The author wishes to express his sincere thanks to Professor M. H. Löb for invaluable help and encouragement during the preparation of this work.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wainer, S.S. A classification of the ordinal recursive functions. Arch math Logik 13, 136–153 (1970). https://doi.org/10.1007/BF01973619

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01973619

Keywords

Navigation