2024/04/30 by Schoen, Ezra, Kupke, Clemens, Rot, Jurriaan +1 · 1 citation
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
paper · doi:10.48550/arxiv.2405.00237
We define a framework for incorporating alternation-free fixpoint logics into the dual-adjunction setup for coalgebraic modal logics. We achieve this by using order-enriched categories. We give a least-solution semantics as well as an initial algebra semantics, and prove they are equivalent. We also show how to place the alternation-free coalgebraic μ-calculus in this framework, as well as PDL and a logic with a probabilistic dynamic modality.