Abstract
A characterization result for behaviorally definable classes of hidden algebras shows that a class of hidden algebras is behaviorally definable by equations if and only if it is closed under coproducts, quotients, morphisms and representative inclusions. The second part of the paper categorically generalizes this result to a framework of any category with coproducts, a final object and an inclusion system; this is general enough to include all coalgebra categories of interest. As a technical issue, the notions of equation and satisfaction are axiomatized in order to include the different approaches in the literature.
Original language | English (US) |
---|---|
Pages (from-to) | 176-193 |
Number of pages | 18 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 11 |
DOIs | |
State | Published - 1998 |
Externally published | Yes |
Event | CMCS '98, First Workshop on Coalgebraic Methods in Computer Science - Lisbon, Portugal Duration: Mar 28 1998 → Mar 29 1998 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)