Jiří Adámek - Algebraic cocompleteness and finitary functors

lmcs:6163 - Logical Methods in Computer Science, May 28, 2021, Volume 17, Issue 2 - https://doi.org/10.23638/LMCS-17(2:23)2021
Algebraic cocompleteness and finitary functorsArticle

Authors: Jiří Adámek

A number of categories is presented that are algebraically complete and cocomplete, i.e., every endofunctor has an initial algebra and a terminal coalgebra. For all finitary (and, more generally, all precontinuous) set functors the initial algebra and terminal coalgebra are proved to carry a canonical partial order with the same ideal CPO-completion. And they also both carry a canonical ultrametric with the same Cauchy completion.


Volume: Volume 17, Issue 2
Secondary volumes: Selected Papers of the 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
Published on: May 28, 2021
Accepted on: May 26, 2021
Submitted on: February 27, 2020
Keywords: Mathematics - Category Theory, 18A22, 68Q65

Classifications

Consultation statistics

This page has been seen 3054 times.
This article's PDF has been downloaded 387 times.