A hierarchy for cuppable degrees (Q1584492)

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 1525085
Language Label Description Also known as
default for all languages
No label defined
    English
    A hierarchy for cuppable degrees
    scientific article; zbMATH DE number 1525085

      Statements

      A hierarchy for cuppable degrees (English)
      0 references
      0 references
      0 references
      0 references
      3 September 2001
      0 references
      A c.e. degree \({\mathbf a}\) is called cuppable if there is a c.e. degree \({\mathbf b}\neq\mathbf{0}'\) such that \({\mathbf a}\vee {\mathbf b}= \mathbf{0}'\). A c.e. degree \({\mathbf a}\) is called \(\text{low}_n\)-cuppable, \(n>0\), if there is a \(\text{low}_n\) c.e. degrees \({\mathbf c}\) such that \({\mathbf a}\vee {\mathbf c}=\mathbf{0}'\). Let \(\text{LC}_n\) be the set of all \(\text{low}_n\)-cuppable c.e. degrees. In this paper it is proved that \(\text{LC}_1 \subset \text{LC}_2\).
      0 references
      computably enumerable degrees
      0 references
      \(\text{low}_n\)-cuppable degrees
      0 references

      Identifiers