Skip to main content
SpringerLink
Log in
Book cover

⊨ISILC Logic Conference pp 143–168Cite as

Computation theories: An axiomatic approach to recursion on general structures

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Aczel, An axiomatic approach to recursive function theory on the integers, unpublished abstract, 1969.

    Google Scholar 

  2. P. Aczel, An axiomatic approach to recursion on admissible ordinals and the Kreisel-Sacks construction of meta-recursion theory, Recursive function theory Newsletter, 1974.

    Google Scholar 

  3. K. J. Barwise, Admissible sets over models of set theory, in: Fenstad, Hinman [7], 97–122.

    Google Scholar 

  4. K. J. Barwise, Admissible set theory, Springer Verlag, to appear.

    Google Scholar 

  5. K. J. Barwise, R. Gandy and Y. N. Moschovakis, The next admissible set, J. Symbolic Logic 36 (1971), 108–120.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. E. Fenstad, On axiomatizing recursion theory, in: Fenstad, Hinman [7], 385–404.

    Google Scholar 

  7. J. E. Fenstad and P. Hinman (eds.), Generalized recursion theory, North-Holland, Amsterdam 1974.

    MATH  Google Scholar 

  8. H. Friedman, Axiomatic recursive function theory, in: R. Gandy and C. E. M. Yates (eds.) Logic Colloquium '69, North-Holland, Amsterdam 1971, 113–137.

    Google Scholar 

  9. R. Gandy, General recursive functionals of finite type and hierarchies of functionals, Ann. Fac. Sci. Univ. Clermont-Ferrand 35 (1967), 5–24.

    MathSciNet  Google Scholar 

  10. T. Grilliot, Hierarchies, based on objects of finite type, J. Symbolic Logic 34 (1969), 177–182.

    Article  MATH  MathSciNet  Google Scholar 

  11. T. Grilliot, Selection functions for recursive functionals, Notre Dame Jour. Formal Logic 10 (1969), 225–234.

    Article  MATH  MathSciNet  Google Scholar 

  12. T. Grilliot, Inductive definitions and computability, Trans. Amer. Math. Soc. 158 (1971), 309–317.

    Article  MATH  MathSciNet  Google Scholar 

  13. L. Harrington, Contributions to recursion theory in higher types, MIT thesis, 1973.

    Google Scholar 

  14. L. Harrington, The superjump and the first recursively Mahlo ordinal, in: Fenstad, Hinman [7], 43–52.

    Google Scholar 

  15. L. Harrington and A. Kechris, Classifying and characterizing abstract classes of relations, to appear.

    Google Scholar 

  16. L. Harrington and D. B. MacQueen, Selection in abstract recursion theory, to appear.

    Google Scholar 

  17. A. Kechris, The structure of envelopes: a survey of recursion theory in higher types, MIT Logic Seminar Notes, 1973.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  19. G. Kreisel and G. E. Sacks, Metarecursive sets, J. Symbolic Logic 30 (1965), 318–338.

    Article  MATH  MathSciNet  Google Scholar 

  20. D. B. MacQueen, Post's problem for recursion in higher types, MIT thesis, 1972.

    Google Scholar 

  21. J. Moldestad, Recursion theory on two types, Oslo 1974.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  23. Y. N. Moschovakis, Abstract first order computability, Trans. Amer. Math. Soc. 138 (1969), 427–504.

    Article  MATH  MathSciNet  Google Scholar 

  24. Y. N. Moschovakis, Axioms for computation theories— first draft, in: R. Gandy and C. E. M. Yates (eds.), Logic Colloquium '69, North-Holland, Amsterdam 1971, 199–255.

    Google Scholar 

  25. Y. N. Moschovakis, Structural characterizations of classes of relations, in: Fenstad, Hinman [7], 53–79.

    Google Scholar 

  26. Y. N. Moschovakis, Elementary induction on abstract structures, North-Holland, Amsterdam.

    Google Scholar 

  27. Y. N. Moschovakis, On non monotone inductive definability, Fund. Math. 1974.

    Google Scholar 

  28. D. Normann, On abstract 1-sections, Synthese 27 (1974), 259–263.

    Article  MATH  MathSciNet  Google Scholar 

  29. D. Normann, Imbedding of higher type theories, Oslo 1974.

    Google Scholar 

  30. R. A. Platek, Foundations of recursion theory, Stanford thesis, 1966.

    Google Scholar 

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

    Google Scholar 

  32. G. E. Sacks, The k-section of a type n object, to appear.

    Google Scholar 

  33. L. P. Sasso, Degrees of unsolvability of partial functions, Berkeley thesis, 1971.

    Google Scholar 

  34. S. G. Simpson, Degree theory on admissible ordinals, in: Fenstad, Hinman [7], 165–193.

    Google Scholar 

  35. S. G. Simpson, Post's problem for admissible sets, in: Fenstad, Hinman [7] 437–441.

    Google Scholar 

  36. H. R. Strong, Algebraically generalized recursive function theory, IBM J. Res. Devel. 12 (1968), 465–475.

    Article  MATH  MathSciNet  Google Scholar 

  37. E. G. Wagner, Uniform reflexive structures: on the nature of Gödelizations and relative computability, Trans. Amer. Math. Soc. 144 (1969), 1–41.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Oslo, Oslo, Norway

    Jens Erik Fenstad

Authors
  1. Jens Erik Fenstad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gert H. Müller Arnold Oberschelp Klaus Potthoff

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Fenstad, J.E. (1975). Computation theories: An axiomatic approach to recursion on general structures. In: Müller, G.H., Oberschelp, A., Potthoff, K. (eds) ⊨ISILC Logic Conference. Lecture Notes in Mathematics, vol 499. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0079420

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07534-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation