Bounding computably enumerable degrees in the Ershov hierarchy

Angsheng Li, Guohua Wu, Yue Yang. Bounding computably enumerable degrees in the Ershov hierarchy. Annals of Pure and Applied Logic, 141(1-2):79-88, 2006. [doi]

@article{LiWY06:2,
  title = {Bounding computably enumerable degrees in the Ershov hierarchy},
  author = {Angsheng Li and Guohua Wu and Yue Yang},
  year = {2006},
  doi = {10.1016/j.apal.2005.10.004},
  url = {http://dx.doi.org/10.1016/j.apal.2005.10.004},
  researchr = {https://researchr.org/publication/LiWY06%3A2},
  cites = {0},
  citedby = {0},
  journal = {Annals of Pure and Applied Logic},
  volume = {141},
  number = {1-2},
  pages = {79-88},
}