Realizing Computably Enumerable Degrees in Separating Classes

Authors Peter A. Cholak, Rodney G. Downey, Noam Greenberg, Daniel Turetsky

Publication date 23 August 2020

Abstract: We investigate what collections of c.e. Turing degrees can be realised as the collection of elements of a separating

P i_{1}^{0}

class of c.e. degree. We show that for every c.e. degree

m a t h b f c

, the collection

m a t h b f c, m a t h b f 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

A

and

B

whose separating class is infinite, but every separator of c.e. degree is a finite variant of either

A

or

o v e r l i n e B

.

This page was built for publication: Realizing Computably Enumerable Degrees in Separating Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6347577)