Well-pointed Coalgebras

Adámek J, Milius S, Moss L, Sousa L (2013)

Publication Type: Journal article

Publication year: 2013

Journal

Logical Methods in Computer Science Logical Methods in Computer Science e.V.

Publisher: IfCoLog (International Federation of Computational Logic) / Technical University of Braunschweig

Book Volume: 9

Pages Range: 51

Journal Issue: (3:2)

URI: http://www.lmcs-online.org/ojs/viewarticle.php?id=1220&layout=abstract

DOI: 10.2168/LMCS-9(3:2)2013

Abstract

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.

Authors with CRIS profile

Stefan Milius Lehrstuhl für Informatik 8 (Theoretische Informatik)

Involved external institutions

Technische Universität Braunschweig DE Germany (DE) Indiana University US United States (USA) (US) Universidade de Coimbra PT Portugal (PT)

How to cite

APA:

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

MLA:

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

BibTeX: Download