The Complexity of Gentzen Systems for Propositional Logic

Abstract Examples are given of valid sequents of classical propositional logic involving only the biconditional which require exponentially long proofs in a cut-free Gentzen system. The sequents have polynomial size proofs if the cut rule is allowed.