Pages that link to "Item:Q2869903"
From MaRDI portal
The following pages link to Rainbow Ramsey theorem for triples is strictly weaker than the arithmetical comprehension axiom (Q2869903):
Displaying 8 items.
- Cohesive sets and rainbows (Q386619) (← links)
- Combinatorial principles between \(\text{RRT}_2^2\) and \(\text{RT}_2^2\) (Q2258112) (← links)
- Pigeons do not jump high (Q2313367) (← links)
- Some logically weak Ramseyan theorems (Q2453567) (← links)
- On uniform relationships between combinatorial problems (Q2796522) (← links)
- The strength of the rainbow Ramsey Theorem (Q3655258) (← links)
- The weakness of the pigeonhole principle under hyperarithmetical reductions (Q5163163) (← links)
- Pathwise-randomness and models of second-order arithmetic (Q6559034) (← links)
