System Description: CutRes 0.1: Cut Elimination by Resolution
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LK- proof with atomic cuts only. The elimination of cuts is performed in the following way: An unsatisfiable set of clauses C is assigned to a given LK-proof П. Any resolution refutation ψ of C then serves as a skeleton for an LK-proof Σ of the original end-sequent, containing only atomic cuts; Σ can be constructed from ψ and П by projections. Note, that a proof with atomic cuts provides the same information as a cut-free proof.
KeywordsProof Theory Sequent Calculus Resolution Proof Resolution Refutation Proof Length
Unable to display preview. Download preview PDF.
- BL99.M. Baaz and A. Leitsch. Cut elimination by resolution. J. Symbolic Computation, 1999. To appear.Google Scholar
- Gir87.J. Y. Girard. Proof Theory and Logical Complexity, volume 1 of Studies in Proof Theory, Monographs. Bibliopolis, Napoli, Italy, 1987.Google Scholar
- HB70.D. Hilbert and P. Bernays. Grundlagen der Mathematik 2. Spinger Verlag, 1970.Google Scholar
- Her71.J. Herbrand. Jacques Herbrand: Logical Writings. D. Reidel Publishing Company, Holland, 1971.Google Scholar