Skip to main content

Infinite terms and recursion in higher types

Part of the Lecture Notes in Mathematics book series (LNM,volume 500)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Aczel and P. G. Hinman, “Recursion in the Superjump”, in Generalized Recursion Theory (Eds. Fenstad and Hinman), North-Holland (1974).

    Google Scholar 

  2. S. Feferman, “Classifications of Recursive Functions by means of Hierarchies”, Trans. Amer. Math. Soc. vol 104 (1962) pp. 101–122.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. S. Feferman, “Ordinals and Functionals in Proof Theory”, Proc. of Int. Congress of Mathematicians Nice (1970), pp. 229–233.

    Google Scholar 

  4. S. Feferman, “Recursion in Total Functionals of Finite Type”, to appear.

    Google Scholar 

  5. S. C. Kleene, “Recursive Functionals and Quantifiers of Finite Types I, II”, Trans. Amer. Math. Soc. vol 91 (1959) pp. 1–52, vol 108 (1963) pp. 106–142.

    MathSciNet  MATH  Google Scholar 

  6. E. G. K. Lopez-Escobar, “Remarks on an Infinitary Language with Constructive Formulas”, Journ. Symb. Logic vol 32 (1967) pp. 305–319.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Y. N. Moschovakis, “Hyperanalytic Predicates”, Trans. Amer Math. Soc. vol 129 (1967) pp. 249–282.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. R. A. Platek, “A Countable Hierarchy for the Superjump”, in Logic Colloquium '69 (Eds. Gandy and Yates) North-Holland (1971).

    Google Scholar 

  9. H. Schwichtenberg, “Elimination of Higher Type Levels in Definitions of Primitive Recursive Fnls. by Transfinite Recursion”, to appear in Proc. of Bristol Logic Colloquium 1973 (Eds. Rose and Shepherdson), North-Holland.

    Google Scholar 

  10. W. W. Tait, “Infinitely Long Terms of Transfinite Type”, in Formal Systems and Recursive Functions (Eds. Crossley and Dummett) North-Holland (1965).

    Google Scholar 

  11. S. S. Wainer, “A Hierarchy for the 1-Section of Any Type Two Object”, Journ. Symb. Logic vol 39 (1974) pp. 88–94.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Schwichtenberg, H., Wainer, S.S. (1975). Infinite terms and recursion in higher types. In: Diller, J., Müller, G.H. (eds) ⊨ISILC Proof Theory Symposion. Lecture Notes in Mathematics, vol 500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0079561

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07533-2

  • Online ISBN: 978-3-540-38020-7

  • eBook Packages: Springer Book Archive