Recursion Theory for Metamathematics

Erscheinungsjahr 1993
ISBN: 978-0-19-508232-6
Verlag: Oxford University Press

Buch, Englisch, 184 Seiten, Print PDF, Format (B × H): 161 mm x 240 mm, Gewicht: 440 g

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.

Autoren/Hrsg.

Smullyan, Raymond M.

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik

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