Cut Admissibility by Saturation

@inproceedings{Burel2014CutAB,
  title={Cut Admissibility by Saturation},
  author={Guillaume Burel},
  booktitle={RTA-TLCA},
  year={2014}
}
Deduction modulo is a framework in which theories are integrated into proof systems such as natural deduction or sequent calculus by presenting them using rewriting rules. When only terms are rewritten, cut admissibility in those systems is equivalent to the confluence of the rewriting system, as shown by Dowek, RTA 2003, LNCS 2706. This is no longer true when considering rewriting rules involving propositions. In this paper, we show that, in the same way that it is possible to recover… CONTINUE READING
BETA

Similar Papers

Loading similar papers…