44 search results - page 4 / 9 » Rank-1 Modal Logics Are Coalgebraic |
IANDC
2006
13 years 6 months ago
2006
We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notio...
IANDC
2010
13 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...
TACAS
2010
Springer
14 years 1 months ago
2010
Springer
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...
FOSSACS
2009
Springer
14 years 28 days ago
2009
Springer
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...
ENTCS
2008
13 years 6 months ago
2008
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...