An Interval of Computably Enumerable Isolating Degrees

Mathematical Logic Quarterly 45 (1):59-72 (1999)
  Copy   BIBTEX

Abstract

We construct computably enumerable degrees a < b such that all computably enumerable degrees c with a < c < b isolate some d. c. e. degree d

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,070

External links

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

Through your library

Similar books and articles

Complementing cappable degrees in the difference hierarchy.Rod Downey, Angsheng Li & Guohua Wu - 2004 - Annals of Pure and Applied Logic 125 (1-3):101-118.
A Splitting with Infimum in the d-c. e. Degrees.Q. Lei, L. Hong & D. Decheng - 2000 - Mathematical Logic Quarterly 46 (1):53-76.
Isolation and the Jump Operator.Guohua Wu - 2001 - Mathematical Logic Quarterly 47 (4):525-534.
Classes bounded by incomplete sets.Kejia Ho & Frank Stephan - 2002 - Annals of Pure and Applied Logic 116 (1-3):273-295.
Bounding cappable degrees.Angsheng Li - 2000 - Archive for Mathematical Logic 39 (5):311-352.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
Relative enumerability and 1-genericity.Wei Wang - 2011 - Journal of Symbolic Logic 76 (3):897 - 913.
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.

Analytics

Added to PP
2013-12-01

Downloads
20 (#760,815)

6 months
9 (#436,446)

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

The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.

Add more references