Epsilon Calculus Provides Shorter Cut-Free Proofs
摘要
In this paper we show that cut-free derivations in the epsilon format of sequent calculus provide for a non-elementary speed-up w.r.t. cut-free proofs in usual sequent calculi in first-order language. In addition, a non-elementary speed-up is shown w.r.t. cut-free proofs in calculi with relaxed eigenvariable conditions which proved a speed-up themselves w.r.t. \({\mathbf {LK}}\) .