On a conjecture of Dobrinen and Simpson concerning almost everywhere domination (Q5477626): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3099570167 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q123345563 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1408.2282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of Ramsey's theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the “almost all” theory of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of members of \(\Pi_ 1^ 0\) classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness properties and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / 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: Q3329452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness, relativization and Turing degrees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:55, 24 June 2024

scientific article; zbMATH DE number 5038890
Language Label Description Also known as
English
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
scientific article; zbMATH DE number 5038890

    Statements

    On a conjecture of Dobrinen and Simpson concerning almost everywhere domination (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 July 2006
    0 references
    a.e. dominating
    0 references
    u.a.e. dominating
    0 references
    computable
    0 references
    super high
    0 references
    random
    0 references
    genericity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references