Deleting Redundancy in Proof Reconstruction

Abstract

Abstract. We present a framework for eliminating redundancies during the reconstruction of sequent proofs from matrix proofs. We show that search-free proof reconstruction requires knowledge from the proof search process. We relate different levels of proof knowledge to reconstruction knowledge and analyze which redundancies can be deleted by using such knowledge. Our framework is uniformly applicable to classical logic and all non-classical logics which have a matrix characterization of validity and enables us to build adequate conversion procedures for each logic.

A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems

“…In general, decomposition problems give evidence that redundancies are not completely removed form ∝ . However, avoiding the decomposition problem and hence, search behavior during the transformation demands the integration of additional knowledge from the proof search into the reconstruction process [25,26].…”