Separation results for the size of constant-depth propositional proofs
Annals of Pure and Applied Logic 136 (1-2):30-55 (2005)
Abstract
This paper proves exponential separations between depth d-LK and depth -LK for every utilizing the order induction principle. As a consequence, we obtain an exponential separation between depth d-LK and depth -LK for . We investigate the relationship between the sequence-size, tree-size and height of depth d-LK-derivations for , and describe transformations between them. We define a general method to lift principles requiring exponential tree-size -LK-refutations for to principles requiring exponential sequence-size d-LK-refutations, which will be described for the Ramsey principle and d=0. From this we also deduce width lower bounds for resolution refutations of the Ramsey principleDOI
10.1016/j.apal.2005.05.002
My notes
Similar books and articles
Lower Bounds to the size of constant-depth propositional proofs.Jan Krajíček - 1994 - Journal of Symbolic Logic 59 (1):73-86.
A note on propositional proof complexity of some Ramsey-type statements.Jan Krajíček - 2011 - Archive for Mathematical Logic 50 (1-2):245-255.
Matrix identities and the pigeonhole principle.Michael Soltys & Alasdair Urquhart - 2004 - Archive for Mathematical Logic 43 (3):351-357.
Bounded Arithmetic, Propositional Logic and Complexity Theory.Jan Krajíček - 1995 - Cambridge University Press.
Polynomial size proofs of the propositional pigeonhole principle.Samuel R. Buss - 1987 - Journal of Symbolic Logic 52 (4):916-927.
A form of feasible interpolation for constant depth Frege systems.Jan Krajíček - 2010 - Journal of Symbolic Logic 75 (2):774-784.
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.
Sharpened lower bounds for cut elimination.Samuel R. Buss - 2012 - Journal of Symbolic Logic 77 (2):656-668.
Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
Simplified Lower Bounds for Propositional Proofs.Alasdair Urquhart & Xudong Fu - 1996 - Notre Dame Journal of Formal Logic 37 (4):523-544.
Combinatorics of first order structures and propositional proof systems.Jan Krajíček - 2004 - Archive for Mathematical Logic 43 (4):427-441.
Some remarks on lengths of propositional proofs.Samuel R. Buss - 1995 - Archive for Mathematical Logic 34 (6):377-394.
Analytics
Added to PP
2014-01-16
Downloads
19 (#590,037)
6 months
1 (#454,876)
2014-01-16
Downloads
19 (#590,037)
6 months
1 (#454,876)
Historical graph of downloads
Citations of this work
Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic.Arnold Beckmann & Samuel R. Buss - 2009 - Journal of Mathematical Logic 9 (1):103-138.
Propositional proofs and reductions between NP search problems.Samuel R. Buss & Alan S. Johnson - 2012 - Annals of Pure and Applied Logic 163 (9):1163-1182.
On transformations of constant depth propositional proofs.Arnold Beckmann & Sam Buss - 2019 - Annals of Pure and Applied Logic 170 (10):1176-1187.
The limits of tractability in Resolution-based propositional proof systems.Stefan Dantchev & Barnaby Martin - 2012 - Annals of Pure and Applied Logic 163 (6):656-668.
References found in this work
Lower Bounds to the size of constant-depth propositional proofs.Jan Krajíček - 1994 - Journal of Symbolic Logic 59 (1):73-86.
Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
Quantified propositional calculi and fragments of bounded arithmetic.Jan Krajíček & Pavel Pudlák - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (1):29-46.
Quantified propositional calculi and fragments of bounded arithmetic.Jan Krajíček & Pavel Pudlák - 1990 - Mathematical Logic Quarterly 36 (1):29-46.