Equational axiomatizability for coalgebra

DOI10.1016/S0304-3975(00)00129-8zbMath0973.68176OpenAlexW2059891142MaRDI QIDQ5941166

Grigore Roşu

Publication date: 20 August 2001

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00129-8

zbMATH Keywords

coalgebracategory theorylogicBirkhoff axiomatizability

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 (6)

Modal Operators for Coequations ⋮ Duality of Equations and Coequations via Contravariant Adjunctions ⋮ Behavioral abstraction is hiding information ⋮ Modal Predicates and Coequations ⋮ Towards Behavioral Maude ⋮ Factorization systems and fibrations

Cites Work

• On notions of factorization systems and their applications to cone- injective subcategories
• A simple algebraic proof of the equational interpolation theorem
• A hidden agenda
• Universal coalgebra: A theory of systems
• Semantics of computation
• Bisimulation and Hidden Algebra
• Institutions: abstract model theory for specification and programming
• An Oxford survey of order sorted algebra
• Weak inclusion systems
• An approach to object semantics based on terminal co-algebras
• Mongruences and cofree coalgebras
• Covarieties and complete covarieties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equational axiomatizability for coalgebra