Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
From MaRDI portal
Publication:941316
DOI10.1016/j.jcta.2007.12.006zbMath1194.05159OpenAlexW2110004423MaRDI QIDQ941316
Menachem Kojman, Gyesik Lee, Eran Omri, Andreas Weiermann
Publication date: 4 September 2008
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2007.12.006
Ackermannian functionsKanamori-McAloon theoremParis-Harrington theoremrapidly growing Ramsey numbers
Related Items (9)
Unprovability of sharp versions of Friedman’s sine-principle ⋮ THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS ⋮ Sharp thresholds for hypergraph regressive Ramsey numbers ⋮ Phase Transitions for Weakly Increasing Sequences ⋮ Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem ⋮ Regressive functions on pairs ⋮ Phase transitions for Gödel incompleteness ⋮ Classifying the phase transition threshold for Ackermannian functions ⋮ Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension
Cites Work
- On Gödel incompleteness and finite combinatorics
- Combinatorial set theory: Partition relations for cardinals
- Some bounds for the Ramsey-Paris-Harrington numbers
- Rapidly growing Ramsey functions
- Fast growing functions based on Ramsey theorems
- Theories of computational complexity
- Regressive Ramsey numbers are Ackermannian
- On regressive Ramsey numbers
- A classification of rapidly growing Ramsey functions
- A Note on Ramsey's Theorem
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
