THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS

DOI10.1017/jsl.2013.27zbMath1338.03110arXiv1204.1134OpenAlexW2964144838MaRDI QIDQ2921021

Lorenzo Carlucci, Konrad Zdanowski

Publication date: 30 September 2014

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.1134

zbMATH Keywords

Ramsey's theoremtrue arithmeticrelatively large sets

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)

Related Items

New bounds on the strength of some restrictions of Hindman's theorem ⋮ Restrictions of Hindman's theorem: an overview

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Gödel incompleteness and finite combinatorics
• Sharp thresholds for hypergraph regressive Ramsey numbers
• Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers
• Partition theorems for systems of finite subsets of integers
• Rapidly growing Ramsey functions
• Regressive Ramsey numbers are Ackermannian
• On the strength of Ramsey's theorem
• Banach spaces of type \(p\) have arbitrarily distortable subspaces
• On degrees of unsolvability
• On the strength of Ramsey's theorem for pairs
• The Veblen functions for computability theorists
• Schreier sets in Ramsey theory