Sciweavers

711 search results - page 4 / 143
» Modal Logics are Coalgebraic
Sort
View
IANDC
2010
119views more  IANDC 2010»
14 years 8 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
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
15 years 4 months ago
Optimal Tableau Algorithms for Coalgebraic Logics
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
Rajeev Goré, Clemens Kupke, Dirk Pattinson
ENTCS
2008
126views more  ENTCS 2008»
14 years 10 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
AIML
2008
14 years 11 months ago
Proof systems for the coalgebraic cover modality
abstract. We investigate an alternative presentation of classical and positive modal logic where the coalgebraic cover modality is taken as primitive. For each logic, we present a ...
Marta Bílková, Alessandra Palmigiano...
FOSSACS
2009
Springer
15 years 4 months ago
Coalgebraic Hybrid Logic
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...
Rob Myers, Dirk Pattinson, Lutz Schröder