The following pages link to Rapidly growing Ramsey functions (Q1168967):
Displaying 50 items.
- Phase transition results for three Ramsey-like theorems (Q286698) (← links)
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- Proof lengths for instances of the Paris-Harrington principle (Q526964) (← links)
- On Gödel incompleteness and finite combinatorics (Q581400) (← links)
- Sharp thresholds for hypergraph regressive Ramsey numbers (Q618311) (← links)
- Bootstrapping. I (Q636291) (← links)
- Subsystems of true arithmetic and hierarchies of functions (Q688433) (← links)
- Inductive full satisfaction classes (Q920081) (← links)
- Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers (Q941316) (← links)
- Petri nets and large finite sets (Q1060848) (← links)
- Paris-Harrington principles, reflection principles and transfinite induction up to \(\epsilon _ 0\) (Q1082336) (← links)
- An independence result for \((\Pi^ 1_ 1-CA)+BI\) (Q1097882) (← links)
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes (Q1097884) (← links)
- Some rapidly growing functions (Q1148900) (← links)
- On Harrington's partition relation (Q1152363) (← links)
- Some bounds for the Ramsey-Paris-Harrington numbers (Q1157345) (← links)
- Analyzing Nash-Williams' partition theorem by means of ordinal types (Q1191918) (← links)
- Fast growing functions based on Ramsey theorems (Q1191932) (← links)
- Ordinal complexity of recursive definitions (Q1193596) (← links)
- Unprovable combinatorial statements (Q1201266) (← links)
- Some combinatorial principles equivalent to restrictions of transfinite induction up to \(\Gamma _ 0\) (Q1262308) (← links)
- Bootstrapping the primitive recursive functions by only 27 colors (Q1357751) (← links)
- A new proof-theoretic proof of the independence of Kirby-Paris' hydra theorem. (Q1399971) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 (Q1731963) (← links)
- Dickson's lemma and weak Ramsey theory (Q1734268) (← links)
- On the finite containment problem for Petri nets (Q1819937) (← links)
- A Ramsey theorem in Boyer-Moore logic (Q1904403) (← links)
- Transfinite induction within Peano arithmetic (Q1919522) (← links)
- In search of the first-order part of Ramsey's theorem for pairs (Q2117792) (← links)
- Short proofs for slow consistency (Q2176406) (← links)
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs (Q2193942) (← links)
- Upper bounds on positional Paris-Harrington games (Q2222955) (← links)
- More on lower bounds for partitioning \(\alpha\)-large sets (Q2373693) (← links)
- Slow reflection (Q2407272) (← links)
- Independence of Ramsey theorem variants using \(\varepsilon _0\) (Q2789881) (← links)
- Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension (Q2845566) (← links)
- The strength of Ramsey's theorem for coloring relatively large sets (Q2921021) (← links)
- On principles between ∑1- and ∑2-induction, and monotone enumerations (Q3186059) (← links)
- A Combinatorial Bound for a Restricted Form of the Termination Theorem (Q3295155) (← links)
- Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic (Q3335777) (← links)
- Block combinatorics (Q3373731) (← links)
- Partitioning 𝛼–large sets: Some lower bounds (Q3420352) (← links)
- On a question of Andreas Weiermann (Q3619872) (← links)
- The slow-growing and the Graegorczyk hierarchies (Q3682477) (← links)
- A decidable subclass of the minimal Gödel class with identity (Q3695254) (← links)
- Combinatorial principles concerning approximations of functions (Q3788005) (← links)
- Primitive Recursive Bounds for Van Der Waerden Numbers (Q3794188) (← links)
- An Unprovable Ramsey-Type Theorem (Q4031465) (← links)
- A Model-Theoretic Approach to Ordinal Analysis (Q4338039) (← links)
