Erdős-Moser and I _2

DOI10.1007/S11856-024-2643-8MaRDI QIDQ6635147FDOQ6635147

Authors: Henry Piers Towsner, Keita Yokoyama 

Publication date: 9 November 2024

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Recommendations

• Dominating the Erdős-Moser theorem in reverse mathematics
• The strength of Ramsey's theorem for pairs and arbitrarily many colors
• Coloring the rationals in reverse mathematics
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• On the strength of Ramsey's theorem

zbMATH Keywords

Ramsey's theoremErdős-Moser principle

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Rapidly growing Ramsey functions
• How incomputable is finding Nash equilibria?
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• The strength of infinitary Ramseyan principles can be accessed by their densities
• On the strength of Ramsey's theorem for pairs
• \(\mathsf{RT}_{2}^{2}\) does not imply \(\mathsf{WKL}_{0}\)
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Σ_{𝑛}-bounding and Δ_{𝑛}-induction
• On the Ramseyan factorization theorem
• Separating principles below Ramsey's theorem for pairs
• Primitive recursion and the chain antichain principle
• On the (semi)lattices induced by continuous reducibilities
• On the role of the collection principle for \(\Sigma ^0_2\)-formulas in second-order reverse mathematics
• The definability strength of combinatorial principles
• On uniform relationships between combinatorial problems
• Iterative forcing and hyperimmunity in reverse mathematics
• Title not available (Why is that?)
• On principles between \(\Sigma_1\)- and \(\Sigma_2\)-induction, and monotone enumerations
• Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs
• \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
• The strength of Ramsey's theorem for pairs and arbitrarily many colors
• Ramsey-like theorems and moduli of computation
• On \(\Pi^1_1\) conservativity for \(\Pi^1_2\) theories in second order arithmetic

This page was built for publication: Erdős-Moser and \(I \Sigma_2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635147)