Sciweavers

7 search results - page 1 / 2
» Admissibility of Cut in Coalgebraic Logics
Sort
View
ENTCS
2008
126views more  ENTCS 2008»
13 years 4 months ago
Admissibility of Cut in Coalgebraic Logics
We study sequent calculi for propositional modal logics, interpreted over coalgebras, with admissibility of cut being the main result. As applications we present a new proof of th...
Dirk Pattinson, Lutz Schröder
IANDC
2010
119views more  IANDC 2010»
13 years 3 months ago
Cut elimination in coalgebraic logics
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
Dirk Pattinson, Lutz Schröder
CSL
2003
Springer
13 years 10 months ago
Atomic Cut Elimination for classical Logic
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...
Kai Brünnler
ENTCS
2008
132views more  ENTCS 2008»
13 years 4 months ago
A Meta Linear Logical Framework
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...
Andrew McCreight, Carsten Schürmann
AIML
2006
13 years 6 months ago
Deep Sequent Systems for Modal Logic
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 ...
Kai Brünnler