On the Proof Complexity of Cut-Free Bounded Deep Inference
It has recently been shown that cut-free deep inference systems exhibit an exponential speed-up over cut-free sequent systems, in terms of proof size. While this is good for proof complexity, there remains the problem of typically high proof search non-determinism induced by the deep inference methodology: the higher the depth of inference, the higher the non-determinism. In this work we improve on the proof search side by demonstrating that, for propositional logic, the same exponential speed-up in proof size can be obtained in bounded-depth cut-free systems. These systems retain the top-down symmetry of deep inference, but can otherwise be designed at the same depth level of sequent systems. As a result the non-determinism arising from the choice of rules at each stage of a proof is smaller than that of unbounded deep inference, while still giving access to the short proofs of deep inference.
Unable to display preview. Download preview PDF.
- 4.Bruscoli, P., Guglielmi, A., Gundersen, T., Parigot, M.: Quasipolynomial normalisation in deep inference via atomic flows and threshold formulae (2009), http://cs.bath.ac.uk/ag/p/QuasiPolNormDI.pdf (submitted)
- 7.Guglielmi, A., Gundersen, T.: Normalisation control in deep inference via atomic flows. Logical Methods in Computer Science 4(1:9), 1–36 (2008), http://www.lmcs-online.org/ojs/viewarticle.php?id=341 MathSciNetMATHGoogle Scholar
- 8.Guglielmi, A., Gundersen, T., Parigot, M.: A proof calculus which reduces syntactic bureaucracy. In: Lynch, C. (ed.) RTA 2010. Leibniz International Proceedings in Informatics (LIPIcs), vol. 6, pp. 135–150. Schloss Dagstuhl–Leibniz-Zentrum für Informatik (2010), http://drops.dagstuhl.de/opus/volltexte/2010/2649
- 9.Straßburger, L.: From deep inference to proof nets. In: Bruscoli, P., Lamarche, F., Stewart, C. (eds.) Structures and Deduction. pp. 2–18. Technische Universität Dresden, iCALP Workshop (2005) ISSN 1430-211X, http://www.lix.polytechnique.fr/~lutz/papers/deepnet-SD05.pdf
- 10.Straßburger, L.: Extension without cut (2009), http://www.lix.polytechnique.fr/~lutz/papers/psppp.pdf (submitted)