Recursion categories of coalgebras
Florian Lengyel
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.
Create a lesson
Related papers
Cocompactness and Presentability
Thorger Geiß, Phil Pützstück, Maxime Ramzi
Gabriel--Zisman Localizations, Products, Coproducts, and Product Categories
Chencheng Zhang
An abelian envelope without the quotient property
Johannes Flake, Jonathan Gruber, Thorsten Heidersdorf
On Models of the Planar Lambda Calculus
Chad Nester
Mixing Extriangulated Model Structures
Junpeng Ren, Xianhui Fu
Grothendieck Topologies Are Extensional Presentations of the Form of Sieves
Roy Ferguson, Zurab Janelidze