Recursion Theory for Metamathematics

Hardcover | August 1, 1988

byRaymond M. Smullyan

not yet rated|write a review
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 ofincompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.

Pricing and Purchase Info

$176.00

Ships within 1-3 weeks
Ships free on orders over $25

From the Publisher

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 ofincompleteness, undecidability, and related...

Raymond M. Smullyan is at Indiana University.

other books by Raymond M. Smullyan

What Is the Name of This Book?: The Riddle of Dracula and Other Logical Puzzles
What Is the Name of This Book?: The Riddle of Dracula a...

Paperback|Aug 18 2011

$16.91 online$16.95list price
The Chess Mysteries of Sherlock Holmes: Fifty Tantalizing Problems of Chess Detection
The Chess Mysteries of Sherlock Holmes: Fifty Tantalizi...

Paperback|Jan 17 2012

$15.70 online$16.95list price(save 7%)
First-Order Logic
First-Order Logic

Paperback|Apr 14 2012

$167.95

see all books by Raymond M. Smullyan
Format:HardcoverDimensions:184 pages, 9.29 × 6.18 × 0.79 inPublished:August 1, 1988Publisher:Oxford University Press

The following ISBNs are associated with this title:

ISBN - 10:019508232X

ISBN - 13:9780195082326

Look for similar items by category:

Customer Reviews of Recursion Theory for Metamathematics

Reviews

Extra Content

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

Editorial Reviews

". . . an interesting presentation of recursion theory from the point of view of its applications in metamathematics, indicating many interrelations between various notions and properties. It will certainly be studied carefully and referred to by students and specialists alike." --RomanMurawski, Mathematical Reviews