On cototality and the skip operator in the enumeration degrees

A set A ⊆ ω is cototal if it is enumeration reducible to its complement, A. The skip of A is the uniform upper bound of the complements of all sets enumeration reducible to A. These are closely connected: A has cototal degree if and only if it is enumeration reducible to its skip. We study cototality and related properties, using the skip operator as a tool in our investigation. We give many examples of classes of enumeration degrees that either guarantee or prohibit cototality. We also study the skip for its own sake, noting that it has many of the nice properties of the Turing jump, even though the skip of A is not always above A (i.e., not all degrees are cototal). In fact, there is a set that is its own double skip.

[1]  Charles M. Harris,et al.  An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees , 2012, TAMC.

[2]  S. Barry Cooper,et al.  Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense , 1984, Journal of Symbolic Logic.

[3]  Alistair H. Lachlan,et al.  Then-rea enumeration degrees are dense , 1992, Arch. Math. Log..

[4]  Charles M. Harris.  Goodness in the enumeration and singleton degrees , 2010, Arch. Math. Log..

[5]  Andrea Sorbi,et al.  Initial Segments Of The Σ20 Enumeration Degrees , 2016, J. Symb. Log..

[6]  P. Odifreddi.  Classical recursion theory , 1989 .

[7]  Emmanuel Jeandel,et al.  Enumeration in Closure Spaces with Applications to Algebra , 2015, ArXiv.

[8]  Alan L. Selman,et al.  Arithmetical Reducibilities I , 1971 .

[9]  Pascal Vanier,et al.  Turing Degree Spectra of Minimal Subshifts , 2017, CSR.

[10]  Joseph S. Miller,et al.  Defining totality in the enumeration degrees , 2015 .

[11]  Kevin McEvoy,et al.  Jumps of quasi-minimal enumeration degrees , 1985, Journal of Symbolic Logic.

[12]  Ethan McCarthy.  Cototal enumeration degrees and their applications to effective mathematics , 2017 .

[13]  G. Sacks.  Higher recursion theory , 1990 .

[14]  Lance Gutteridge.  Some results on enumeration reductibility. , 1971 .

[15]  Boris Solon.  Co-total Enumeration Degrees , 2006, CiE.

[16]  Iskander Sh. Kalimullin.  Definability of the jump operator in the Enumeration Degrees , 2003, J. Math. Log..

[18]  Luis E. Sanchis.  Hyperenumeration reducibility , 1978, Notre Dame J. Formal Log..

[19]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[20]  John Case,et al.  Enumeration reducibility and partial degrees , 1971 .

[21]  Simon Thomas,et al.  The bi-embeddability relation for finitely generated groups II , 2016, Arch. Math. Log..

[22]  Joseph S. Miller,et al.  Degrees of unsolvability of continuous functions , 2004, Journal of Symbolic Logic.