Separation of bounded arithmetic using a consistency statement
Abstract
This paper proves Buss's hierarchy of bounded arithmetics does not entirely collapse. More precisely, we prove that, for a certain , holds. Further, we can allow any finite set of true quantifier free formulas for the BASIC axioms of . By Takeuti's argument, this implies . Let be a certain formulation of BASIC axioms. We prove that for sufficiently large , while for a system , a fragment of the system , induction free first order extension of Cook's , of which proofs contain only formulas with less than connectives. is proved by straightforward adaption of the proof of by Buss and Ignjatovi\'c. is proved by , where is a quantifier-only extension of . The later statement is proved by an extension of a technique used for Yamagata's proof of , in which a kind of satisfaction relation is defined. By extending to formulas with less than -quantifiers, is obtained in a straightforward way.
Cite
@article{arxiv.1904.06782,
title = {Separation of bounded arithmetic using a consistency statement},
author = {Yoriyuki Yamagata},
journal= {arXiv preprint arXiv:1904.06782},
year = {2019}
}
Comments
Too many errors, The correctness proof of translation in Section 6.6 has a gap. Section 7 looks problematic