Recursion Theory for Metamathematics
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.
1100463881
Recursion Theory for Metamathematics
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.
188.99 In Stock
Recursion Theory for Metamathematics

Recursion Theory for Metamathematics

by Raymond M. Smullyan
Recursion Theory for Metamathematics

Recursion Theory for Metamathematics

by Raymond M. Smullyan

eBook

$188.99 

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers

LEND ME® See Details

Overview

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.

Product Details

ISBN-13: 9780195344813
Publisher: Oxford University Press
Publication date: 01/28/1993
Series: Oxford Logic Guides , #22
Sold by: Barnes & Noble
Format: eBook
Lexile: 1350L (what's this?)
File size: 2 MB

About the Author

Indiana University

Table of Contents

1. Recursive Enumerability and Recursivity2. Undecidability and Recursive Inseparability3. Indexing4. Generative Sets and Creative Systems5. Double Generativity and Complete Effective Inseparability6. Universal and Doubly Universal Systems7. Shepherdson Revisited8. Recursion Theorems9. Symmetric and Double Recursion Theorems10. Productivity and Double Productivity11. Three Special Topics12. Uniform Godelization
From the B&N Reads Blog

Customer Reviews