Low-like basis theorems for Ramsey's theorem for pairs in first-order arithmetic
Logic
2026-01-13 v1
Abstract
We construct an -solution (also known as a weakly low solution) to within and prove the -basis theorem for over . The -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 to ensure sufficient computability under the system with weaker induction. Using a similar method, we also show the -basis theorem for and , a version of Erd\H{o}s-Moser principle, within . These results provide simpler proofs of known results on the -conservativities of and as corollaries.
Cite
@article{arxiv.2601.07569,
title = {Low-like basis theorems for Ramsey's theorem for pairs in first-order arithmetic},
author = {Hiroyuki Ikari and Keita Yokoyama},
journal= {arXiv preprint arXiv:2601.07569},
year = {2026}
}