Title
A non-splitting theorem in the enumeration degrees
Abstract
We complete a study of the splitting/non-splitting properties of the enumeration degrees below 0e′ by proving an analog of Harrington’s non-splitting theorem for the Σ20 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.
Year
DOI
Venue
2009
10.1016/j.apal.2009.01.009
Annals of Pure and Applied Logic
Keywords
Field
DocType
03D30
Discrete mathematics,Combinatorics,Splitting theorem,Enumeration,Algebraic enumeration,Turing,Mathematics
Journal
Volume
Issue
ISSN
160
3
0168-0072
Citations 
PageRank 
References 
2
0.49
5
Authors
1
Name
Order
Citations
PageRank
Mariya Ivanova Soskova12110.54