AbstractIt is shown that Th(H1)≠Th(Hn) holds for every n>1, where Hm is the upper semi-lattice of all highm computably enumerable (c.e.) degrees for m>0, giving a first elementary difference among the highness hierarchies of the c.e. degrees
This thesis is concerned with three special properties of Turing degree structure and the Ershov hie...
AbstractA completely mitotic computably enumerable degree is a c.e. degree in which every c.e. set i...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
AbstractLachlan observed that any nonzero d.c.e. degree bounds a nonzero c.e. degree. In this paper,...
© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the ...
We consider the set of jumps below a Turing degree, given by JB(a) = {x(1) : x <= a}, with a focus o...
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
AbstractWe consider the relationship of the lattice-theoretic properties and the jump-theoretic prop...
We investigate the relationship of (jumps of) the degrees of split-tings of a computably enumerable ...
this paper. Clearly the most remarkable result relating the jump operator to the ordering of degrees...
We explore various areas of computability theory, ranging from applications in computable structure ...
AbstractThis paper continues the project, initiated in (Arslanov, Cooper and Kalimullin 2003) [3], o...
AbstractLet D be the set of all (Turing) degrees, < the usual partial ordering of D and j the (Turin...
Anderson and Csima (Notre Dame J Form Log 55(2):245–264, 2014) defined a jump operator, the bounded ...
This thesis is concerned with three special properties of Turing degree structure and the Ershov hie...
AbstractA completely mitotic computably enumerable degree is a c.e. degree in which every c.e. set i...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
AbstractLachlan observed that any nonzero d.c.e. degree bounds a nonzero c.e. degree. In this paper,...
© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the ...
We consider the set of jumps below a Turing degree, given by JB(a) = {x(1) : x <= a}, with a focus o...
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
AbstractWe consider the relationship of the lattice-theoretic properties and the jump-theoretic prop...
We investigate the relationship of (jumps of) the degrees of split-tings of a computably enumerable ...
this paper. Clearly the most remarkable result relating the jump operator to the ordering of degrees...
We explore various areas of computability theory, ranging from applications in computable structure ...
AbstractThis paper continues the project, initiated in (Arslanov, Cooper and Kalimullin 2003) [3], o...
AbstractLet D be the set of all (Turing) degrees, < the usual partial ordering of D and j the (Turin...
Anderson and Csima (Notre Dame J Form Log 55(2):245–264, 2014) defined a jump operator, the bounded ...
This thesis is concerned with three special properties of Turing degree structure and the Ershov hie...
AbstractA completely mitotic computably enumerable degree is a c.e. degree in which every c.e. set i...
In this paper we investigate questions about the definability of classes of n-computably enumerable ...
DOI
Add to ORKG