Pages that link to "Item:Q1644984"
From MaRDI portal
The following pages link to The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984):
Displayed 14 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- Book review of: D. R. Hirschfeldt, Slicing the truth. On the computable and reverse mathematics of combinatorial principles (Q1680523) (← links)
- A weak variant of Hindman's theorem stronger than Hilbert's theorem (Q1745357) (← 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)
- THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS (Q4647115) (← 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)