We complete a study of the splitting/non-splitting properties of the enumeration degrees below 0 0 by proving an analog of Harrington’s non-splitting theorem for the § 0 enumeration degrees. We show how non-splitting techniques known from the study of the c.e. Turing degrees can be adapted to the enumeration degrees.
['Mariya Ivanova Soskova']
A non-splitting theorem in the enumeration degrees☆