There Are No Maximal Low D.C.E.~Degrees

Notre Dame Journal of Formal Logic 45 (3):147-159 (2004)
We prove that there is no maximal low d.c.e degree
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1305/ndjfl/1099080209
 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: 20,898
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.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
C. T. Chong & Liang Yu (2007). Maximal Chains in the Turing Degrees. Journal of Symbolic Logic 72 (4):1219 - 1227.
Jeffrey S. Carroll (1990). Maximal R.E. Equivalence Relations. Journal of Symbolic Logic 55 (3):1048-1058.
Guohua Wu (2006). Jump Operator and Yates Degrees. Journal of Symbolic Logic 71 (1):252 - 264.
Theodore A. Slaman (1986). On the Kleene Degrees of Π11 Sets. Journal of Symbolic Logic 51 (2):352 - 359.
Anne Leggett (1978). Α-Degrees of Maximal Α-R.E. Sets. Journal of Symbolic Logic 43 (3):456-474.
Guohua Wu (2004). Bi-Isolation in the D.C.E. Degrees. Journal of Symbolic Logic 69 (2):409 - 420.

Monthly downloads

Added to index


Total downloads

14 ( #255,981 of 1,907,383 )

Recent downloads (6 months)

6 ( #128,488 of 1,907,383 )

How can I increase my downloads?

My notes
Sign in to use this feature

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