Recursion Theory
Recursion Theory
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.
$148.00
USDSince their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the first publication in the Lecture Notes in Logic series, Shoenfield gives a clear and focused introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming one of the pillars on which modern computer science rests. This introduction is an ideal instrument for teaching and self-study that prepares the reader for the study of advanced monographs and the current literature on recursion theory.
- Provides readers with a clear and focused introduction to recursion theory
- Ideal for teaching and for self-study
- Prepares the reader for the study of advanced monographs and current literature on the topic
Product details
March 2017Adobe eBook Reader
9781316731611
0 pages
0kg
This ISBN is for an eBook version which is distributed on our behalf by a third party.
Table of Contents
- 1. Computability
- 2. Functions and relations
- 3. The basic machine
- 4. Macros
- 5. Closure properties
- 6. Definitions of recursive functions
- 7. Codes
- 8. Indices
- 9. Church's thesis
- 10. Word problems
- 11. Undecidable theories
- 12. Relative recursion
- 13. The arithmetical hierarchy
- 14. recursively enumerable relations
- 15. Degrees
- 16. Evaluation of degrees
- 17. Large RE sets
- 18. Functions of reals
- 19. The analytical hierarchy
- 20. The projective hierarchy
- Suggestions for further reading
- Index.
