TY - GEN
T1 - Elementary differences among jump hierarchies
AU - Angsheng, Li
PY - 2007
Y1 - 2007
N2 - 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 (ce.) degrees for m > 0, giving a first elementary difference among the highness hierarchies of the ce. degrees.
AB - 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 (ce.) degrees for m > 0, giving a first elementary difference among the highness hierarchies of the ce. degrees.
UR - https://www.scopus.com/pages/publications/35448981800
M3 - 会议稿件
AN - SCOPUS:35448981800
SN - 3540725032
SN - 9783540725039
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 79
EP - 88
BT - Theory and Applications of Models of Computation - 4th International Conference, TAMC 2007, Proceedings
T2 - 4th International Conference on Theory and Applications of Models of Computation, TAMC 2007
Y2 - 22 May 2007 through 25 May 2007
ER -