The Isolated D. R. E. Degrees are Dense in the R. E. Degrees

Mathematical Logic Quarterly 42 (1):83-103 (1996)
  Copy   BIBTEX

Abstract

In the present paper we prove that the isolated differences of r. e. degrees are dense in the r. e. degrees

Categories

Keywords

Reprint years

DOI

10.1002/malq.19960420108

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,164

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

Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.Klaus Ambos-Spies & Ding Decheng - 1994 - Mathematical Logic Quarterly 40 (3):287-317.
Non‐isolated quasi‐degrees.Ilnur I. Batyrshin - 2009 - Mathematical Logic Quarterly 55 (6):587-597.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
The discontinuity of splitting in the recursively enumerable degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
The distribution of the generic recursively enumerable degrees.Ding Decheng - 1992 - Archive for Mathematical Logic 32 (2):113-135.
Infima in the Recursively Enumerable Weak Truth Table Degrees.Rich Blaylock, Rod Downey & Steffen Lempp - 1997 - Notre Dame Journal of Formal Logic 38 (3):406-418.
On the r.e. predecessors of d.r.e. degrees.Shamil Ishmukhametov - 1999 - Archive for Mathematical Logic 38 (6):373-386.
Recursively enumerable m- and tt-degrees. I: The quantity of m- degrees.R. G. Downey - 1989 - Journal of Symbolic Logic 54 (2):553-567.
Review: C. E. M. Yates, John N. Crossley, Recursively Enumerable Degrees and the Degrees Less Than $0^{(1)}$. [REVIEW]S. K. Thomason - 1970 - Journal of Symbolic Logic 35 (4):589-589.
Maximal contiguous degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices.Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman - 1996 - Journal of Symbolic Logic 61 (3):880-905.
called degrees. Post was particularly interested in computability from sets which are par-tially generated by a computer, namely, those for which the elements of the set can be enumerated by a computer. These sets are called (recursively) enu-merable, as are their degrees. He showed [20] that the enumerable degrees. [REVIEW]J. Knight, A. Kucera & R. Shore - 1995 - Bulletin of Symbolic Logic 1 (2).

Analytics

Added to PP
2013-12-01

Downloads
39 (#386,963)

6 months
6 (#417,196)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Isolation and the high/low hierarchy.Shamil Ishmukhametov & Guohua Wu - 2002 - Archive for Mathematical Logic 41 (3):259-266.
Isolation and lattice embeddings.Guohua Wu - 2002 - Journal of Symbolic Logic 67 (3):1055-1064.
On the r.e. predecessors of d.r.e. degrees.Shamil Ishmukhametov - 1999 - Archive for Mathematical Logic 38 (6):373-386.
Nonisolated degrees and the jump operator.Guohua Wu - 2002 - Annals of Pure and Applied Logic 117 (1-3):209-221.

View all 13 citations / Add more citations

References found in this work

No references found.

Add more references