Affiliation:
1. University of Bath, Bath, UK
Abstract
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.
Funder
Engineering and Physical Sciences Research Council
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference48 articles.
1. Atomic Cut Elimination for Classical Logic
2. Two Restrictions on Contraction
3. Brünnler K. 2004. Deep Inference and Symmetry in Classical Proofs. Logos Berlin. http://www.iam.unibe.ch/~kai/Papers/phd.pdf. Brünnler K. 2004. Deep Inference and Symmetry in Classical Proofs. Logos Berlin. http://www.iam.unibe.ch/~kai/Papers/phd.pdf.
4. Cut Elimination inside a Deep Inference System for Classical Predicate Logic
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献