Initial algebras and terminal coalgebras in many-sorted sets

  • Authors:

  • Ji???? Ad??mek;V??ra Trnkov??

  • Affiliations:

  • Institut f??r theoretische informatik, technische universit??t braunschweig, germany email: j.adamek@tu-bs.de;Mathematical institute, charles university prague, prague, czech republic email: trnkova@karlin.mff.cuni.cz

  • Venue:
  • Mathematical Structures in Computer Science
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.