paperbot · PL 论文追踪

RSS

Algebraic cocompleteness and finitary functors

LMCS vol.Volume 17, Issue 22021
Jiří Adámek

尚未生成 AI 速览(可能缺少 API key 或等待下次运行补跑)。

原文摘要(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.

链接与引用

DOI 原文 ·

BibTeX
@article{paperbot1305,
  title = {Algebraic cocompleteness and finitary functors},
  author = {Jiří Adámek},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 17, Issue 2},
  year = {2021},
  doi = {10.23638/lmcs-17(2:23)2021}
}