11 search results - page 2 / 3 » Cut-Elimination and Proof Search for Bi-Intuitionistic Tense... |
ICFP
2000
ACM
13 years 9 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
AIML
2006
13 years 6 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
2009
Springer
14 years 5 months ago
2009
Springer
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
TABLEAUX
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π0 1 -formulae and Π0 2 -...