Axioms vs. rewrite rules: from completeness to cut elimination
Logic in Computer Science
2023-06-02 v1
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.
Cite
@article{arxiv.2306.00495,
title = {Axioms vs. rewrite rules: from completeness to cut elimination},
author = {Gilles Dowek},
journal= {arXiv preprint arXiv:2306.00495},
year = {2023}
}