Totally < omega:::omega::: Computably Enumerable and ::::m::::-topped Degrees

Rod Downey, Noam Greenberg. Totally < omega:::omega::: Computably Enumerable and ::::m::::-topped Degrees. In Jin-yi Cai, S. Barry Cooper, Angsheng Li, editors, Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings. Volume 3959 of Lecture Notes in Computer Science, pages 46-60, Springer, 2006. [doi]

@inproceedings{DowneyG06:0,
  title = {Totally < omega:::omega::: Computably Enumerable and ::::m::::-topped Degrees},
  author = {Rod Downey and Noam Greenberg},
  year = {2006},
  doi = {10.1007/11750321_3},
  url = {http://dx.doi.org/10.1007/11750321_3},
  researchr = {https://researchr.org/publication/DowneyG06%3A0},
  cites = {0},
  citedby = {0},
  pages = {46-60},
  booktitle = {Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings},
  editor = {Jin-yi Cai and S. Barry Cooper and Angsheng Li},
  volume = {3959},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-34021-1},
}