This paper studies the complexity of constant depth propositional proofs in the cedent and sequent calculus. We discuss the relationships between the size of tree-like proofs, the size of dag-like proofs, and the heights of proofs. The main result is to correct a proof construction in an earlier paper about transformations from proofs with polylogarithmic height and constantly many formulas per cedent
Propositional Proof Complexity is the area of Computational Complexity that studies the length of pr...
In their paper on the ''chasm at depth four'', Agrawal and Vinay have shown that polynomials in m va...
ropositional proof complexity is the study of the resources that are needed to prove formulas in pro...
We prove lower bounds of the form exp (n " d ) ; " d ? 0; on the length of proofs of an ...
We consider three relatively strong families of subsystems of AC0[2]-Frege proof systems, i.e., prop...
Abstract. Height restricted resolution (proofs or refutations) is a nat-ural restriction of resoluti...
A major open problem in proof complexity is to prove super-polynomial lower bounds for $AC^0[p]$-Fre...
A major open problem in proof complexity is to prove superpolynomial lower bounds for AC0[p]-Frege p...
We exhibit an unusually strong trade-off between resolution proof width and tree-like proof size. Na...
This paper proves exponential separations between depth d-LK and depth (d+1/2)-LK for every d in 0, ...
This paper is a contribution to our understanding of the relationship between uniform and nonuniform...
Abstract. By introducing a parallel extension rule that is aware of inde-pendence of the introduced ...
ii Consider the following variant of quantified propositional logic. A new, parallel extension rule ...
Abstract. In this paper we prove an exponential lower bound on the size of bounded-depth Frege proof...
We introduce new proof systems for propositional logic, simple deduction Frege systems, general dedu...
Propositional Proof Complexity is the area of Computational Complexity that studies the length of pr...
In their paper on the ''chasm at depth four'', Agrawal and Vinay have shown that polynomials in m va...
ropositional proof complexity is the study of the resources that are needed to prove formulas in pro...
We prove lower bounds of the form exp (n " d ) ; " d ? 0; on the length of proofs of an ...
We consider three relatively strong families of subsystems of AC0[2]-Frege proof systems, i.e., prop...
Abstract. Height restricted resolution (proofs or refutations) is a nat-ural restriction of resoluti...
A major open problem in proof complexity is to prove super-polynomial lower bounds for $AC^0[p]$-Fre...
A major open problem in proof complexity is to prove superpolynomial lower bounds for AC0[p]-Frege p...
We exhibit an unusually strong trade-off between resolution proof width and tree-like proof size. Na...
This paper proves exponential separations between depth d-LK and depth (d+1/2)-LK for every d in 0, ...
This paper is a contribution to our understanding of the relationship between uniform and nonuniform...
Abstract. By introducing a parallel extension rule that is aware of inde-pendence of the introduced ...
ii Consider the following variant of quantified propositional logic. A new, parallel extension rule ...
Abstract. In this paper we prove an exponential lower bound on the size of bounded-depth Frege proof...
We introduce new proof systems for propositional logic, simple deduction Frege systems, general dedu...
Propositional Proof Complexity is the area of Computational Complexity that studies the length of pr...
In their paper on the ''chasm at depth four'', Agrawal and Vinay have shown that polynomials in m va...
ropositional proof complexity is the study of the resources that are needed to prove formulas in pro...
DOI
Add to ORKG