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
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 53,688
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

Prime Models of Computably Enumerable Degree.Rachel Epstein - 2008 - Journal of Symbolic Logic 73 (4):1373-1388.
Complementation in the Turing Degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
Maximal Contiguous Degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
Minimal Pairs and High Recursively Enumerable Degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.

Analytics

Added to PP index
2009-01-28

Total views
26 ( #384,196 of 2,349,561 )

Recent downloads (6 months)
1 ( #510,673 of 2,349,561 )

How can I increase my downloads?

Downloads

My notes