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.
Inhaltsverzeichnis
- 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