arXiv Analytics

Sign in

arXiv:1203.4754 [cs.LO]AbstractReferencesReviewsResources

Computational interpretation of classical logic with explicit structural rules

Silvia Ghilezan, Pierre Lescanne, Dragisa Zunic

Published 2012-03-21Version 1

We present a calculus providing a Curry-Howard correspondence to classical logic represented in the sequent calculus with explicit structural rules, namely weakening and contraction. These structural rules introduce explicit erasure and duplication of terms, respectively. We present a type system for which we prove the type-preservation under reduction. A mutual relation with classical calculus featuring implicit structural rules has been studied in detail. From this analysis we derive strong normalisation property.

Related articles: Most relevant | Search more
arXiv:1706.08689 [cs.LO] (Published 2017-06-27)
Merging fragments of classical logic
arXiv:1409.3316 [cs.LO] (Published 2014-09-11)
Confluence for classical logic through the distinction between values and computations
arXiv:1810.05879 [cs.LO] (Published 2018-10-13)
Combining fragments of classical logic: When are interaction principles needed?