The following pages link to (Q4700239):
Displaying 6 items.
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- A note on Hindman-type theorems for uncountable cardinals (Q1732799) (← links)
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs (Q2193942) (← links)
- More on lower bounds for partitioning \(\alpha\)-large sets (Q2373693) (← links)
- Partitioning 𝛼–large sets: Some lower bounds (Q3420352) (← links)
- The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem (Q6119673) (← links)
