On Well-Founded and Recursive Coalgebras

This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive coalgebras for an endofunctor. For monomorphism preserving endofunctors on complete and well-powered categories every coalgebra has a well-founded part, and we provide a new, shorter proof that this is the coreflection in the category of all well-founded coalgebras. We present a new more general proof of Taylor’s General Recursion Theorem that every well-founded coalgebra is recursive, and we study conditions which imply the converse. In addition, we present a new equivalent characterization of well-foundedness: a coalgebra is well-founded iff it admits a coalgebra-to-algebra morphism to the initial algebra.

[1]  Paul Taylor,et al.  Towards a Unified Treatment of Induction , I : The General Recursion Theorem , 2006 .

[2]  J. Adámek,et al.  On Finitary Functors , 2019 .

[3]  Paul Taylor,et al.  Practical Foundations of Mathematics , 1999, Cambridge studies in advanced mathematics.

[4]  Jirí Adámek,et al.  Fixed points of functors , 2018, J. Log. Algebraic Methods Program..

[5]  Bart Jacobs,et al.  The temporal logic of coalgebras via Galois algebras , 2002, Mathematical Structures in Computer Science.

[6]  H. Peter Gumm.  From T-Coalgebras to Filter Structures and Transition Systems , 2005, CALCO.

[7]  Jirí Adámek,et al.  Abstract and Concrete Categories - The Joy of Cats , 1990 .

[8]  Adam Eppendahl.  Coalgebra-to-Algebra Morphisms , 1999, CTCS.

[9]  P. Freyd.  Abelian categories : an introduction to the theory of functors , 1965 .

[10]  Věra Trnková,et al.  Some properties of set functors , 1969 .

[11]  J. Adámek,et al.  Automata and Algebras in Categories , 1990 .

[12]  Alexandra Silva,et al.  Well-founded coalgebras, revisited , 2017, Math. Struct. Comput. Sci..

[13]  Václav Koubek,et al.  Free algebras, input processes and free monads , 1975 .

[14]  Venanzio Capretta,et al.  Corecursive Algebras: A Study of General Structured Corecursion , 2009, SBMF.

[15]  Věra Trnková,et al.  On descriptive classification of set-functors. II. , 1971 .

[16]  F. W. Lawvere.  QUANTIFIERS AND SHEAVES by , 2010 .

[17]  J. Lambek.  A fixpoint theorem for complete categories , 1968 .

[18]  Stefan Milius,et al.  A New Foundation for Finitary Corecursion and Iterative Algebras , 2018, Inf. Comput..

[19]  Stefan Milius.  Completely iterative algebras and completely iterative monads , 2005, Inf. Comput..

[20]  Jiří Adámek,et al.  Free algebras and automata realizations in the language of categories , 1974 .

[21]  Jirí Adámek,et al.  Recursive coalgebras of finitary functors , 2007, RAIRO Theor. Informatics Appl..

[22]  Gerhard Osius,et al.  Categorical set theory: A characterization of the category of sets , 1974 .

[23]  Venanzio Capretta,et al.  Recursive Coalgebras from Comonads , 2004, CMCS.

[24]  Stefan Milius,et al.  A Coalgebraic View on Reachability , 2019 .

[25]  J. Adámek,et al.  Locally Presentable and Accessible Categories: Bibliography , 1994 .

[26]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[27]  José Meseguer,et al.  Initiality, induction, and computability , 1986 .

[28]  Jirí Adámek,et al.  Well-Pointed Coalgebras , 2013, Log. Methods Comput. Sci..