a > ...">

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)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,493
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Analytics

Monthly downloads

Sorry, there are not enough data points to plot this chart.

Added to index

2009-01-28

Total downloads

3 ( #299,402 of 1,102,513 )

Recent downloads (6 months)

3 ( #121,593 of 1,102,513 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.