Skip to main content
Conference Proceedings

Elementary differences among jump hierarchies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4484 LNCS 79-88
DOI: 10.1007/978-3-540-72504-6_7
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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 (ce.) degrees for m > 0, giving a first elementary difference among the highness hierarchies of the ce. degrees. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Angsheng, L. (2007). Elementary differences among jump hierarchies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4484 LNCS, pp. 79–88). https://doi.org/10.1007/978-3-540-72504-6_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free