Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy
From MaRDI portal
Publication:646830
DOI10.3103/S1066369X10120066zbMath1225.03052MaRDI QIDQ646830
Publication date: 18 November 2011
Published in: Russian Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s1066369x10120066
03D25: Recursively (computably) enumerable sets and degrees
03D28: Other Turing degree structures
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
03D55: Hierarchies of computability and definability
Related Items
Turing computability: structural theory, Elementary theories and structural properties of d-c.e. and n-c.e. degrees, A Survey of Results on the d-c.e. and n-c.e. Degrees
Cites Work