Sciweavers

Share
CORR
2007
Springer

On the Proof Complexity of Deep Inference

8 years 4 months ago
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 deepinference proof systems that exhibit an exponential speedup over analytic Gentzen proof systems that they polynomially simulate.
Paola Bruscoli, Alessio Guglielmi
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where CORR
Authors Paola Bruscoli, Alessio Guglielmi
Comments (0)
books