Skip to main content
SpringerLink
Log in

A survey of finite-type Recursion

  • Contributed Papers
  • Conference paper
  • First Online:
Set Theory and Hierarchy Theory V

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

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aczel,P. 1970 Representability in some systems of second-order arithmetic, Israel Jour.Math. (1970) 309–328. (Studies the relationship between recursion in E 1# , Σ 11 inductive definability, and representability in a certain formal axiomatic system for arithmetic).

    Google Scholar 

  2. Aczel,P. and Hinman,P. 1974 Recursion in the superjump, in Fenstad-Hinman [1974],3–41 (This paper shows that the jump hierarchy fails to exhaust 2-sc(II) whenever the superjump functional is recursive in II and constructs a more elaborate jump hierarchy which does exhaust 2-sc (sπ). The connections between recursion in type-2 functionals and ordinal recursion are explored in some detail and include Theorem J (i).)

    Google Scholar 

  3. Barwise, K.J. 1977 Handbook of Mathematical Logic, North Holland, Amsterdam 1976.

    Google Scholar 

  4. Bergstra, I. 1976 Computability and Continuity in Finite Types, Ph.D. Thesis, University of Utrecht, Netherland, 1976,184 pp. (A good introduction to the theory of continuous and countable functionals, which contains in addition to new results a survey of many older ones).

    Google Scholar 

  5. Crossley, J.N. 1967 Sets, Models, and Recursion Theory (Proceedings of the Summer School in Mathematical Logic and Logic Colloquium, Leicester, England, 1965, Editor) North Holland, Amsterdam, 1967, 331 pp.

    MATH  Google Scholar 

  6. Fenstad,I.E. 1975 Computation theories: an axiomatic approach to recursion on general structures, in Müller et.al.[1975], 143–168. (A very readable and thorough survey of axiomatic recursion theory).

    Google Scholar 

  7. Fenstad, I.E. and Hinman, P.G. 1974 Generalized Recursion Theory. (Proceedings of the 1972 Oslo Symposium, Editors) North Holland, Amsterdam 1974, 456 pp.

    MATH  Google Scholar 

  8. Gandy,R.O. 1967 Computable functionals of finite type I, in Crossley [1967], 202–242.

    Google Scholar 

  9. 1967a General Tecursive functionals of finite type and hierarchies of functions, Ann.Fac.Sci.Univ. Clermont-Ferrand 35 (1967) 6–24. (The Stage-Comparison and Selection Theorems for type 2 were announced here (the paper was written in 1962) and their consequences developed. The superjump is defined and shown to have 1-section property contained in Δ 12 ).

    MathSciNet  Google Scholar 

  10. Gandy, R.O. and Yates, C.E.M. 1971 Logic Colloquium 69 (Proceedings of the Summer School and Colloquium in Mathematical Logic, Manchester, 1969, Editors), North Holland, Amsterdam, 1971, 451 pp.

    MATH  Google Scholar 

  11. Grilliot, T.J. 1969 Selection functions for recursive functionals, Notre Dame J. of Formal Logic 10 (1969) 225–234 (Announces Theorem B, but provides an incorrect proof-cf. Harrington-Mac Queen [1976]

    Article  MathSciNet  MATH  Google Scholar 

  12. 1971 On effectively discontinuous type-2 objects, Jour.Symb.Log. 36(1971) 245–248. (Proves that a functional F is normal iff 1-sc(F) is closed under ordinary jump iff F is, in a certain sense, effectively discontinuous).

    Article  MathSciNet  MATH  Google Scholar 

  13. Harrington,L.A. 1973 Contributions to Recursion Theory on Higher Types (or, a Proof of Harrington's Conjecture), Ph.D. Thesis, MIT, 1973. (Many results about finite-type recursion theory including the Plus-Two Theorem and the reflection properties which go into its proof. Some of the proofs are rather sketchy. The approach is rather set-theoretical and based on a characterization of recursion in terms of relative constructibility)

    Google Scholar 

  14. 1974 The superjump and the first recursively Mahlo ordinal, in Fenstad-Hinman [1974], 43–52 (Proof of Theorem J (ii) and further information about the superjump and its generalizations to higher types).

    Google Scholar 

  15. 1975 The Kołmogorov R-operator and the first non-projectible ordinal, mimeographed notes. (Defines a partial type-3 functional related to the Kołmogorov R-operator (cf.Hinman [1969]) with 1-section the set of reals in Lσ, where σ is the first ordinal stable in the first non-projectible ordinal)

    Google Scholar 

  16. Harrington, L.A. and Mac Queen, D.B. 1976 Selection in abstract recursion theory, Jour.Symb.Log. 41(1976) 153–158. (A complete, well-written proof of Theorem B)

    Article  MathSciNet  MATH  Google Scholar 

  17. Harrington, L.A. and Kechris, A.S. 1975 On characterizing Spector classes, Jour.Symb.Log. 40(1975) 19–24.

    Article  MathSciNet  MATH  Google Scholar 

  18. Hinman, P.G. 1969 Hierarchies of effective descriptive set theory, Trans.Amer.Math.Soc. 142(1969) 111–140.

    Article  MathSciNet  MATH  Google Scholar 

  19. Hyland, J.M.E. 1975 Recursion Theory on the Countable Functionals, Ph.D.Thesis, University of Oxford, 1975

    Google Scholar 

  20. Kechris, A.S. 1973 The structure of envelopes: a survey of recursion theory in higher types, MIT Logic Seminar notes, 1973, 28 pp.

    Google Scholar 

  21. Kechris, A.S. and Moschovakis, Y.N. 1976 Recursion in higher types, in Barwise [1977].

    Google Scholar 

  22. Kleene, S.C. 1959 Recursive functionals and quantifiers of finite types I, Trans.Amer.Math.Soc. 91(1959) 1–52.

    MathSciNet  MATH  Google Scholar 

  23. [18a] 1963 Recursive functionals and quantifiers of finite types II, Trans.Amer.Math.Soc. 108(1963) 106–142.

    MathSciNet  MATH  Google Scholar 

  24. Lowenthal, F. 1976 Equivalence of some definitions of recursion in a higher type object, Jour.Symb.Log. 41(1976) 427–435.

    Article  MathSciNet  MATH  Google Scholar 

  25. Moldestad, J. 1976 Computation Theory on Two Types, University of Oslo Preprint Series 2 (1976), 120 pp.

    Google Scholar 

  26. Moldestad, J. and Normann, D. 1972 2-Envelopes and the Analytical Hierarchy, University of Oslo Preprint Series 21(1974), 14 pp.

    Google Scholar 

  27. Normann, D. 1973 On Abstract 1-Sections, University of Oslo Preprint Series 19(1973), 7 pp.

    Google Scholar 

  28. Moschovakis, Y.N. 1967 Hyperanalytic predicates, Trans.Amer. Math.Soc. 129 (1967) 249–282.

    Article  MathSciNet  MATH  Google Scholar 

  29. Müller, G.H., Oberschelp, A., and Potthoff, K. 1975 Logic Conference Kiel, 1974 (Proceedings of the International Summer Institute and Logic Colloquium, Editors), Lecture Notes in Mathematics 499, Springer-Verlag, Berlin-Heidelberg-New York, 1975, 651 pp.

    Chapter  Google Scholar 

  30. Sacks, G.E. 1974 The 1-section of a type-n object, in Fenstad-Hinman [1974], 81–93.

    Google Scholar 

  31. Shoenfield, J.R. 1968 A hierarchy based on a type-2 object, Trans.Amer.Math.Soc. 134(1968) 103–108.

    Article  MathSciNet  MATH  Google Scholar 

  32. Wainer, S. 1974 A hierarchy for the 1-section of any type-two object, Jour.Symb.Log. 39(1974) 88–95.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. Peter G. Hinman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alistair Lachlan Marian Srebrny Andrzej Zarach

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag

About this paper

Cite this paper

Hinman, P.G. (1977). A survey of finite-type Recursion. In: Lachlan, A., Srebrny, M., Zarach, A. (eds) Set Theory and Hierarchy Theory V. Lecture Notes in Mathematics, vol 619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067652

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08521-8

  • Online ISBN: 978-3-540-37032-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation