Recursively enumerable <i>m</i>- and tt-degrees. I: The quantity of <i>m</i>-degrees (Q3767338)

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 4025426
Language Label Description Also known as
default for all languages
No label defined
    English
    Recursively enumerable <i>m</i>- and tt-degrees. I: The quantity of <i>m</i>-degrees
    scientific article; zbMATH DE number 4025426

      Statements

      Recursively enumerable <i>m</i>- and tt-degrees. I: The quantity of <i>m</i>-degrees (English)
      0 references
      1989
      0 references
      m-degrees
      0 references
      tt-degrees
      0 references
      0 references
      [Part II is reviewed below (see Zbl 0631.03032).] We solve a question of \textit{P. Odifreddi} [Bull. Am. Math. Soc., New. Ser. 4, 37-86 (1981; Zbl 0484.03024)] by showing that, given \(n>0\), there exists an r.e. tt-degree containing exactly \(2^ n-1\) r.e. m-degrees. The method is rather like a ``full approximation'' argument.
      0 references

      Identifiers