Combinatorial principles equivalent to weak induction
Logic
2018-12-27 v1
Abstract
We consider two combinatorial principles, and . Both are easily proved in plus induction. We give two proofs of in , using different methods to eliminate the use of induction. Working in the weakened base system , we prove that is equivalent to induction and is equivalent to induction. We conclude with a Weihrauch analysis of the principles, showing .
Cite
@article{arxiv.1812.09943,
title = {Combinatorial principles equivalent to weak induction},
author = {Caleb Davis and Denis R. Hirschfeldt and Jeffry L. Hirst and Jake Pardo and Arno Pauly and Keita Yokoyama},
journal= {arXiv preprint arXiv:1812.09943},
year = {2018}
}