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

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3103/s1066369x10120066 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002670889 / rank
 
Normal rank

Latest revision as of 09:52, 30 July 2024

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
    0 references