Isolation and lattice embeddings (Q4779650)

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 1836126
Language Label Description Also known as
default for all languages
No label defined
    English
    Isolation and lattice embeddings
    scientific article; zbMATH DE number 1836126

      Statements

      Isolation and lattice embeddings (English)
      0 references
      12 November 2003
      0 references
      d.c.e degree
      0 references
      lattice embedding
      0 references
      Turing degree
      0 references
      isolation pair
      0 references
      0 references
      We say that \(D\subseteq\omega\) is d.c.e. if \(D\) is the difference of two c.e. sets. A Turing degree is c.e. (d.c.e.) if it contains a c.e. (d.c.e.) set. We say that \((a,d)\) is an isolation pair if \(a\) is a c.e. degree, \(d\) is a d.c.e. degree, \(a<d\), and \(a\) bounds all c.e. degrees below \(d\). In this paper it is proved that: There is an isolation pair \((a,d)\) and a c.e. degree \(c\) such that \(c\) cups \(d\) to \(0'\) and caps \(a\) to 0.
      0 references

      Identifiers