STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES (Q2976339): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3395521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of Ramsey's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Questions in Reverse Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The metamathematics of Stable Ramsey’s Theorem for Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic computability and choice / rank
 
Normal rank

Latest revision as of 18:41, 13 July 2024

scientific article
Language Label Description Also known as
English
STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES
scientific article

    Statements

    STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES (English)
    0 references
    0 references
    0 references
    28 April 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Ramsey's theorem
    0 references
    reverse mathematics
    0 references
    computability theory
    0 references
    Weihrauch reducibility
    0 references
    computable reducibility
    0 references
    0 references
    0 references