Complementing cappable degrees in the difference hierarchy

, &
Annals of Pure and Applied Logic 125 (1-3):101-118 (2004)
  Copy   BIBTEX

Abstract

We prove that for any computably enumerable degree c, if it is cappable in the computably enumerable degrees, then there is a d.c.e. degree d such that c d = 0′ and c ∩ d = 0. Consequently, a computably enumerable degree is cappable if and only if it can be complemented by a nonzero d.c.e. degree. This gives a new characterization of the cappable degrees

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2003.10.002

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The computably enumerable degrees are locally non-cappable.Matthew B. Giorgi - 2004 - Archive for Mathematical Logic 43 (1):121-139.
Bounding cappable degrees.Angsheng Li - 2000 - Archive for Mathematical Logic 39 (5):311-352.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
Quasi-complements of the cappable degrees.Guohua Wu - 2004 - Mathematical Logic Quarterly 50 (2):189.
Bounding computably enumerable degrees in the Ershov hierarchy.Angsheng Li, Guohua Wu & Yue Yang - 2006 - Annals of Pure and Applied Logic 141 (1):79-88.
On a conjecture of Lempp.Angsheng Li - 2000 - Archive for Mathematical Logic 39 (4):281-309.
A Splitting with Infimum in the d-c. e. Degrees.Q. Lei, L. Hong & D. Decheng - 2000 - Mathematical Logic Quarterly 46 (1):53-76.
The computably enumerable degrees are locally non-cappable.Matthew B. Giorgi - 2003 - Archive for Mathematical Logic -1 (1):1-1.
On a problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
1-Generic splittings of computably enumerable degrees.Guohua Wu - 2006 - Annals of Pure and Applied Logic 138 (1):211-219.

Analytics

Added to PP
2014-01-16

Downloads
16 (#227,957)

6 months
5 (#1,552,255)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
The d.r.e. degrees are not dense.S. Cooper, Leo Harrington, Alistair Lachlan, Steffen Lempp & Robert Soare - 1991 - Annals of Pure and Applied Logic 55 (2):125-151.
Bounding minimal pairs.A. H. Lachlan - 1979 - Journal of Symbolic Logic 44 (4):626-642.
Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.

View all 15 references / Add more references