A classification of rapidly growing Ramsey functions

DOI10.1090/S0002-9939-03-07086-2zbMath1041.03044MaRDI QIDQ4433096

Andreas Weiermann

Publication date: 29 October 2003

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

Peano arithmeticindependence resultsParis-Harrington theoremfast growing hierarchiesrapidly growing Ramsey functions

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (18)

Phase transition results for three Ramsey-like theorems ⋮ Unnamed Item ⋮ The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ Sharp thresholds for hypergraph regressive Ramsey numbers ⋮ 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 ⋮ Combinatorial unprovability proofs and their model-theoretic counterparts ⋮ Phase transitions of iterated Higman-style well-partial-orderings ⋮ Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers ⋮ Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem ⋮ 2004 Summer Meeting of the Association for Symbolic Logic ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ Exact unprovability results for compound well-quasi-ordered combinatorial classes ⋮ 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 ⋮ Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results ⋮ Partitioning 𝛼–large sets: Some lower bounds

This page was built for publication: A classification of rapidly growing Ramsey functions