Tracing and domination in the Turing degrees (Q764269): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a conjecture of Dobrinen and Simpson concerning almost everywhere domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cupping, measure and computably enumerable splittings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform almost everywhere domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal degrees and the jump operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal pairs and high recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: MASS PROBLEMS AND HYPERARITHMETICITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4460833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highness and bounding minimal pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost everywhere domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low for random reals and positive-measure domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness notions, measure and domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness for the class of random sets / 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: Initial segments of the degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Recursively Enumerable Sets and Degrees of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and Computability: Open Questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness properties and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost everywhere domination and superhighness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational randomness and lowness / rank
 
Normal rank

Latest revision as of 00:26, 5 July 2024

scientific article
Language Label Description Also known as
English
Tracing and domination in the Turing degrees
scientific article

    Statements

    Tracing and domination in the Turing degrees (English)
    0 references
    0 references
    13 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    Turing degrees
    0 references
    tracing
    0 references
    domination
    0 references
    array computability
    0 references
    algorithmic randomness
    0 references
    0 references