2000 character limit reached
Induction rules in bounded arithmetic (1809.10718v2)
Published 27 Sep 2018 in math.LO and cs.LO
Abstract: We study variants of Buss's theories of bounded arithmetic axiomatized by induction schemes disallowing the use of parameters, and closely related induction inference rules. We put particular emphasis on $\hat\Pib_i$ induction schemes, which were so far neglected in the literature. We present inclusions and conservation results between the systems (including a witnessing theorem for $Ti_2$ and $Si_2$ of a new form), results on numbers of instances of the axioms or rules, connections to reflection principles for quantified propositional calculi, and separations between the systems.