Oxford University Press (1993)
|Abstract||This 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.|
|Categories||No categories specified (fix it)|
|Buy the book||$40.00 used (72% off) $64.20 new (55% off) $103.04 direct from Amazon (27% off) Amazon page|
|Call number||QA9.6.S68 1993|
|Through your library||Configure|
Similar books and articles
S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.
Raymond M. Smullyan (1992). Gödel's Incompleteness Theorems. Oxford University Press.
Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.
Wolfgang Maass (1978). Contributions to [Alpha]- and [Beta]-Recursion Theory. Minerva-Publikation.
Jens Erik Fenstad & Peter G. Hinman (eds.) (1974). Generalized Recursion Theory. New York,American Elsevier Pub. Co..
Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
Anil Nerode & Richard A. Shore (eds.) (1985). Recursion Theory. American Mathematical Society.
Raymond M. Smullyan (1994). Diagonalization and Self-Reference. Clarendon Press.
Added to index2009-01-28
Total downloads18 ( #67,474 of 548,984 )
Recent downloads (6 months)1 ( #63,327 of 548,984 )
How can I increase my downloads?