Pages that link to "Item:Q1157345"
From MaRDI portal
The following pages link to Some bounds for the Ramsey-Paris-Harrington numbers (Q1157345):
Displaying 14 items.
- Sharp thresholds for hypergraph regressive Ramsey numbers (Q618311) (← links)
- Ramsey-Paris-Harrington numbers for graphs (Q801937) (← links)
- Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers (Q941316) (← links)
- The varieties of arboreal experience (Q1055407) (← links)
- Some rapidly growing functions (Q1148900) (← links)
- Regressive Ramsey numbers are Ackermannian (Q1284479) (← links)
- Bootstrapping the primitive recursive functions by only 27 colors (Q1357751) (← links)
- Dickson's lemma and weak Ramsey theory (Q1734268) (← links)
- Upper bounds on positional Paris-Harrington games (Q2222955) (← links)
- More on lower bounds for partitioning \(\alpha\)-large sets (Q2373693) (← links)
- Upper and lower Ramsey bounds in bounded arithmetic (Q2488271) (← links)
- Independence of Ramsey theorem variants using \(\varepsilon _0\) (Q2789881) (← links)
- A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies (Q4305315) (← links)
- On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies (Q5278196) (← links)