Equational axiomatizability for coalgebra

Authors
Citation
G. Rosu, Equational axiomatizability for coalgebra, THEOR COMP, 260(1-2), 2001, pp. 229-247
Citations number
35
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975 → ACNP
Volume
260
Issue
1-2
Year of publication
2001
Pages
229 - 247
Database
ISI
SICI code
0304-3975(20010606)260:1-2<229:EAFC>2.0.ZU;2-5
Abstract
A characterization result for equationally definable classes of certain coa lgebras (including basic hidden algebra) shows that a class of coalgebras i s definable by equations if and only if it is closed under coproducts, quot ients, sources of morphisms and representative inclusions. The notions of e quation and satisfaction are axiomatized in order to include the different approaches in the literature. (C) 2001 Elsevier Science B.V. All rights res erved.