Equational axiomatizability for coalgebra

Research output: Contribution to journalArticlepeer-review

Abstract

A characterization result for equationally definable classes of certain coalgebras (including basic hidden algebra) shows that a class of coalgebras is definable by equations if and only if it is closed under coproducts, quotients, sources of morphisms and representative inclusions. The notions of equation and satisfaction are axiomatized in order to include the different approaches in the literature.

Original languageEnglish (US)
Pages (from-to)229-247
Number of pages19
JournalTheoretical Computer Science
Volume260
Issue number1-2
DOIs
StatePublished - 2001
Externally publishedYes

Keywords

  • Birkhoff axiomatizability
  • Category theory
  • Coalgebra
  • Logic

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Equational axiomatizability for coalgebra'. Together they form a unique fingerprint.

Cite this