Bounding computably enumerable degrees in the Ershov hierarchy
From MaRDI portal
Publication:2498901
DOI10.1016/j.apal.2005.10.004zbMath1100.03032MaRDI QIDQ2498901
Yue Yang, Guohua Wu, Ang Sheng Li
Publication date: 16 August 2006
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2005.10.004
recursively enumerable sets; Turing degrees; Ershov hierarchy; degrees of d.r.e. sets; differences of r.e. sets; high Turing degrees
03D25: Recursively (computably) enumerable sets and degrees
03D28: Other Turing degree structures
03D55: Hierarchies of computability and definability