Turing Degrees in Refinements of the Arithmetical Hierarchy (relativized to ∅
n,
n < ω), which are known to be proper. Our main result is finding a least new (i.
e Turing and enumeration jumps in the Ershov hierarchyIn the article, we study the behaviour of enumeration jumps of sets of low
e-degrees in the
Ershov Splitting and nonsplitting in the Σ2 0 enumeration degrees of the enumeration degrees, for which the
Ershov hierarchy provides an informative setting. The main results below
Relative enumerability in Ershov's hierarchyGeneralizations to various levels of
Ershov's hierarchy of the relationship between
n Structural properties of Q-degrees of n-c. e. setsIn this paper we study structural properties of
n-c. e. Q-degrees. Two theorems contain results
Structural properties of Q-degrees of n-c. e. setsIn this paper we study structural properties of
n-c. e. Q-degrees. Two theorems contain results
Turing and enumeration jumps in the Ershov hierarchyIn the article, we study the behaviour of enumeration jumps of sets of low
e-degrees in the
Ershov