From modal logic to terminal coalgebras

DOI10.1016/S0304-3975(00)00128-6zbMath0973.68177WikidataQ127682297 ScholiaQ127682297MaRDI QIDQ5941165

M. Rö

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

modal logiccoalgebrafinal coalgebrapolynomial functorterminal coalgebra

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (13)

Coalgebraic modal logic: soundness, completeness and decidability of local consequence ⋮ Coalgebraic representations of distributive lattices with operators ⋮ Modular construction of complete coalgebraic logics ⋮ Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study ⋮ Bisimulation proof methods in a path-based specification language for polynomial coalgebras ⋮ Specifying coalgebras with modal logic ⋮ Expressive logics for coalgebras via terminal sequence induction ⋮ Final coalgebras for functors on measurable spaces ⋮ 2004 Annual Conference of the Australasian Association for Logic ⋮ A modal proof theory for final polynomial coalgebras ⋮ Definability, Canonical Models, Compactness for Finitary Coalgebraic Modal Logic ⋮ Final coalgebras and the Hennessy-Milner property ⋮ Coalgebras and monads in the semantics of Java

Cites Work

• Coalgebraic logic
• Universal coalgebra: A theory of systems
• Terminal coalgebras in well-founded set theory
• An approach to object semantics based on terminal co-algebras
• A final coalgebra theorem
• Mongruences and cofree coalgebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: From modal logic to terminal coalgebras