A small final coalgebra theorem

This paper presents an elementary and self-contained proof of an existence theorem of final coalgebras for endofunctors on the category of sets and functions.

[1]  J. Rutten,et al.  On the Foundations of Final Semantics: Non-standard Sets, Metric Spaces, Partial Orders on the Foundations of Final Semantics: Non-standard Sets, Metric Spaces, Partial Orders , 1998 .

[2]  A. R. D. Mathias,et al.  NON‐WELL‐FOUNDED SETS (CSLI Lecture Notes 14) , 1991 .

[3]  S. Lane.  Categories for the Working Mathematician , 1971 .

[4]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[5]  Jean-Claude Raoult,et al.  On graph rewritings , 1984, Bull. EATCS.

[6]  Yoshihiro Mizoguchi,et al.  A graph structure over the category of sets and partial functions , 1992 .

[7]  Jirí Adámek,et al.  On the Greatest Fixed Point of a Set Functor , 1995, Theor. Comput. Sci..

[8]  Jan J. M. M. Rutten,et al.  Initial Algebra and Final Coalgebra Semantics for Concurrency , 1993, REX School/Symposium.

[9]  Jan J. M. M. Rutten,et al.  On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders , 1992, REX Workshop.

[10]  J. Rutten.  A calculus of transition systems (towards universal coalgebra) , 1995 .

[11]  Peter Aczel,et al.  A Final Coalgebra Theorem , 1989, Category Theory and Computer Science.

[12]  Yasuo Kawahara,et al.  Relational Structures and Their Partial Morphisms in View of Single Pushout Rewriting , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[13]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[14]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.