A categorical approach to coalgebraic fixpoint logic

Ezra Schoen*, Clemens Kupke, Jurriaan Rot, Ruben Turkenburg

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

Abstract

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.

Original languageEnglish
Title of host publicationCoalgebraic Methods in Computer Science - 17th IFIP WG 1.3 International Workshop, CMCS 2024, Colocated with ETAPS 2024, Proceedings
EditorsBarbara König, Henning Urbat
PublisherSpringer Science and Business Media Deutschland GmbH
Pages23-43
Number of pages21
ISBN (Print)9783031664373
DOIs
Publication statusPublished - Aug 2024
Event17th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2024 - Luxembourg City, Luxembourg
Duration: 6 Apr 20247 Apr 2024

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14617 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2024
Country/TerritoryLuxembourg
CityLuxembourg City
Period6/04/247/04/24

Funding

This research is partially supported by the Leverhulme Trust Research Project Grant RPG-2020-232 and NWO grant No. OCENW.M20.053

Keywords

  • fixpoint logics

Fingerprint

Dive into the research topics of 'A categorical approach to coalgebraic fixpoint logic'. Together they form a unique fingerprint.

Cite this