Revisiting Space in Proof Complexity: Treewidth and Pathwidth

Abstract So-called ordered variants of the classical notions of pathwidth and treewidth are introduced and proposed as proof theoretically meaningful complexity measures for the directed acyclic graphs underlying proofs. The ordered pathwidth of a proof is shown to be roughly the same as its formula space. Length-space lower bounds for R ( k )-refutations are generalized to arbitrary infinity axioms and strengthened in that the space measure is relaxed to ordered treewidth.

Authors

• Moritz Müller
• Stefan Szeider

Keywords

No keywords are indexed for this paper.