Pages that link to "Item:Q1644984"

The following pages link to The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984):

Displaying 28 items.

• Reverse mathematical bounds for the termination theorem (Q324248) (← links)
• The inductive strength of Ramsey's theorem for pairs (Q507201) (← links)
• \({\Pi^1_2}\)-comprehension and the property of Ramsey (Q1016505) (← links)
• Book review of: D. R. Hirschfeldt, Slicing the truth. On the computable and reverse mathematics of combinatorial principles (Q1680523) (← links)
• Dickson's lemma and weak Ramsey theory (Q1734268) (← links)
• A weak variant of Hindman's theorem stronger than Hilbert's theorem (Q1745357) (← links)
• On the strength of Ramsey's theorem (Q1913632) (← links)
• In search of the first-order part of Ramsey's theorem for pairs (Q2117792) (← links)
• On the strength of Ramsey's theorem for trees (Q2182273) (← links)
• Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs (Q2193942) (← links)
• Weaker cousins of Ramsey's theorem over a weak base theory (Q2231700) (← links)
• Using Ramsey's theorem once (Q2274133) (← links)
• The strength of infinitary Ramseyan principles can be accessed by their densities (Q2358627) (← links)
• On the strength of Ramsey's theorem for pairs (Q2732267) (← links)
• Term extraction and Ramsey's theorem for pairs (Q2915896) (← links)
• The strength of Ramsey's theorem for coloring relatively large sets (Q2921021) (← links)
• Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic (Q2968410) (← links)
• THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS (Q4647115) (← links)
• Random reals, the rainbow Ramsey theorem, and arithmetic conservation (Q4916553) (← links)
• RAMSEY’S THEOREM FOR PAIRS AND<i>K</i>COLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC (Q4977228) (← links)
• The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma (Q5004544) (← links)
• An inside/outside Ramsey theorem and recursion theory (Q5036108) (← links)
• Where pigeonhole principles meet Koenig lemmas (Q5158115) (← links)
• HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? (Q6103456) (← links)
• The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem (Q6119673) (← links)
• (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE (Q6203557) (← links)
• Conservation strength of the infinite pigeonhole principle for trees (Q6561666) (← links)
• Erdős-Moser and \(I \Sigma_2\) (Q6635147) (← links)