Relative enumerability in the difference hierarchy
From MaRDI portal
Publication:4212911
DOI10.2307/2586839zbMath0911.03021MaRDI 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
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
03D55: Hierarchies of computability and definability
Related Items
On a problem of Ishmukhametov, There are no maximal low d.c.e. degrees, Isolation in the CEA hierarchy, Nonisolated degrees and the jump operator, A survey of results on the d.c.e. and \(n\)-c.e. degrees, Elementary theories and structural properties of d-c.e. and n-c.e. degrees, Relative enumerability in Ershov's hierarchy, A Survey of Results on the d-c.e. and n-c.e. Degrees
Cites Work