ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Relative complexities of first order calculi
Relative complexities of first order calculi
Basic proof theory
Fundamenta Informaticae - Special issue on symbolic computation and artificial intelligence
On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Intuitionistic Proof Transformations and Their Application to Constructive Program Synthesis
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
The Nuprl Open Logical Environment
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
| Hi-index | 0.00 |
We present a polynomial translation of dag sequent proofs into tree sequent proofs for first-order classical and intuitionistic logic. The basic idea is to interpret a reference in a dag proof as a lemma application, which is then simulated using an application of the cut rule. The result of this translation is a tree proof with cuts, which are only applied in order to "factorize" identical subproofs. We illustrate a central application of the presented cut-based translation, that is automated extraction of modular programs from first-order intuitionistic proofs.