Saturation Up to Redundancy for Tableau and Sequent Calculi
We discuss an adaptation of the technique of saturation up to redundancy, as introduced by Bachmair and Ganzinger , to tableau and sequent calculi for classical first-order logic. This technique can be used to easily show the completeness of optimized calculi that contain destructive rules e.g. for simplification, rewriting with equalities, etc., which is not easily done with a standard Hintikka-style completeness proof. The notions are first introduced for Smullyan-style ground tableaux, and then extended to constrained formula free-variable tableaux.
KeywordsFree Variable Sequent Calculus Ground Term Main Formula Close Rule
Unable to display preview. Download preview PDF.