中文

Recursion categories of coalgebras

范畴论 2007-05-23 v1 逻辑

摘要

We construct recursion categories from categories of coalgebras. Let FF be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category SetF\textbf{Set}_F of FF-coalgebras is complete. The category SetF\textbf{Set}_F may be embedded in the category PfnF\mathbf{Pfn}_F of FF-coalgebras and partial morphisms, which is a PP-category that is prodominical but not dominical in general. An existence theorem of A. Heller is applied to certain subcategories of PfnF\textbf{Pfn}_F to obtain examples of recursion categories of coalgebras.

关键词

引用

@article{arxiv.math/0105256,
  title  = {Recursion categories of coalgebras},
  author = {Florian Lengyel},
  journal= {arXiv preprint arXiv:math/0105256},
  year   = {2007}
}

备注

27 pages. Uses AMSLaTeX and xy-pic version 3.7