Arnold Beckmann and Sam Buss
Annals of Pure and Applied Logic, Volume 170, Issue 10, pp. 1176-1187
Publication year: 2019

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.