Equational axiomatizability for coalgebra
- 6 June 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 260 (1-2) , 229-247
- https://doi.org/10.1016/s0304-3975(00)00129-8
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Universal coalgebra: a theory of systemsTheoretical Computer Science, 2000
- Weak inclusion systemsMathematical Structures in Computer Science, 1997
- An approach to object semantics based on terminal co-algebrasMathematical Structures in Computer Science, 1995
- An Oxford survey of order sorted algebraMathematical Structures in Computer Science, 1994
- Institutions: abstract model theory for specification and programmingJournal of the ACM, 1992
- A simple algebraic proof of the equational interpolation theoremAlgebra universalis, 1991
- On notions of factorization systems and their applications to cone-injective subcategoriesPeriodica Mathematica Hungarica, 1982
- On the Structure of Abstract AlgebrasMathematical Proceedings of the Cambridge Philosophical Society, 1935