Cut-elimination and a permutation-free sequent calculus for intuitionistic logic

Studia Logica 60 (1):107-118 (1998)
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 cut-elimination theorem for the calculus, using the recursive path ordering theorem of Dershowitz.
Keywords Cut-elimination  normalisation  natural deduction  intuitionistic logic  recursive path ordering  termination
Categories (categorize this paper)
DOI 10.1023/A:1005099619660
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,173
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
1999 Spring Meeting of the Association for Symbolic Logic.Charles Parsons - 1999 - Bulletin of Symbolic Logic 5 (4):479-484.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

60 ( #84,931 of 2,152,625 )

Recent downloads (6 months)

3 ( #225,818 of 2,152,625 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums