Abstract
For set functors 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. And the initial algebra consists of all well-pointed coalgebras that are well-founded in the sense of Taylor [16]. Finally, the initial iterative algebra consists of all finite well-pointed coalgebras. Numerous examples are discussed e.g. automata, graphs, and labeled transition systems.
The full version containing all proofs is available at http://www.iti.cs.tu-bs.de/TI-INFO/milius/research/wellS.full.pdf
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aczel, P.: Non-well-founded Sets. CSLL Lect. Notes, vol. 14. Stanford CSLI Publications, Stanford (1988)
Adámek, J.: Free algebras and automata realizations in the language of categories. Comment. Math. Univ. Carolinæ 15, 589–602 (1974)
Adámek, J., Herrlich, H., Strecker, G.E.: Abstract and Concrete Categories. John Wiley and Sons, New York (1990)
Adámek, J., Milius, S., Velebil, J.: Iterative algebras at work. Math. Structures Comput. Sci. 16, 1085–1131 (2006)
Adámek, J., Rosický, J.: Locally Presentable and Accessible Categories. Cambridge University Press (1994)
Capretta, V., Uustalu, T., Vene, V.: Recursive coalgebras from comonads. Inform. and Comput. 204, 437–468 (2006)
Gabriel, P., Ulmer, F.: Lokal präsentierbare Kategorien. Lecture Notes in Math., vol. 221. Springer, Berlin (1971)
Gumm, H.-P.: On minimal coalgebras. Appl. Categ. Structures 16, 313–332 (2008)
Manes, E.G., Arbib, M.A.: Algebraic Approaches to Program Semantics. Springer, New York (1986)
Milius, S.: A sound and complete calculus for finite stream circuits. In: Proc. 25th Annual Symposium on Logic in Computer Science (LICS 2010), pp. 449–458. IEEE Computer Society (2010)
Nelson, E.: Iterative algebras. Theoret. Comput. Sci. 25, 67–94 (1983)
Osius, G.: Categorical set theory: a characterization of the category of sets. J. Pure Appl. Algebra 4, 79–119 (1974)
Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249, 3–80 (2000)
Rutten, J.J.M.M., Turi, D.: On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1992. LNCS, vol. 666, pp. 477–530. Springer, Heidelberg (1993)
Tarski, A.: A lattice theoretical fixed point theorem and its applications. Pacific J. Math. 5, 285–309 (1955)
Taylor, P.: Towards a unified treatement of induction I: the general recursion theorem, preprint (1995–6), http://www.paultaylor.eu/ordinals/#towuti
Taylor, P.: Practical Foundations of Mathematics. Cambridge University Press (1999)
Tiurin, J.: Unique fixed points vs. least fixed points. Theoret. Comput. Sci. 12, 229–254 (1980)
Trnková, V.: On a descriptive classification of set functor I. Comment. Math. Univ. Carolinæ 12, 323–352 (1971)
Trnková, V., Adámek, J., Koubek, V., Reiterman, J.: Free algebras, input processes and free monads. Comment. Math. Univ. Carolinæ 16, 339–351 (1975)
Worrell, J.: On the final sequence of a finitary set functor. Theoret. Comput. Sci. 338, 184–199 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adámek, J., Milius, S., Moss, L.S., Sousa, L. (2012). Well-Pointed Coalgebras (Extended Abstract). In: Birkedal, L. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2012. Lecture Notes in Computer Science, vol 7213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28729-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-28729-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28728-2
Online ISBN: 978-3-642-28729-9
eBook Packages: Computer ScienceComputer Science (R0)