English

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 Π10\Pi^0_1 class of c.e.\ degree. We show that for every c.e.\ degree c\mathbf{c}, the collection {c,0}\{\mathbf{c}, \mathbf{0}'\} 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 AA and BB whose separating class is infinite, but every separator of c.e.\ degree is a finite variant of either AA or B\overline{B}.

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}
}