Extension without Cut - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Annals of Pure and Applied Logic Year : 2012

Extension without Cut


In proof theory one distinguishes sequent proofs with cut and cut-free sequent proofs, while for proof complexity one distinguishes Frege-systems and extended Frege-systems. In this paper we show how deep inference can provide a uniform treatment for both classifications, such that we can define cut-free systems with extension, which is neither possible with Frege-systems, nor with the sequent calculus. We show that the propositional pigeon-hole principle admits polynomial-size proofs in a cut-free system with extension. We also define cut-free systems with substitution and show that the cut-free system with extension p-simulates the cut-free system with substitution.
Fichier principal
Vignette du fichier
psppp.pdf (246.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00759215 , version 1 (30-11-2012)



Lutz Strassburger. Extension without Cut. Annals of Pure and Applied Logic, 2012, 163 (12), pp.1995-2007. ⟨10.1016/j.apal.2012.07.004⟩. ⟨hal-00759215⟩
119 View
218 Download



Gmail Facebook Twitter LinkedIn More