Distributivity of categories of coalgebras

DOI10.1016/S0304-3975(02)00582-0MaRDI QIDQ1884878zbMATH OpenOpenAlexFDO

Authors H. Peter Gumm, Jesse Hughes, T. Schröder

Publication date 27 October 2004

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(02)00582-0

Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Special categories (18B99) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Review text

Categories of coalgebras for an endofunctor (of the category of sets, or of something fairly similar) play an important role in the semantics of computation. One conceptual difficulty in working with such categories is that, whilst the forgetful functor to the underlying category creates colimits, it does not in general create limits; in particular, products in such categories tend to be hard to describe. In this paper, the authors investigate when finite products distribute over finite coproducts in a category of coalgebras, and the closely related question of when such a category is extensive. Unsurprisingly, their results turn out to be similar to those obtained by the reviewer, \textit{J.~Power, T.~Tsujishita, H.~Watanabe} and \textit{J.~Worrell} [Theor. Comput. Sci. 260, 87--117 (2001; Zbl 0973.68178)] on the question of when such a category is a topos.

Recommendations

Cites work

Cited in

(6)

This page was built for publication: Distributivity of categories of coalgebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884878)