Sciweavers

FOSSACS
2009
Springer

Coalgebraic Hybrid Logic

13 years 10 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 for reasoning about individual states in a model. This framework, coalgebraic hybrid logic, works at the same level of generality as coalgebraic modal logic, and in particular subsumes, besides normal hybrid logics such as hybrid K, a wide variety of logics with non-normal modal operators such as probabilistic, graded, or coalitional modalities and non-monotonic conditionals. We prove a generic finite model property and an ensuing weak completeness result, and we give a semantic criterion for decidability in PSPACE. Moreover, we present a fully internalised PSPACE tableau calculus. These generic results are easily instantiated to particular hybrid logics and thus yield a wide range of new results, including e.g. decidability in PSPACE of probabilistic and graded hybrid logics.
Rob Myers, Dirk Pattinson, Lutz Schröder
Added 19 May 2010
Updated 19 May 2010
Type Conference
Year 2009
Where FOSSACS
Authors Rob Myers, Dirk Pattinson, Lutz Schröder
Comments (0)