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ős-Moser principle, within . These results provide simpler proofs of known results on the -conservativities of and as corollaries.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.