There is no ordering on the classes in the generalized high/low hierarchies

We prove that the existential theory of the Turing degrees, in the language with Turing reduction, 0, and unary relations for the classes in the generalized high/low hierarchy, is decidable.

• Type: Journal
• Year: 2006
• Where: AML
• Authors: Antonio Montalbán
• Keywords: AML 2006, Existential Theory, Turing Degrees, Turing Reduction