Abstract
In these lectures we survey some of the most important results and the fundamental methods concerning degrees of recursively enumerable (r. e.) sets. We begin §1 with Post's simple sets and a recent elegant generalization of the recursion theorem. In § 2 we give the finite injury priority method, the solution of Post's problem, and the Sacks splitting theorem, In § 3 the infinite injury method is introduced and applied to prove the thickness lemma and the Sacks density theorem. In §4 and §5 we develop the minimal pair method for embedding distributive lattices in the r. e. degrees by maps preserving infimums as well as Superscript>remums. In §6 we present the non-diamond theorem which asserts that such embeddings cannot always preserve greatest and least elements. For background reading we suggest Rogers [17], Shoenfield [23], and Soare [25].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.