On the Proof Complexity of Deep Inference - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Computational Logic Year : 2009

On the Proof Complexity of Deep Inference


We obtain two results about the proof complexity of deep inference: (1) Deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin extension rule or with the substitution rule; (2) there are analytic deep-inference proof systems that exhibit an exponential speedup over analytic Gentzen proof systems that they polynomially simulate.
Fichier principal
Vignette du fichier
OnPrComplDI.pdf (330.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00441211 , version 1 (15-12-2009)



Paola Bruscoli, Alessio Guglielmi. On the Proof Complexity of Deep Inference. ACM Transactions on Computational Logic, 2009, 10 (2), pp.34. ⟨10.1145/1462179.1462186⟩. ⟨inria-00441211⟩
79 View
140 Download



Gmail Facebook Twitter LinkedIn More