Structural properties of Q -degrees of n-c. e. sets

Annals of Pure and Applied Logic 156 (1):13-20 (2008)
  Copy   BIBTEX

Abstract

In this paper we study structural properties of n-c. e. Q-degrees. Two theorems contain results on the distribution of incomparable Q-degrees. In another theorem we prove that every incomplete Q-degree forms a minimal pair in the c. e. degrees with a Q-degree. In a further theorem it is proved that there exists a c. e. Q-degree that is not half of a minimal pair in the c. e. Q-degrees

Links

PhilArchive



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

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

Infima in the d.r.e. degrees.D. Kaddah - 1993 - Annals of Pure and Applied Logic 62 (3):207-263.
Non‐isolated quasi‐degrees.Ilnur I. Batyrshin - 2009 - Mathematical Logic Quarterly 55 (6):587-597.
Splittings of 0' into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
C-Quasi-Minimal enumeration degrees below c'.Boris Solon - 2006 - Archive for Mathematical Logic 45 (4):505-517.
Density results in the Δ 2 0 e-degrees.Marat M. Arslanov, Iskander Sh Kalimullin & Andrea Sorbi - 2001 - Archive for Mathematical Logic 40 (8):597-614.
A Splitting with Infimum in the d-c. e. Degrees.Q. Lei, L. Hong & D. Decheng - 2000 - Mathematical Logic Quarterly 46 (1):53-76.
There is no low maximal d. c. e. degree– Corrigendum.M. Arslanov & S. B. Cooper - 2004 - Mathematical Logic Quarterly 50 (6):628.
Some remarks on Schanuel's conjecture.Ricardo Bianconi - 2001 - Annals of Pure and Applied Logic 108 (1-3):15-18.

Analytics

Added to PP
2013-12-26

Downloads
31 (#533,234)

6 months
13 (#219,908)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

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.
Weakly semirecursive sets.Carl G. Jockusch & James C. Owings - 1990 - Journal of Symbolic Logic 55 (2):637-644.
Quasicreative Sets.J. R. Shoenfield - 1960 - Journal of Symbolic Logic 25 (2):166-166.

Add more references