E-viri
PDF
Recenzirano
Odprti dostop
-
Beckmann, Arnold; Buss, Sam
Annals of pure and applied logic, October 2019, 2019-10-00, Letnik: 170, Številka: 10Journal Article
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.
