Algebraic Semantics for Coalgebraic Logics
Clemens Kupke, Alexander Kurz, Dirk Pattinson
Abstract
Clemens Kupke, Alexander Kurz, Dirk Pattinson
Abstract
With coalgebras usually being defined in terms of an endofunctor T on sets, this paper shows that modal logics for T-coalgebras can be naturally described as functors L on boolean algebras. Building on this idea, we study soundness, completeness and expressiveness of coalgebraic logics from the perspective of duality theory. That is, given a logic L for coalgebras of an endofunctor T, we construct an endofunctor L such that L-algebras provide a sound and complete (algebraic) semantics of the logic. We show that if L is dual to T, then soundness and completeness of the algebraic semantics immediately yield the corresponding property of the coalgebraic semantics. We conclude by characterising duality between L and T in terms of the axioms of L. This provides a criterion for proving concretely given logics to be sound, complete and expressive.
OpenAlex reports 59 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
With coalgebras usually being defined in terms of an endofunctor T on sets, this paper shows that modal logics for T-coalgebras can be naturally described as functors L on boolean algebras. Building on this idea, we study soundness, completeness and expressiveness of coalgebraic logics from the perspective of duality theory. That is, given a logic L for coalgebras of an endofunctor T, we construct an endofunctor L such that L-algebras provide a sound and complete (algebraic) semantics of the logic. We show that if L is dual to T, then soundness and completeness of the algebraic semantics immediately yield the corresponding property of the coalgebraic semantics. We conclude by characterising duality between L and T in terms of the axioms of L. This provides a criterion for proving concretely given logics to be sound, complete and expressive.
Key concepts: Semantics (computer science), Algebraic number, Algebraic semantics, Algebra over a field, Mathematics, Algebraic specification, Programming language, Computer science