14 search results - page 1 / 3 » Bounding nonsplitting enumeration degrees |
JSYML
2007
13 years 5 months ago
2007
We show that every nonzero Σ0 2 enumeration degree bounds a nonsplitting nonzero enumeration degree.
APAL
2011
13 years 11 days ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
CPC
2002
13 years 5 months ago
2002
APAL
2006
13 years 5 months ago
2006
Abstract. We show that the identity bounded Turing degrees of computably enumerable sets are not dense.
APAL
2010
13 years 5 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...