Classical Recursion Theory

Bulletin of Symbolic Logic 7 (1):71-73 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 89,654

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

REVIEWS-Classical recursion theory, Volume II.P. Odifreddi & Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-72.
Ordinal machines and admissible recursion theory.Peter Koepke & Benjamin Seyfferth - 2009 - Annals of Pure and Applied Logic 160 (3):310-318.
The equivalence of bar recursion and open recursion.Thomas Powell - 2014 - Annals of Pure and Applied Logic 165 (11):1727-1754.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
Recursion theorems and effective domains.Akira Kanda - 1988 - Annals of Pure and Applied Logic 38 (3):289-300.
Recursion theory.Anil Nerode & Richard A. Shore (eds.) - 1985 - Providence, R.I.: American Mathematical Society.
Generalized recursion theory.Jens Erik Fenstad & Peter G. Hinman (eds.) - 1974 - New York,: American Elsevier Pub. Co..
Canonical Forms and Hierarchies in Generalized Recursion Theory.Phokion G. Kolaitis - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--139.
Techniques of admissible recursion theory.C.-T. Chong - 1984 - New York: Springer Verlag.
Algebraic recursion theory.Ljubomir Lalov Ivanov - 1986 - New York: Halsted Press.
Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..
Axiomatic recursion theory and the continuous functionals.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (2):442-450.

Analytics

Added to PP
2013-11-03

Downloads
31 (#439,810)

6 months
2 (#648,997)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Mass problems and randomness.Stephen G. Simpson - 2005 - Bulletin of Symbolic Logic 11 (1):1-27.
A cohesive set which is not high.Carl Jockusch & Frank Stephan - 1993 - Mathematical Logic Quarterly 39 (1):515-530.
On interpreting Chaitin's incompleteness theorem.Panu Raatikainen - 1998 - Journal of Philosophical Logic 27 (6):569-586.

View all 68 citations / Add more citations

References found in this work

No references found.

Add more references