Abstract
We prove that the iterative construction of initial algebras converges for endofunctors F of many-sorted sets whenever F has an initial algebra. In the case of one-sorted sets, the convergence takes n steps where n is either an infinite regular cardinal or is at most 3. Dually, the existence of a many-sorted terminal coalgebra implies that the iterative construction of a terminal coalgebra converges. Moreover, every endofunctor with a fixed-point pair larger than the number of sorts is proved to have a terminal coalgebra. As demonstrated by James Worell, the number of steps here need not be a cardinal even in the case of a single sort: it is ω + ω for the finite power-set functor. The above results do not hold for related categories, such as graphs: we present non-constructive initial algebras and terminal coalgebras.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Representations of superassociative algebras by commutative functions with different types;Asian-European Journal of Mathematics;2023-09-30
2. Strong functors on many-sorted sets;Commentationes Mathematicae Universitatis Carolinae;2020-02-21
3. Fixed points of functors;Journal of Logical and Algebraic Methods in Programming;2018-02
4. A GHOST AT omega(1);LOG METH COMPUT SCI;2018
5. Fixed Points of Set Functors: How Many Iterations are Needed?;Applied Categorical Structures;2016-08-22