Fragments of bounded arithmetic and the lengths of proofs

Abstract

We consider the problem whether the ∀Σ₁^b theorems of the fragments T₂ⁿ 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.