Duality of Equations and Coequations via Contravariant Adjunctions
From MaRDI portal
Publication:5739450
DOI10.1007/978-3-319-40370-0_6zbMath1475.18005OpenAlexW2496522058MaRDI QIDQ5739450
Jurriaan Rot, Marcello M. Bonsangue, Julian Salamanca
Publication date: 15 July 2016
Published in: Coalgebraic Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/25191
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The dual equivalence of equations and coequations for automata
- Coequational logic for accessible functors
- Coalgebraic constructions of canonical nondeterministic automata
- Structural induction and coinduction in a fibrational setting
- Universal coalgebra: A theory of systems
- Trace semantics via determinization
- Regular Varieties of Automata and Coequations
- Equations and Coequations for Weighted Automata
- Coalgebraic Trace Semantics via Forgetful Logics
- Exemplaric Expressivity of Modal Logics
- Duality and Equational Theory of Regular Languages
- Testing Semantics: Connecting Processes and Process Logics
- Modal operators and the formal dual of Birkhoffs completeness theorem This research is part of the Logic of Types and Computation project at Carnegie Mellon University under the direction of Dana Scott.
- Operations and equations for coalgebras
- Computer Science Logic
- Theoretical Aspects of Computing – ICTAC 2005
- Generalized Eilenberg Theorem I: Local Varieties of Languages
- Category Theory
- Foundations of Software Science and Computational Structures
- Equational axiomatizability for coalgebra
This page was built for publication: Duality of Equations and Coequations via Contravariant Adjunctions
