On a problem of Cooper and Epstein

Journal of Symbolic Logic 68 (1):52-64 (2003)
Abstract
In "Bounding minimal degrees by computably enumerable degrees" by A. Li and D. Yang, (this Journal, [1998]), the authors prove that there exist non-computable computably enumerable degrees c > a > 0 such that any minimal degree m being below c is also below a. We analyze the proof of their result and show that the proof contains a mistake. Instead we give a proof for the opposite result
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1045861506
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,786
Through your library
References found in this work BETA
Complementing Below Recursively Enumerable Degrees.S. Barry Cooper & Richard L. Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):15-32.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
13 ( #402,369 of 2,231,535 )

Recent downloads (6 months)
1 ( #445,507 of 2,231,535 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature