Every <i>n</i>-generic degree is a minimal cover of an <i>n</i>-generic degree (Q5287689)

From MaRDI portal
Revision as of 00:08, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 238216
Language Label Description Also known as
English
Every <i>n</i>-generic degree is a minimal cover of an <i>n</i>-generic degree
scientific article; zbMATH DE number 238216

    Statements

    Every <i>n</i>-generic degree is a minimal cover of an <i>n</i>-generic degree (English)
    0 references
    0 references
    17 August 1993
    0 references
    density
    0 references
    \(n\)-generic degrees
    0 references
    degrees of unsolvability
    0 references
    Turing degree
    0 references
    minimal cover
    0 references

    Identifiers