100 search results - page 9 / 20 » A Schemata Calculus for Propositional Logic |
160
click to vote
COMMA
2008
15 years 7 months ago
2008
Proposals for logic-based argumentation have the potential to be adapted for handling diverse kinds of knowledge. In this paper, a calculus for representing temporal knowledge is p...
159
click to vote
IANDC
2010
15 years 4 months ago
2010
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
167
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...
173
click to vote
CSL
2003
Springer
15 years 11 months ago
2003
Springer
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...
149
click to vote
BSL
1999
15 years 5 months ago
1999
We consider a classical (propositional) version, CBI, of O'Hearn and Pym's logic of bunched implications (BI) from a model- and prooftheoretic perspective. We present a c...