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

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2008.06.003

Links

PhilArchive



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

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

Cappable recursively enumerable degrees and Post's program.Klaus Ambos-Spies & André Nies - 1992 - Archive for Mathematical Logic 32 (1):51-56.
The degrees of conditional problems.Su Gao - 1994 - Journal of Symbolic Logic 59 (1):166-181.
Q1-degrees of c.e. sets.R. Sh Omanadze & Irakli O. Chitaia - 2012 - Archive for Mathematical Logic 51 (5-6):503-515.
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
On the bounded quasi‐degrees of c.e. sets.Roland Sh Omanadze - 2013 - Mathematical Logic Quarterly 59 (3):238-246.
On a problem of Ishmukhametov.Chengling Fang, Guohua Wu & Mars Yamaleev - 2013 - Archive for Mathematical Logic 52 (7-8):733-741.
Non‐isolated quasi‐degrees.Ilnur I. Batyrshin - 2009 - Mathematical Logic Quarterly 55 (6):587-597.
Definability, automorphisms, and dynamic properties of computably enumerable sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
Kleene index sets and functional m-degrees.Jeanleah Mohrherr - 1983 - Journal of Symbolic Logic 48 (3):829-840.
Generalized cohesiveness.Tamara Hummel & Carl G. Jockusch - 1999 - Journal of Symbolic Logic 64 (2):489-516.
A computably enumerable vector space with the strong antibasis property.L. R. Galminas - 2000 - Archive for Mathematical Logic 39 (8):605-629.
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).
Differences between Resource Bounded Degree Structures.Theodore A. Slaman & Michael~E. Mytilinaios - 2003 - Notre Dame Journal of Formal Logic 44 (1):1-12.

Analytics

Added to PP
2013-12-26

Downloads
29 (#538,668)

6 months
12 (#202,587)

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