No label defined (Q4664253)

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

      Statements

      0 references
      0 references
      5 April 2005
      0 references
      simple set
      0 references
      degree
      0 references
      reducibility
      0 references
      bounded class of computably enumerable sets
      0 references
      We call a class \(S\) of c.e. sets bounded iff there is an \(m\)-incomplete c.e. set \(A\) such that every set in \(S\) is \(m\)-reducible to \(A\). In this paper the following results are obtained. 1. There is a simple set \(A\) such that for any effectively simple set \(B,B\leq_1A\). 2. The class of all maximal sets is not bounded. 3. There is an \(m\)-incomplete c.e. set \(A\) such that every computably enumerable bwtt-degree contains a set \(B\leq_mA\). 4. There is a wtt-incomplete c.e. set \(A\) such that every c.e. Turing degree contains a set \(B\leq_mA\). 5. Let \(A\) be c.e. Then the class of all c.e. sets in the Turing degree of \(A\) is bounded iff \(A\) is \(\text{low}_2\). 6. There is a c.e. set \(A\) such that the class of c.e. sets in its \(Q\)-degree is bounded but \(A\) is non-\(\text{low}_2\). For the entire collection see [Zbl 1050.03004].
      0 references

      Identifiers