Admissibility of structural rules for contraction-free systems of intuitionistic logic

Journal of Symbolic Logic 65 (4):1499-1518 (2000)
Abstract
We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calculus G4ip for intuitionistic propositional logic and for a corresponding multi-succedent calculus: this proof extends easily in the presence of quantifiers, in contrast to other, indirect, proofs. i.e., those which use induction on sequent weight or appeal to admissibility of rules in other calculi
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2695061
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: 28,756
Through your library
References found in this work BETA
Bounds for Cut Elimination in Intuitionistic Propositional Logic.Jörg Hudelmaier - 1992 - Archive for Mathematical Logic 31 (5):331-353.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

22 ( #229,905 of 2,177,862 )

Recent downloads (6 months)

1 ( #317,245 of 2,177,862 )

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