A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems
Christoph Kreitz, Stephan Schmitt · Information and Computation · 2000
We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified representations of matrix characterizations, of sequent calculi, and of prefixed sequent systems for various logics. The peculiarities of an individual logic are described by certain parameters of these representations, which are summarized in tables to be consulted by the conversion algorithm.