Results

**1 - 1**of**1**### 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 \Pi. Any resol ..."

Abstract
- Add to MetaCart

(Show Context)
. 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 \Pi. Any resolution refutation / of C then serves as a skeleton for an LK-proof \Sigma of the original end-sequent, containing only atomic cuts; \Sigma can be constructed from / and \Pi by projections. Note, that a proof with atomic cuts provides the same information as a cut-free proof. 1 Introduction The use of lemmas in mathematical proofs lies at the very centre of mathematical reasoning; by the use of lemmas it is possible to structure the proof and hence to improve its readability and understandability. Therefore a real mathematical proof (modelled within a sequent calculus) always contains cuts; in the practice of mathematics the elimination of these cuts is, in most cases, not only useless bu...