Reverse mathematics and colorings of hypergraphs (Q2312088): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3993087 / 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: Combinatorial principles equivalent to weak induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3478406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3464620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On principles between ∑1- and ∑2-induction, and monotone enumerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Coloring and its Applications / rank
 
Normal rank

Revision as of 20:04, 19 July 2024

scientific article
Language Label Description Also known as
English
Reverse mathematics and colorings of hypergraphs
scientific article

    Statements

    Reverse mathematics and colorings of hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 July 2019
    0 references
    reverse mathematics
    0 references
    hypergraph
    0 references
    vertex coloring
    0 references

    Identifiers

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