Tags:Natural deduction, Proof theory, Sequent calculus and Translation
Abstract:
We present a simple and efficient translation of the classical multi-succedent sequent calculus LK to natural deduction. This translation aims to produce few excluded middle inferences, and to keep the quantifier complexity of the instances of excluded middle low. We evaluate the translation on proofs imported from resolution-based first-order theorem provers, and show that it achieves these goals in an efficient manner.
Efficient translation of sequent calculus proofs into natural deduction proofs