Non‐isolated quasi‐degrees

Mathematical Logic Quarterly 55 (6):587-597 (2009)
  Copy   BIBTEX

Abstract

We show that non-isolated from below 2-c.e. Q -degrees are dense in the structure of c.e. Q -degrees. We construct a 2-c.e. Q -degree, which can't be isolated from below not only by c.e. Q -degrees, but by any Q -degree. We also prove that below any c.e. Q -degree there is a 2-c.e. Q -degree, which is non-isolated from below and from above

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

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

The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
Maximal contiguous degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
Isolation in the CEA hierarchy.Geoffrey LaForte - 2005 - Archive for Mathematical Logic 44 (2):227-244.
On the definable ideal generated by the plus cupping c.e. degrees.Wei Wang & Decheng Ding - 2007 - Archive for Mathematical Logic 46 (3-4):321-346.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
Randomness, Lowness and Degrees.George Barmpalias, Andrew E. M. Lewis & Mariya Soskova - 2008 - Journal of Symbolic Logic 73 (2):559 - 577.
On a problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
A superhigh diamond in the c.e. tt-degrees.Douglas Cenzer, Johanna Ny Franklin, Jiang Liu & Guohua Wu - 2011 - Archive for Mathematical Logic 50 (1-2):33-44.
On the bounded quasi‐degrees of c.e. sets.Roland Sh Omanadze - 2013 - Mathematical Logic Quarterly 59 (3):238-246.
The distribution of the generic recursively enumerable degrees.Ding Decheng - 1992 - Archive for Mathematical Logic 32 (2):113-135.
Bounding cappable degrees.Angsheng Li - 2000 - Archive for Mathematical Logic 39 (5):311-352.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.

Analytics

Added to PP
2013-12-01

Downloads
16 (#774,541)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Some structural properties of quasi-degrees.Roland Sh Omanadze - 2018 - Logic Journal of the IGPL 26 (1):191-201.

Add more citations

References found in this work

Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.

Add more references