Gentzen (1935): every proof in the sequent calculus can be transformed into a cut-free proof. Implies consistency, subformula property, and decidability/complexity bounds for many fragments.
Gentzen (1935): every proof in the sequent calculus can be transformed into a cut-free proof. Implies consistency, subformula property, and decidability/complexity bounds for many fragments.