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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5619076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3816068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: D.R.E. Degrees and the Nondiamond Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Pairs of Recursively Enumerable Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The d.r.e. degrees are not dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511553 / rank
 
Normal rank

Revision as of 15:34, 4 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