Low-like basis theorems for Ramsey's theorem for pairs in first-order arithmetic
Abstract
We construct an 2-solution (also known as a weakly low solution) to D2 within B03 and prove the 2-basis theorem for RT2 over B03. The 2-basis theorem is a variant of the low basis theorem, which has recently received focus in the context of the first-order part of Ramsey type theorems. For the construction, we use Mathias forcing in an effectively coded ω-model of WKL0 to ensure sufficient computability under the system with weaker induction. Using a similar method, we also show the 2-basis theorem for RT22 and EM<∞, a version of Erdos-Moser principle, within I02. These results provide simpler proofs of known results on the 11-conservativities of RT2, RT22 and EM<∞ as corollaries.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.