On principles between ∑1- and ∑2-induction, and monotone enumerations (Q3186059): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The strength of infinitary Ramseyan principles can be accessed by their densities / 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: The inductive strength of Ramsey's theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial principles concerning approximations of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4384146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slicing the Truth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapidly growing Ramsey functions / rank
 
Normal rank

Latest revision as of 08:56, 12 July 2024

scientific article
Language Label Description Also known as
English
On principles between ∑1- and ∑2-induction, and monotone enumerations
scientific article

    Statements

    On principles between ∑1- and ∑2-induction, and monotone enumerations (English)
    0 references
    0 references
    0 references
    8 August 2016
    0 references
    fragments of arithmetics
    0 references
    reverse mathematics
    0 references
    Ackermann function
    0 references
    Paris-Harrington theorem
    0 references
    ordinal numbers
    0 references
    bounded monotone enumerations
    0 references

    Identifiers