LAUSR

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.