2000 character limit reached
Axioms vs. rewrite rules: from completeness to cut elimination (2306.00495v1)
Published 1 Jun 2023 in cs.LO
Abstract: Combining a standard proof search method, such as resolution or tableaux, and rewriting is a powerful way to cut off search space in automated theorem proving, but proving the completeness of such combined methods may be challenging. It may require in particular to prove cut elimination for an extended notion of proof that combines deductions and computations. This suggests new interactions between automated theorem proving and proof theory.