Logics of time and computation
Logics of time and computation
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Handbook of logic in computer science (vol. 2)
On the greatest fixed point of a set functor
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Specifying coalgebras with modal logic
Theoretical Computer Science
From modal logic to terminal coalgebras
Theoretical Computer Science
Modal logic
Operations and equations for coalgebras
Mathematical Structures in Computer Science
Coalgebraic modal logic of finite rank
Mathematical Structures in Computer Science
ACM SIGACT News
Modular construction of complete coalgebraic logics
Theoretical Computer Science
Modular Games for Coalgebraic Fixed Point Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraising Subsequential Transducers
Electronic Notes in Theoretical Computer Science (ENTCS)
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Electronic Notes in Theoretical Computer Science (ENTCS)
Admissibility of Cut in Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Coequational Logic for Finitary Functors
Electronic Notes in Theoretical Computer Science (ENTCS)
Shallow Models for Non-iterative Modal Logics
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coalgebraic Perspective on Monotone Modal Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebraic Semantics for Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation for neighbourhood structures
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Beyond rank 1: algebraic semantics and finite models for coalgebraic logics
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Optimizing Conditional Logic Reasoning within CoLoSS
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterising behavioural equivalence: three sides of one coin
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Subsequential transducers: a coalgebraic perspective
Information and Computation
Presenting functors on many-sorted varieties and applications
Information and Computation
Cut elimination in coalgebraic logics
Information and Computation
Coequational logic for accessible functors
Information and Computation
Automata for coalgebras: an approach using predicate liftings
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Bisimulation proof methods in a path-based specification language for polynomial coalgebras
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
On monotone modalities and adjointness
Mathematical Structures in Computer Science
Model constructions for moss' coalgebraic logic
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
A finite model construction for coalgebraic modal logic
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Presenting functors by operations and equations
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Ultrafilter extensions for coalgebras
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Coalgebraic correspondence theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Optimal tableau algorithms for coalgebraic logics
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Global caching for coalgebraic description logics
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Modalities in the Stone age: A comparison of coalgebraic logics
Theoretical Computer Science
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Narcissists are easy, stepmothers are hard
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Coalgebraic announcement logics
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
The Logic of Exact Covers: Completeness and Uniform Interpolation
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 5.23 |
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.