On the strength of Ramsey's theorem without _1-induction

DOI10.1002/MALQ.201200047MaRDI QIDQ4915224zbMATH OpenOpenAlexFDO

Authors Keita Yokoyama

Publication date 9 April 2013

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.201200047

zbMATH Keywords

conservationEFAindicator functionproof-theoretic strengthRamsey's theoremRCAreverse mathematicsWKL

Mathematics Subject Classification ID

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

Recommendations

• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• On the strength of Ramsey's theorem
• The strength of Ramsey's theorem for pairs and arbitrarily many colors
• Some logically weak Ramseyan theorems
• Ramsey's theorem for pairs and provably recursive functions

Cites work

• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
• Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
• scientific article; zbMATH DE number 51556 (Why is no real title available?)
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• On the strength of Ramsey's theorem for pairs
• Reverse mathematics and Peano categoricity
• Some independence results for Peano arithmetic
• The strength of infinitary Ramseyan principles can be accessed by their densities
• The structure of models of Peano arithmetic

Cited in

(17)

• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• In search of the first-order part of Ramsey's theorem for pairs
• Algebraic combinatorics in bounded induction
• Weaker cousins of Ramsey's theorem over a weak base theory
• Baire categoricity and \(\Sigma_1^0\)-induction
• On the strength of Ramsey's theorem for pairs
• Is Ramsey's theorem omega-automatic?
• Nonstandard second-order arithmetic and Riemann's mapping theorem
• The strength of Ramsey's theorem for pairs and arbitrarily many colors
• Random reals, the rainbow Ramsey theorem, and arithmetic conservation
• The Borel complexity of isomorphism for o-minimal theories
• Reverse mathematics, Young diagrams, and the ascending chain condition
• 12-comprehension and the property of Ramsey
• Primitive recursive reverse mathematics
• HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK?
• The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem
• Ramsey's theorem for pairs and provably recursive functions

This page was built for publication: On the strength of Ramsey's theorem without \(\Sigma _{1}\)-induction

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