Pages that link to "Item:Q507201"
From MaRDI portal
The following pages link to The inductive strength of Ramsey's theorem for pairs (Q507201):
Displaying 19 items.
- Ramsey's theorem for pairs and provably recursive functions (Q987936) (← links)
- Proving Ramsey's theory by the cover set induction: A case and comparision study. (Q1353938) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- Book review of: D. R. Hirschfeldt, Slicing the truth. On the computable and reverse mathematics of combinatorial principles (Q1680523) (← 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)
- On the strength of Ramsey's theorem for pairs (Q2732267) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- On principles between ∑1- and ∑2-induction, and monotone enumerations (Q3186059) (← 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)
- Where pigeonhole principles meet Koenig lemmas (Q5158115) (← links)
- HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? (Q6103456) (← links)
- Variations of statement, variations of strength. The case of the Rival-Sands theorems (Q6147850) (← links)
- (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE (Q6203557) (← links)
- The Ginsburg-Sands theorem and computability theory (Q6492253) (← links)
- Conservation strength of the infinite pigeonhole principle for trees (Q6561666) (← links)
