Abstract

This paper studies finitary modal logics, interpreted over coalgebras for an endofunctor, and establishes soundness, completeness and decidability results. The logics are studied within the abstract framework of coalgebraic modal logic, which can be instantiated with arbitrary endofunctors on the category of sets. This is achieved through the use of predicate liftings, which generalise atomic propositions and modal operators from Kripke models to arbitrary coalgebras. Predicate liftings also allow us to use induction along the terminal sequence of the underlying endofunctor as a proof principle. This induction principle is systematically exploited to establish soundness, completeness and decidability of the logics. We believe that this induction principle also opens new ways for reasoning about modal logics: Our proof of completeness does not rely on a canonical model construction, and the proof of the finite model property does not use filtrations. 1

Citations

421	Categories for the working mathematician - MacLane - 1971
353	Modal Logic - Blackburn, Rijke, et al. - 2001
117	Terminal coalgebras in well-founded set theory - Barr - 1993
85	The Logic of - Baltag, Moss, et al. - 1998
57	Specifying coalgebras with modal logic - Kurz - 2001
55	Structural induction and coinduction in a fibrational setting - Hermida, Jacobs - 1998
55	Logics for Coalgebras and Applications to Computer Science - Kurz - 2001
51	Many-sorted coalgebraic modal logic: a model-theoretic study - Jacobs - 2001
32	Coalgebras and modal logic - Rößiger
27	Semantical principles in the modal logic of coalgebras - Pattinson
22	V.: On the greatest fixed point of a set functor - Adámek, Koubek - 1995
14	Logics of Time and Computation, volume 7 of CSLI Lecture Notes - Goldblatt - 1992