Proofs with monotone cuts
Emil Jeřábek · Mathematical logic quarterly · 2012
Abstract Atserias, Galesi, and Pudlák have shown that the monotone sequent calculus MLK quasipolynomially simulates proofs of monotone sequents in the full sequent calculus LK (or equivalently, in Frege systems). We generalize the simulation to the fragment MCLK of LK which can prove arbitrary sequents, but restricts cut‐formulas to be monotone. We also show that MLK as a refutation system for CNFs quasipolynomially simulates LK.