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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5013639
Language Label Description Also known as
default for all languages
No label defined
    English
    There is no ordering on the classes in the generalized high/low hierarchies
    scientific article; zbMATH DE number 5013639

      Statements

      There is no ordering on the classes in the generalized high/low hierarchies (English)
      0 references
      0 references
      21 March 2006
      0 references
      The high/low hierarchy studied by Soare and Cooper induces a partition of the Turing degrees below \({\mathbf 0}'\). The generalized high/low hierarchy introduced by Jockusch and Posner induces a partition on all the Turing degrees. For \(n\geq 1\), a degree \(\mathbf x\) is generalized low\(_n(\text{GL}_n)\) if \({\mathbf x}^{(n)}=({\mathbf x}\vee {\mathbf 0}')^{(n-1)}\), generalized high\(_n(\text{GH}_n)\) if \({\mathbf x}^{(n)}=({\mathbf x}\vee {\mathbf 0}')^{(n)}\), and generalized intermediate if neither \(\text{GH}_n\) nor \(\text{GL}_n\) for any \(n\). These classes constitute the generalized hierarchy. The paper's main theorem extends a result of Lerman. It establishes the decidability of the existential theory of the Turing degrees in a language with a constant for the degree \(\mathbf 0\), a binary relation for Turing reducibility, and a 1-place predicate for each of the classes of the generalized hierarchy. A further result gives information about the distribution of Turing degrees within the classes of the hierarchy.
      0 references
      Turing degrees
      0 references
      generalized high/low hierarchy
      0 references
      decidability
      0 references
      existential theory
      0 references

      Identifiers