Recursion Theory for Metamathematics

Recursion Theory for Metamathematics

3.5 (2 ratings by Goodreads)
By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 3 business days
When will my order arrive?

Description

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.show more

Product details

  • Hardback | 178 pages
  • 160.02 x 231.14 x 17.78mm | 430.91g
  • Oxford University Press Inc
  • New York, United States
  • English
  • New.
  • 019508232X
  • 9780195082326
  • 1,658,325

Review quote

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) * highly recommended * A.D. Irvine, University of British Columbia, History and Philosophy of Logic, 15 (1994) *show more

Table of contents

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 Godelizationshow more

Rating details

2 ratings
3.5 out of 5 stars
5 0% (0)
4 50% (1)
3 50% (1)
2 0% (0)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X