Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Hi-index | 5.23 |
It is shown that Th(H"1)Th(H"n) holds for every n1, where H"m is the upper semi-lattice of all high"m computably enumerable (c.e.) degrees for m0, giving a first elementary difference among the highness hierarchies of the c.e. degrees.