2 search results - page 1 / 1 » Thin Maximal Antichains in the Turing Degrees |
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study existence problems of maximal antichains in the Turing degrees. In particular, we give a characterization of the existence of a thin Π1 1 maximal antichains in ...
JSYML
2002
13 years 4 months ago
2002
A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and no c.e. degree strictly above it is contiguous. We show that there are infinitely many ...