100 search results - page 9 / 20 » A Schemata Calculus for Propositional Logic |
107
Voted
COMMA
2008
15 years 1 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...
108
Voted
IANDC
2010
14 years 11 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...
96
Voted
LPAR
2004
Springer
15 years 5 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...
113
Voted
CSL
2003
Springer
15 years 5 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...
92
Voted
BSL
1999
15 years 1 days 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...