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)
DOI 10.2178/jsl/1268917488
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: 63,247
Through your library

References found in this work BETA

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

A Δ02 Set with Barely Σ02 Degree.Rod Downey, Geoffrey Laforte & Steffen Lempp - 1999 - Journal of Symbolic Logic 64 (4):1700 - 1718.
A Refutation of Pure Conjecture.Timothy Cleveland - 1997 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 28 (1):55-81.
On the Strong Martin Conjecture.Masanori Itai - 1991 - Journal of Symbolic Logic 56 (3):862-875.
The Ethics of Reasoning From Conjecture.Micah Schwartzman - 2012 - Journal of Moral Philosophy 9 (4):521-544.
The Art of Conjecture.Bertrand de Jouvenel - 1967 - New York: Basic Books.
A Strategy for Assessing Closure.Peter Murphy - 2006 - Erkenntnis 65 (3):365 - 383.
Truth and Meaning.Robert C. Cummins - 2002 - In Joseph Keim-Campbell, Michael O'Rourke & David Shier (eds.), Meaning and Truth: Investigations in Philosophical Semantics. Seven Bridges Press. pp. 175-197.

Analytics

Added to PP index
2010-09-12

Total views
2 ( #1,408,721 of 2,448,510 )

Recent downloads (6 months)
1 ( #449,843 of 2,448,510 )

How can I increase my downloads?

Downloads

My notes