Skip to content
Register Sign in Wishlist

Recursion Theory

$120.00 (C)

Part of Lecture Notes in Logic

  • Date Published: March 2017
  • availability: Available
  • format: Hardback
  • isbn: 9781107168084

$ 120.00 (C)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • Since 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
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: March 2017
    • format: Hardback
    • isbn: 9781107168084
    • dimensions: 235 x 156 x 11 mm
    • weight: 0.29kg
    • availability: Available
  • 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

  • Author

    Joseph R. Shoenfield, Duke University, North Carolina
    Joseph R. Shoenfield works in the Department of Mathematics at Duke University, North Carolina.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.