A hierarchy for the plus cupping Turing degrees (Q4650266): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An almost deep degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting and nonsplitting, II: A low<sub>2</sub> c.e. degree above which <i>0</i>′ is not splittable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A join theorem for the computably enumerable degrees / 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: Elementary Differences Among Jump Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy for cuppable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jump restricted interpolation in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees less than 0' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal pair of recursively enumerable degrees / rank
 
Normal rank

Latest revision as of 18:07, 7 June 2024

scientific article; zbMATH DE number 2133213
Language Label Description Also known as
English
A hierarchy for the plus cupping Turing degrees
scientific article; zbMATH DE number 2133213

    Statements

    A hierarchy for the plus cupping Turing degrees (English)
    0 references
    0 references
    0 references
    9 February 2005
    0 references
    0 references
    computably enumerable degrees
    0 references
    cupping
    0 references
    high-low hierarchy
    0 references
    0 references