Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy (Q646830)

From MaRDI portal
Revision as of 04:11, 15 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q465107)
scientific article
Language Label Description Also known as
English
Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy
scientific article

    Statements

    Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy (English)
    0 references
    18 November 2011
    0 references
    constructive ordinal
    0 references
    2-computably enumerable degree
    0 references
    Turing jump
    0 references
    Ershov hierarchy
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references