Switch to: References

Citations of:

Quasicreative Sets

J. R. Shoenfield

Journal of Symbolic Logic 25 (2):166-166 (1960)

Add citations

You must login to add citations.

Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.details We consider the computably enumerable sets under the relation of Q-reducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, Q, under this reducibility with the more familiar structure of the c.e. Turing degrees. In our final section, we use coding methods to show that the elementary theory of RQ, Q is undecidable. Download Export citation Bookmark 13 citations
Structural properties of Q -degrees of n-c. e. sets.Marat M. Arslanov, Ilnur I. Batyrshin & R. Sh Omanadze - 2008 - Annals of Pure and Applied Logic 156 (1):13-20.details 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. Download Export citation Bookmark 2 citations

1