Proof Transformation by CERES
Cut-elimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cut-elimination method CERES (cut-elimination by resolution) works by constructing a set of clauses from a proof with cuts. Any resolution refutation of this set then serves as a skeleton of an LK-proof with only atomic cuts.
In this paper we present an extension of CERES to a calculus LKDe which is stronger than the Gentzen calculus LK (it contains rules for introduction of definitions and equality rules). This extension makes it much easier to formalize mathematical proofs and increases the performance of the cut-elimination method. The system CERES already proved efficient in handling very large proofs.
KeywordsTheorem Prove Mathematical Proof Proof Theory Equality Rule Unary Rule
Unable to display preview. Download preview PDF.
- 8.Eder, E.: Relative complexities of first-order calculi. Vieweg (1992)Google Scholar
- 10.Girard, J.Y.: Proof Theory and Logical Complexity. In: Studies in Proof Theory, Bibliopolis, Napoli (1987)Google Scholar
- 16.Urban, C.: Classical Logic and Computation Ph.D. Thesis, University of Cambridge Computer Laboratory (2000)Google Scholar