A Note on Induction Schemas in Bounded Arithmetic
Logic in Computer Science
2007-05-23 v1 Computational Complexity
Abstract
As is well known, Buss' theory of bounded arithmetic proves ; however, we show that Allen's does not prove unless . We also give some interesting alternative axiomatisations of .
Cite
@article{arxiv.cs/0210011,
title = {A Note on Induction Schemas in Bounded Arithmetic},
author = {Aleksandar Ignjatovic},
journal= {arXiv preprint arXiv:cs/0210011},
year = {2007}
}