Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Foundations of Software Science and Computational Structures

FoSSaCS 2012: Foundations of Software Science and Computational Structures pp 89–103Cite as

  1. Home
  2. Foundations of Software Science and Computational Structures
  3. Conference paper
Well-Pointed Coalgebras (Extended Abstract)

Well-Pointed Coalgebras (Extended Abstract)

  • Jiří Adámek17,
  • Stefan Milius17,
  • Lawrence S. Moss18 &
  • …
  • Lurdes Sousa19 
  • Conference paper
  • 969 Accesses

  • 3 Citations

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7213)

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.

Keywords

  • Binary Tree
  • Inverse Image
  • Full Subcategory
  • Regular Language
  • Label Transition System

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.

The full version containing all proofs is available at http://www.iti.cs.tu-bs.de/TI-INFO/milius/research/wellS.full.pdf

Download conference paper PDF

References

  1. Aczel, P.: Non-well-founded Sets. CSLL Lect. Notes, vol. 14. Stanford CSLI Publications, Stanford (1988)

    MATH  Google Scholar 

  2. Adámek, J.: Free algebras and automata realizations in the language of categories. Comment. Math. Univ. Carolinæ 15, 589–602 (1974)

    MATH  Google Scholar 

  3. Adámek, J., Herrlich, H., Strecker, G.E.: Abstract and Concrete Categories. John Wiley and Sons, New York (1990)

    MATH  Google Scholar 

  4. Adámek, J., Milius, S., Velebil, J.: Iterative algebras at work. Math. Structures Comput. Sci. 16, 1085–1131 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Adámek, J., Rosický, J.: Locally Presentable and Accessible Categories. Cambridge University Press (1994)

    Google Scholar 

  6. Capretta, V., Uustalu, T., Vene, V.: Recursive coalgebras from comonads. Inform. and Comput. 204, 437–468 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Gabriel, P., Ulmer, F.: Lokal präsentierbare Kategorien. Lecture Notes in Math., vol. 221. Springer, Berlin (1971)

    MATH  Google Scholar 

  8. Gumm, H.-P.: On minimal coalgebras. Appl. Categ. Structures 16, 313–332 (2008)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Manes, E.G., Arbib, M.A.: Algebraic Approaches to Program Semantics. Springer, New York (1986)

    MATH  Google Scholar 

  10. 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)

    Google Scholar 

  11. Nelson, E.: Iterative algebras. Theoret. Comput. Sci. 25, 67–94 (1983)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Osius, G.: Categorical set theory: a characterization of the category of sets. J. Pure Appl. Algebra 4, 79–119 (1974)

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249, 3–80 (2000)

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. 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)

    CrossRef  Google Scholar 

  15. Tarski, A.: A lattice theoretical fixed point theorem and its applications. Pacific J. Math. 5, 285–309 (1955)

    MathSciNet  MATH  Google Scholar 

  16. Taylor, P.: Towards a unified treatement of induction I: the general recursion theorem, preprint (1995–6), http://www.paultaylor.eu/ordinals/#towuti

  17. Taylor, P.: Practical Foundations of Mathematics. Cambridge University Press (1999)

    Google Scholar 

  18. Tiurin, J.: Unique fixed points vs. least fixed points. Theoret. Comput. Sci. 12, 229–254 (1980)

    CrossRef  MathSciNet  Google Scholar 

  19. Trnková, V.: On a descriptive classification of set functor I. Comment. Math. Univ. Carolinæ 12, 323–352 (1971)

    Google Scholar 

  20. Trnková, V., Adámek, J., Koubek, V., Reiterman, J.: Free algebras, input processes and free monads. Comment. Math. Univ. Carolinæ 16, 339–351 (1975)

    MATH  Google Scholar 

  21. Worrell, J.: On the final sequence of a finitary set functor. Theoret. Comput. Sci. 338, 184–199 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Theoretische Informatik, Technische Universität Braunschweig, Germany

    Jiří Adámek & Stefan Milius

  2. Department of Mathematics, Indiana University, Bloomington, IN, USA

    Lawrence S. Moss

  3. Departamento de Matemática, Instituto Politécnico de Viseu, Portugal

    Lurdes Sousa

Authors
  1. Jiří Adámek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Milius
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lawrence S. Moss
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lurdes Sousa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Lars Birkedal

Rights and permissions

Reprints 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

  • .RIS
  • .ENW
  • .BIB
  • 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)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature