The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aim.2018.03.035 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3947654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey methods in analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalizing forcing arguments in subsystems of second-order arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to recursively saturated and resplendent models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4700239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorics involving ξ-large sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning 𝛼–large sets: Some lower bounds / rank
 
Normal rank
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: Proof-theoretic analysis of termination proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of proof theory / 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: 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: \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random reals, the rainbow Ramsey theorem, and arithmetic conservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Δ<sub>2</sub><sup>0</sup> set with no infinite low subset in either it or its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the theory of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse mathematics and a Ramsey-type König's Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3508462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slicing the Truth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial principles weaker than Ramsey's Theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey's theorem and recursion theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: ∏ 0 1 Classes and Degrees of Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapidly growing Ramsey functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5484945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on lower bounds for partitioning \(\alpha\)-large sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive recursion and the chain antichain principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey's theorem for pairs and provably recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS / rank
 
Normal rank
Property / cites work
 
Property / cites work: RT<sub>2</sub><sup>2</sup> does not imply WKL<sub>0</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition Theorems and Computability Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Ramseyan Factorization Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some independence results for Peano arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3884109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Forcing and Hyperimmunity in Reverse Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317419 / 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: Partial realizations of Hilbert's program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse mathematical bounds for the termination theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of rapidly growing Ramsey functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of Ramsey's theorem without Σ<sub>1</sub>‐induction / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AIM.2018.03.035 / rank
 
Normal rank

Latest revision as of 00:35, 11 December 2024

scientific article
Language Label Description Also known as
English
The proof-theoretic strength of Ramsey's theorem for pairs and two colors
scientific article

    Statements

    The proof-theoretic strength of Ramsey's theorem for pairs and two colors (English)
    0 references
    0 references
    0 references
    22 June 2018
    0 references
    reverse mathematics
    0 references
    Ramsey's theorem
    0 references
    proof-theoretic strength
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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