Recursion categories of coalgebras
Abstract
We construct recursion categories from categories of coalgebras. Let F be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category SetF of F-coalgebras is complete. The category SetF may be embedded in the category PfnF of F-coalgebras and partial morphisms, which is a P-category that is prodominical but not dominical in general. An existence theorem of A. Heller is applied to certain subcategories of PfnF to obtain examples of recursion categories of coalgebras.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.