Separating Bounded Arithmetics by Herbrand Consistency
Logic
2019-07-02 v3 Logic in Computer Science
Abstract
The problem of separating the hierarchy of bounded arithmetic has been studied in the paper. It is shown that the notion of Herbrand Consistency, in its full generality, cannot separate the theory from ; though it can separate from . This extends a result of L. A. Ko{\l}odziejczyk (2006), by showing the unprovability of the Herbrand Consistency of in the theory .
Cite
@article{arxiv.1008.0225,
title = {Separating Bounded Arithmetics by Herbrand Consistency},
author = {Saeed Salehi},
journal= {arXiv preprint arXiv:1008.0225},
year = {2019}
}
Comments
Published by Oxford University Press. arXiv admin note: text overlap with arXiv:1005.2654