Well-pointed Coalgebras

Journal article

Publication Details

Author(s): Adámek J, Milius S, Moss L, Sousa L
Journal: Logical Methods in Computer Science
Publisher: IfCoLog (International Federation of Computational Logic) / Technical University of Braunschweig
Publication year: 2013
Volume: 9
Journal issue: (3:2)
Pages range: 51
ISSN: 1860-5974


For endofunctors of varieties preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper subobject and no proper quotient. The initial algebra consists of all well-pointed coalgebras that are well-founded in the sense of Osius and Taylor. And initial algebras are precisely the final well-founded coalgebras. Finally, the initial iterative algebra consists of all finite wellpointed coalgebras. Numerous examples are discussed e.g. automata, graphs, and labeled transition systems. ©J. Adámek, S. Milius, L. S. Moss, and L. Sousa.

FAU Authors / FAU Editors

Milius, Stefan apl. Prof. Dr.
Lehrstuhl für Informatik 8 (Theoretische Informatik)

External institutions with authors

Indiana University
Technische Universität Braunschweig
Universidade de Coimbra

How to cite

Adámek, J., Milius, S., Moss, L., & Sousa, L. (2013). Well-pointed Coalgebras. Logical Methods in Computer Science, 9((3:2)), 51. https://dx.doi.org/10.2168/LMCS-9(3:2)2013

Adámek, Jiří, et al. "Well-pointed Coalgebras." Logical Methods in Computer Science 9.(3:2) (2013): 51.


Last updated on 2019-16-01 at 09:47