English

Algebraic cocompleteness and finitary functors

Logic in Computer Science 2021-05-21 v2 Category Theory

Abstract

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.

Keywords

Cite

@article{arxiv.2102.06532,
  title  = {Algebraic cocompleteness and finitary functors},
  author = {Jiri Adamek},
  journal= {arXiv preprint arXiv:2102.06532},
  year   = {2021}
}

Comments

Accidental duplicate of arXiv:1903.02438

R2 v1 2026-06-23T23:06:13.840Z