On Downey's conjecture

Journal of Symbolic Logic 75 (2):401-441 (2010)
Abstract
We prove that the degree structures of the d.c.e. and the 3-c.e. Turing degrees are not elementarily equivalent, thus refuting a conjecture of Downey. More specifically, we show that the following statement fails in the former but holds in the latter structure: There are degrees f > e > d > 0 such that any degree u ≤ f is either comparable with both e and d, or incomparable with both
Keywords d.c.e. degrees   n-c.e. degrees   Downey's conjecture
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
Timothy Cleveland (1997). A Refutation of Pure Conjecture. Journal for General Philosophy of Science 28 (1):55-81.
Masanori Itai (1991). On the Strong Martin Conjecture. Journal of Symbolic Logic 56 (3):862-875.
Analytics

Monthly downloads

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

Added to index

2010-09-12

Total downloads

0

Recent downloads (6 months)

0

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.