Skip to content
Register Sign in Wishlist

Higher Recursion Theory


Part of Perspectives in Logic

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

£ 112.00

Add to cart Add to wishlist

Other available formats:

Looking for an inspection copy?

This title is not currently available on inspection

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. This volume, the second publication in the Perspectives in Logic series, is an almost self-contained introduction to higher recursion theory, in which the reader is only assumed to know the basics of classical recursion theory. The book is divided into four parts: hyperarithmetic sets, metarecursion, α-recursion, and E-recursion. This text is essential reading for all researchers in the field.

    • The book is virtually self-contained and assumes only a basic knowledge of classical recursion theory
    • Essential reading for all researchers in the subject
    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: 9781107168435
    • dimensions: 240 x 163 x 27 mm
    • weight: 0.73kg
    • availability: Available
  • Table of Contents

    Part I. Hyperarithmetic Sets:
    1. Constructive ordinals and \prod_1^1 sets
    2. The hyperarithmetic hierarchy
    3. \Sigma_1^1 predicates of reals
    4. Measure and forcing
    Part II. Metarecursion:
    5. Metarecursive enumerability
    6. Hyperregularity and priority
    Part III. α-Recursion:
    7. Admissibility and regularity
    8. Priority arguments
    9. Splitting, density and beyond
    Part IV. E-Recursion:
    10. E-closed structures
    11. Forcing computations to converge
    12. Selection and k-sections
    13. E-recursively enumerable degrees
    Subject index.

  • Author

    Gerald E. Sacks, Harvard University, Massachusetts
    Gerald E. Sacks works in the Department of Mathematics at Harvard University, Massachusetts and at the Massachusetts Institute of Technology.

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.