Oxford, England: Oxford University Press (1993)
AbstractThis work is a sequel to the author's Godel's Incompleteness Theorems, though it can be read independently by anyone familiar with Godel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.
Similar books and articles
Recursion Theory: Summer Research Institute : Papers.Anil Nerode & Richard A. Shore (eds.) - 1985 - American Mathematical Society.
Computability, an Introduction to Recursive Function Theory.Nigel Cutland - 1980 - Cambridge University Press.
Generalized Recursion Theory: Proceedings of the 1972 Oslo Symposium.Jens Erik Fenstad & Peter G. Hinman (eds.) - 1974 - New York: American Elsevier Pub. Co..
Contributions to [Alpha]- and [Beta]-Recursion Theory.Wolfgang Maass - 1978 - Minerva-Publikation.
Axiomatic Recursion Theory and the Continuous Functionals.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (2):442-450.
Computability, Enumerability, Unsolvability: Directions in Recursion Theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - Cambridge University Press.
Added to PP
Historical graph of downloads
Citations of this work
Minimal Sartre: Diagonalization and Pure Reflection.John Bova - 2018 - Open Philosophy 1:360-379.
W.D. Hart, The Evolution of Logic. [REVIEW]Cristian Alejandro Gutiérrez Ramírez - 2014 - Critica 46 (137):129-137.
References found in this work
No references found.