After showing the downwards density of nonhemimaximal degrees, Downey and Stob continued to prove that the existence of a low₂, but not low, nonhemimaximal degree, and their proof uses the fact that incomplete m-topped degrees are low₂ but not low. As commented in their paper, the construction of such a nonhemimaximal degree is actually a primitive 0''' argument. In this paper, we give another construction of such degrees, which is a standard 0''-argument, much simpler than Downey and Stob's construction mentioned above
In this paper we prove the following theorem: For every notation of a constructive ordinal there exi...
© 2015, Pleiades Publishing, Ltd. In this paper we study exact d.c.e. degrees, the class of d.c.e. d...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
We show that there exist downwards properly \Sigma^0_2 (in fact noncuppable) e-degrees that are not...
This thesis is concerned with three special properties of Turing degree structure and the Ershov hie...
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
Abstract. We prove that the existential theory of the Turing degrees, in the language with Turing re...
AbstractThis paper gives two definability results in the local theory of the ω-enumeration degrees. ...
This paper continues the project, initiated in (Arslanov, Cooper and Kalimullin 2003) [3], of descri...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
We prove that each ∑02 set which is hypersimple relative to 0′ is noncuppable in the structure of th...
Abstract. We show that every generalized high Turing degree is the join of two minimal degrees. 1
We prove the following three theorems on the enumeration degrees of # 0 2 sets. Theorem A: There exi...
In this paper we prove the following theorem: For every notation of a constructive ordinal there exi...
© 2015, Pleiades Publishing, Ltd. In this paper we study exact d.c.e. degrees, the class of d.c.e. d...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...
We show that there exist downwards properly \Sigma^0_2 (in fact noncuppable) e-degrees that are not...
This thesis is concerned with three special properties of Turing degree structure and the Ershov hie...
Abstract. We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a&g...
We argue for the existence of structures with the spectrum {x : x ≥ a} of degrees, where a is an arb...
Abstract. We prove that the existential theory of the Turing degrees, in the language with Turing re...
AbstractThis paper gives two definability results in the local theory of the ω-enumeration degrees. ...
This paper continues the project, initiated in (Arslanov, Cooper and Kalimullin 2003) [3], of descri...
AbstractWe prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: The...
This paper continues the project, initiated in [ACK], of describing general conditions under which r...
We prove that each ∑02 set which is hypersimple relative to 0′ is noncuppable in the structure of th...
Abstract. We show that every generalized high Turing degree is the join of two minimal degrees. 1
We prove the following three theorems on the enumeration degrees of # 0 2 sets. Theorem A: There exi...
In this paper we prove the following theorem: For every notation of a constructive ordinal there exi...
© 2015, Pleiades Publishing, Ltd. In this paper we study exact d.c.e. degrees, the class of d.c.e. d...
This thesis is concerned with various degree structures below 0', varying from Turing degrees to tr...