Elementary differences among jump hierarchies

  • Authors:

  • Angsheng Li

  • Affiliations:

  • State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China

  • Venue:
  • TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is shown that Th(H1) ≠ Th(Hn) holds for every n 1, where Hm is the upper semi-lattice of all highm computably enumerable (c.e.) degrees for m 0, giving a first elementary difference among the highness hierarchies of the c.e. degrees.