Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic (1998)
Cached
Download Links
- [www-theory.dcs.st-and.ac.uk]
- [www-theory.dcs.st-and.ac.uk]
- [www-theory.cs.st-and.ac.uk]
- DBLP
Other Repositories/Bibliography
by
Roy Dyckhoff
,
Luis Pinto
| Citations: | 38 - 6 self |
BibTeX
@MISC{Dyckhoff98cut-eliminationand,
author = {Roy Dyckhoff and Luis Pinto},
title = {Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are in 1-1 correspondence with the normal natural deduction proofs of intuitionistic logic. We present a simple proof of Herbelin's strong cutelimination theorem for the calculus, using the recursive path ordering theorem of Dershowitz.
