Proving isomorphism of first-order logic proof systems in HOL

Abstract

We prove in HOL that three proof systems for classical first-order predicate logic, the Hilbertian axiomatization, the system of natural deduction, and a variant of sequent calculus, are isomorphic. The isomorphism is in the sense that provability of a conclusion from hypotheses in one of these proof systems is equivalent to provability of this conclusion from the same hypotheses in the others. Proving isomorphism of these three proof systems allows us to guarantee that meta-logical provability properties about one of them would also hold in relation to the others. We prove the deduction, monotonicity, and compactness theorems for Hilbertian axiomatization, and the substitution theorem for the system of natural deduction. Then we show how these properties can be translated between the proof systems. Besides, by proving a theorem which states that provability in flattened sequent calculus implies provability in standard sequent calculus, we show how some meta-logical provability results about Hilbertian axiomatization and natural deduction can be translated to sequent calculus. We use higher-order logic as the metalogic for reasoning about first-order proof systems and formalize proofs in a theorem-proving environment, thereupon reducing susceptibility to errors and bringing up subtle issues which are usually overlooked when the reasoning is done in a natural language.KeywordsInference RuleProof SystemCompactness TheoremNatural DeductionSequent CalculusThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.