Sciweavers

14 search results - page 1 / 3
» Structural Cut Elimination: I. Intuitionistic and Classical ...
Sort
View
LICS
1995
IEEE
13 years 8 months ago
Structural Cut Elimination
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
Frank Pfenning
CSL
2003
Springer
13 years 10 months ago
Atomic Cut Elimination for classical Logic
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...
Kai Brünnler
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 4 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu
PADL
2004
Springer
13 years 10 months ago
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
Chiyan Chen, Dengping Zhu, Hongwei Xi