Relative enumerability in the difference hierarchy
From MaRDI portal
Publication:4212911
DOI10.2307/2586839zbMath0911.03021OpenAlexW2169764068MaRDI QIDQ4212911
Theodore A. Slaman, Geoffrey L. LaForte, Marat M. Arslanov
Publication date: 27 April 1999
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2586839
Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)
Related Items (12)
Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ On a problem of Ishmukhametov ⋮ Normalizing notations in the Ershov hierarchy ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees ⋮ \textit{CEA} operators and the ershov hierarchy ⋮ Weak density and nondensity among transfinite levels of the Ershov hierarchy ⋮ Isolation in the CEA hierarchy ⋮ A survey of results on the d.c.e. and \(n\)-c.e. degrees ⋮ There are no maximal low d.c.e. degrees ⋮ Turing computability: structural theory ⋮ Relative enumerability in Ershov's hierarchy ⋮ Nonisolated degrees and the jump operator
Cites Work
This page was built for publication: Relative enumerability in the difference hierarchy
