Cart
Free Shipping in the UK
Proud to be B-Corp

Recursion Theory for Metamathematics Raymond M. Smullyan (Professor of Philosophy, Professor of Philosophy, Indiana University)

Recursion Theory for Metamathematics By Raymond M. Smullyan (Professor of Philosophy, Professor of Philosophy, Indiana University)

Recursion Theory for Metamathematics by Raymond M. Smullyan (Professor of Philosophy, Professor of Philosophy, Indiana University)


£164.69
Condition - New
Only 2 left

Summary

In 1931, Princeton mathematician Kurt Godel startled the scientific world with his 'Theorem of Undecidability', which showed that some statements in mathematics are inherently 'undecidable'. This volume of the 'Oxford Logic Guides' is a sequel to Smullyan's Godel's 'Incompleteness Theorems' (Oxford Logic Guides No. 19, 1992).

Recursion Theory for Metamathematics Summary

Recursion Theory for Metamathematics by Raymond M. Smullyan (Professor of Philosophy, Professor of Philosophy, Indiana University)

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.

Recursion Theory for Metamathematics Reviews

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

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 Godelization

Additional information

NPB9780195082326
9780195082326
019508232X
Recursion Theory for Metamathematics by Raymond M. Smullyan (Professor of Philosophy, Professor of Philosophy, Indiana University)
New
Hardback
Oxford University Press Inc
1993-07-15
178
N/A
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a new book - be the first to read this copy. With untouched pages and a perfect binding, your brand new copy is ready to be opened for the first time

Customer Reviews - Recursion Theory for Metamathematics