An Unprovable Ramsey-Type Theorem

DOI10.2307/2159452zbMath0773.05098OpenAlexW4242420257MaRDI QIDQ4031465

Martin Loebl, Jaroslav Nešetřil

Publication date: 1 April 1993

Full work available at URL: https://doi.org/10.2307/2159452

zbMATH Keywords

Ramsey functionsParis-Harrington theoremKetonen-Solovay theorem

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) First-order arithmetic and fragments (03F30) Ramsey theory (05D10)

Related Items

Phase transition results for three Ramsey-like theorems ⋮ A WALK WITH GOODSTEIN ⋮ Upper bounds on positional Paris-Harrington games ⋮ Unprovable combinatorial statements ⋮ Proof lengths for instances of the Paris-Harrington principle ⋮ Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem ⋮ Independence of Ramsey theorem variants using $\varepsilon _0$ ⋮ Partitioning 𝛼–large sets: Some lower bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Gödel incompleteness and finite combinatorics
• Rapidly growing Ramsey functions
• Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
• Accessible Independence Results for Peano Arithmetic
• Linearity and Unprovability of Set Union Problem Strategies
• A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
• A classification of the ordinal recursive functions
• On the restricted ordinal theorem