English

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 S21S^{1}_{2} proves Σ0b(Σ1b)LIND\Sigma_{0}^{b}(\Sigma_{1}^{b})-LIND; however, we show that Allen's D21D_{2}^{1} does not prove Σ0b(Σ1b)LLIND\Sigma_{0}^{b}(\Sigma_{1}^{b})-LLIND unless P=NCP = NC. We also give some interesting alternative axiomatisations of S21S^{1}_{2}.

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}
}