Rapidly growing Ramsey functions
From MaRDI portal
Publication:1168967
DOI10.2307/2006985zbMath0494.03027OpenAlexW2336574378MaRDI QIDQ1168967
Jussi Ketonen, Robert M. Solovay
Publication date: 1981
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2006985
Related Items (60)
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies ⋮ Paris-Harrington principles, reflection principles and transfinite induction up to \(\epsilon _ 0\) ⋮ Phase transition results for three Ramsey-like theorems ⋮ Unprovability of sharp versions of Friedman’s sine-principle ⋮ More on lower bounds for partitioning \(\alpha\)-large sets ⋮ Logical dreams ⋮ An independence result for \((\Pi^ 1_ 1-CA)+BI\) ⋮ Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes ⋮ Reverse mathematical bounds for the termination theorem ⋮ The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ On principles between ∑1- and ∑2-induction, and monotone enumerations ⋮ Bootstrapping the primitive recursive functions by only 27 colors ⋮ A Ramsey theorem in Boyer-Moore logic ⋮ THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS ⋮ Transfinite induction within Peano arithmetic ⋮ 1994 Annual Meeting of the Association for Symbolic Logic ⋮ Slow reflection ⋮ Short proofs for slow consistency ⋮ Sharp thresholds for hypergraph regressive Ramsey numbers ⋮ A new proof-theoretic proof of the independence of Kirby-Paris' hydra theorem. ⋮ The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem ⋮ Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs ⋮ Reverse mathematics of the finite downwards closed subsets of ordered by inclusion and adjacent Ramsey for fixed dimension ⋮ Some rapidly growing functions ⋮ The Π21$\Pi ^1_2$ consequences of a theory ⋮ On Harrington's partition relation ⋮ Bootstrapping. I ⋮ Some bounds for the Ramsey-Paris-Harrington numbers ⋮ A Model-Theoretic Approach to Ordinal Analysis ⋮ Combinatorial principles concerning approximations of functions ⋮ Minimal readability of intuitionistic arithmetic and elementary analysis ⋮ Inductive full satisfaction classes ⋮ Upper bounds on positional Paris-Harrington games ⋮ A Combinatorial Bound for a Restricted Form of the Termination Theorem ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ Dickson's lemma and weak Ramsey theory ⋮ Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers ⋮ Analyzing Nash-Williams' partition theorem by means of ordinal types ⋮ Fast growing functions based on Ramsey theorems ⋮ Ordinal complexity of recursive definitions ⋮ Ranked partial structures ⋮ Subsystems of true arithmetic and hierarchies of functions ⋮ Unprovable combinatorial statements ⋮ Proof lengths for instances of the Paris-Harrington principle ⋮ Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic ⋮ Schreier sets in Ramsey theory ⋮ On Gödel incompleteness and finite combinatorics ⋮ Independence of Ramsey theorem variants using $\varepsilon _0$ ⋮ An Unprovable Ramsey-Type Theorem ⋮ On a question of Andreas Weiermann ⋮ Block combinatorics ⋮ Some combinatorial principles equivalent to restrictions of transfinite induction up to \(\Gamma _ 0\) ⋮ On the finite containment problem for Petri nets ⋮ Primitive Recursive Bounds for Van Der Waerden Numbers ⋮ Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension ⋮ Partitioning 𝛼–large sets: Some lower bounds ⋮ Petri nets and large finite sets ⋮ The slow-growing and the Graegorczyk hierarchies ⋮ In search of the first-order part of Ramsey's theorem for pairs ⋮ A decidable subclass of the minimal Gödel class with identity
This page was built for publication: Rapidly growing Ramsey functions
