Hierarchy of Computably Enumerable Degrees II
New Zealand Journal of Mathematics · 2021
DOI: 10.53733/133 ↗At a glance
Journal article in New Zealand Journal of Mathematics, 2021. Written by Rod Downey and 2 co-authors.
Abstract (original language)
A transfinite hierarchy of Turing degrees of c.e.\ sets has been used to calibrate the dynamics of families of constructions in computability theory, and yields natural definability results. We review the main results of the area, and discuss splittings of c.e.\ degrees, and finding maximal degrees in upper cones.
Cite
APA
Downey, R., Greenberg, N., & Hammatt, E. (2021). Hierarchy of Computably Enumerable Degrees II. New Zealand Journal of Mathematics. https://doi.org/10.53733/133
Vancouver
Downey R, Greenberg N, Hammatt E. Hierarchy of Computably Enumerable Degrees II. New Zealand Journal of Mathematics. 2021. doi:10.53733/133
BibTeX
@article{Downey2021,
author = {Downey, Rod and Greenberg, Noam and Hammatt, Ellen},
title = {Hierarchy of Computably Enumerable Degrees II},
journal = {New Zealand Journal of Mathematics},
year = {2021},
doi = {10.53733/133}
}
EUVIMED