| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662147 | Annals of Pure and Applied Logic | 2009 | 19 Pages |
Abstract
We complete a study of the splitting/non-splitting properties of the enumeration degrees below by proving an analog of Harrington’s non-splitting theorem for the 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
