20 search results - page 3 / 4 » Confluence of Cut-Elimination Procedures for the Intuitionis... |
CORR
2010
Springer
14 years 9 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...
109
click to vote
ESOP
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
105
Voted
AIML
2006
14 years 11 months ago
2006
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference ...
CADE
2007
Springer
15 years 9 months ago
2007
Springer
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...
TABLEAUX
2009
Springer
15 years 4 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...