Realizing Computably Enumerable Degrees in Separating Classes
Logic
2020-08-25 v1
Abstract
We investigate what collections of c.e.\ Turing degrees can be realised as the collection of elements of a separating class of c.e.\ degree. We show that for every c.e.\ degree , the collection can be thus realized. We also rule out several attempts at constructing separating classes realizing a unique c.e.\ degree. For example, we show that there is no \emph{super-maximal} pair: disjoint c.e.\ sets and whose separating class is infinite, but every separator of c.e.\ degree is a finite variant of either or .
Keywords
Cite
@article{arxiv.2008.10127,
title = {Realizing Computably Enumerable Degrees in Separating Classes},
author = {Peter Cholak and Rod Downey and Noam Greenberg and Daniel Turetsky},
journal= {arXiv preprint arXiv:2008.10127},
year = {2020}
}