We show that there exists a set A such that A has quasi-minimal enumeration degree, and there are uncountably many sets B such that A is enumeration reducible to B and B has minimal Turing degree. Answering a related question raised by Solon, we also show that there exists a nontotal enumeration degree which is not e-hyperimmune
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibilit...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
We show that there exists a set A such that A has quasi-minimal enumeration degree, and there are un...
Abstract. A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration re...
The natural embedding of the Turing degrees into the enumeration degrees preserves the jump operatio...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
Abstract. We show that every nonzero ∆ 0 2 e-degree bounds a minimal pair. On the other hand, there ...
Given a computably enumerable set W, there is a Turing degree which is the least jump of any set in ...
Abstract. This paper extends Post’s programme to finite levels of the Ershov hierarchy of ∆2 sets. O...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
The paper show that there exist sets A such that the e-degree of A isquasi-minimal and the e...
We show that there exists a minimal (Turing) degree b<0' such that for all non-zero c.e. degrees a, ...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibilit...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
We show that there exists a set A such that A has quasi-minimal enumeration degree, and there are un...
Abstract. A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration re...
The natural embedding of the Turing degrees into the enumeration degrees preserves the jump operatio...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
Abstract. We show that every nonzero ∆ 0 2 e-degree bounds a minimal pair. On the other hand, there ...
Given a computably enumerable set W, there is a Turing degree which is the least jump of any set in ...
Abstract. This paper extends Post’s programme to finite levels of the Ershov hierarchy of ∆2 sets. O...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
The paper show that there exist sets A such that the e-degree of A isquasi-minimal and the e...
We show that there exists a minimal (Turing) degree b<0' such that for all non-zero c.e. degrees a, ...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
© 2014, Pleiades Publishing, Ltd. We study the distinctions between Q-reducibility and m-reducibilit...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
DOI
Add to ORKG