Degrees of Unsolvability
Local and Global Theory
£110.99
Part of Perspectives in Logic
- Author: Manuel Lerman, University of Connecticut
- Date Published: April 2017
- availability: Available
- format: Hardback
- isbn: 9781107168138
£
110.99
Hardback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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 eleventh publication in the Perspectives in Logic series, Manuel Lerman presents a systematic study of the interaction between local and global degree theory. He introduces the reader to the fascinating combinatorial methods of recursion theory while simultaneously showing how to use these methods to prove global theorems about degrees. The intended reader will have already taken a graduate-level course in recursion theory, but this book will also be accessible to those with some background in mathematical logic and a feeling for computability. It will prove a key reference to enable readers to easily locate facts about degrees and it will direct them to further results.
Read more- Introduces the reader to the methods of recursion theory and shows how to prove global theorems about degrees
- Contains a rich selection of exercises, hints and references
- Accessible to those with some background in mathematical logic and a feeling for computability
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: April 2017
- format: Hardback
- isbn: 9781107168138
- length: 321 pages
- dimensions: 242 x 165 x 25 mm
- weight: 0.68kg
- contains: 42 b/w illus.
- availability: Available
Table of Contents
Introduction
Part I. The Structure of the Degrees:
1. Recursive functions
2. Embeddings and extensions of embeddings in the degrees
3. The jump operator
4. High/low hierarchies
Part II. Countable Ideals of Degrees:
5. Minimal degrees
6. Finite distributive lattices
7. Finite lattices
8. Countable usls
Part III. Initial Segments ofD and the Jump Operator:
9. Minimal degrees and high/low hierarchies
10. Jumps of minimal degrees
11. Bounding minimal degrees with recursively enumerable degrees
12. Initial segments of D [0,0']
Appendix A. Coding into structures and theories
Appendix B. lattice tables and representation theorems
References
Notation index
Subject index.
Related Books
related journals
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×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.
×