Journal of Logic and Computation Advance Access published online on August 21, 2007
Journal of Logic and Computation, doi:10.1093/logcom/exm041
| ||||||||||||||||||||||||||||||||||||||||||||||||||
Original papers |
The
-Enumeration Degrees
Sofia University, 5 James Bourchier Blvd, 1164 Sofia, Bulgaria.
E-mail: soskov{at}fmi.uni-sofia.bg
Received 19 October 2006.
| Abstract |
|---|
In the present article we initiate the study of the partial ordering of the
-enumeration degrees. This ordering is a semi-lattice which extends the semi-lattice of the enumeration degrees. The main results include a jump inversion theorem, a density theorem for the
-enumeration degrees below the first jump of the least degree and the lack of minimal
-enumeration degrees.
Keywords: Enumeration reducibility; enumeration jump; jump hierarchies