52 search results - page 7 / 11 » Semantic Cut Elimination in the Intuitionistic Sequent Calcu... |
ENTCS
2008
13 years 8 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...
TABLEAUX
2009
Springer
14 years 1 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...
TABLEAUX
2009
Springer
14 years 3 months 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...
CSL
2009
Springer
14 years 3 months 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 ...
CORR
2010
Springer
13 years 8 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...