Skip to main navigation Skip to search Skip to main content

Elementary differences among jump hierarchies

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 4th International Conference, TAMC 2007, Proceedings
Pages79-88
Number of pages10
StatePublished - 2007
Externally publishedYes
Event4th International Conference on Theory and Applications of Models of Computation, TAMC 2007 - Shanghai, China
Duration: 22 May 200725 May 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4484 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Theory and Applications of Models of Computation, TAMC 2007
Country/TerritoryChina
CityShanghai
Period22/05/0725/05/07

Fingerprint

Dive into the research topics of 'Elementary differences among jump hierarchies'. Together they form a unique fingerprint.

Cite this