Fragments of bounded arithmetic and the lengths of proofs
Pavel Pudlák · Journal of Symbolic Logic · 2008
Abstract We consider the problem whether the theorems of the fragments form a strictly increasing hierarchy. We shall show a link to some results about the lengths of proofs in predicate logic that supports the conjecture that the hierarchy is strictly increasing.