论文信息 - Proof Complexity of the Cut-free Calculus of Structures

Proof Complexity of the Cut-free Calculus of Structures

We investigate the proof complexity of analytic subsystems of the deep inference proof system SKSg (the calculus of structures). Exploiting the fact that the cut rule (i↑) of SKSg corresponds to the ¬-left rule in the sequent calculus, we establish that the ‘analytic'system KSg+c↑ has essentially the same complexity as the monotone Gentzen calculus MLK. In particular, KSg+c↑ quasipolynomially simulates SKSg, and admits polynomial-size proofs of some variants of the pigeonhole principle.

Emil Jerábek | Emil Jeřábek

[1] Alessio Guglielmi,et al. On the proof complexity of deep inference , 2009, TOCL.

[2] Kai Brünnler. Deep Inference and Its Normal Form of Derivations , 2006, CiE.

[3] Alessio Guglielmi,et al. A system of interaction and structure , 1999, TOCL.

[4] Ran Raz,et al. No feasible interpolation for TC/sup 0/-Frege proofs , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[5] Jan Kra,et al. Lower Bounds to the Size of Constant-depth Propositional Proofs , 1994 .

[6] Kai Brünnler. Deep inference and symmetry in classical proofs , 2003 .

[7] Pavel Pudlák,et al. Monotone simulations of nonmonotone proofs , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[8] Lutz Straßburger,et al. Non-commutativity and MELL in the Calculus of Structures , 2001, CSL.

[9] Samuel R. Buss. Polynomial Size Proofs of the Propositional Pigeonhole Principle , 1987, J. Symb. Log..

[10] Pavel Pudlák,et al. Monotone simulations of non-monotone proofs , 2001, J. Comput. Syst. Sci..

[11] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.