52 search results - page 7 / 11 » Semantic Cut Elimination in the Intuitionistic Sequent Calcu... |
156
click to vote
ENTCS
2008
15 years 6 months ago
2008
Logical frameworks serve as meta-languages to represent deductive systems, sometimes requiring special purpose meta logics to reason about the representations. In this work, we de...
199
click to vote
TABLEAUX
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
189
click to vote
TABLEAUX
2009
Springer
16 years 17 days ago
2009
Springer
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
143
click to vote
CSL
2009
Springer
16 years 18 days ago
2009
Springer
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
181
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...