This work is a sequel to the author's Gödel's Incompleteness Theorems, though it can be read independently by anyone familiar with Gödel'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.
Readership: Researchers as well as students and teachers of advanced undergraduate and beginning graduate-level courses in mathematical logic, philosophy, and computer science.
Raymond M. Smullyan, Professor of Philosophy, Indiana University
"'highly recommended' A.D. Irvine, University of British Columbia, History and Philosophy of Logic, 15 (1994)"
"thanks to the virtual lack or prerequisites and the detailed, easy-to-follow proofs, Recursion Theory for Metamathematics is highly accessible to beginning logicians ... There is much, both in results and in methods, that will be of interest to a variety of readers." - Leon Harkleroad, Modern Logic, Volume 4, No. 3 (July 1994)
1: Recursive Enumerability and Recursivity 2: Undecidability and Recursive Inseparability 3: Indexing 4: Generative Sets and Creative Systems 5: Double Generativity and Complete Effective Inseparability 6: Universal and Doubly Universal Systems 7: Shepherdson Revisited 8: Recursion Theorems 9: Symmetric and Double Recursion Theorems 10: Productivity and Double Productivity 11: Three Special Topics 12: Uniform Godelization
