On coalgebra based on classes
J.Adamek, S. Milius, J. Velebil

TL;DR
This paper proves that every endofunctor on the category of classes is set-based, ensuring the existence of a final coalgebra and other fundamental properties, advancing coalgebra theory in class-based contexts.
Contribution
It establishes that all endofunctors on classes are set-based, leading to the existence of final coalgebras and free completely iterative theories.
Findings
Every endofunctor of classes is set-based.
Existence of a final coalgebra for these endofunctors.
Proof of a free completely iterative theory.
Abstract
Every endofunctor of the category of classes is proved to be set-based in the sense of Aczel and Mendler, therefore, it has a final coalgebra. Other basic properties of these endofunctors are proved, e.g. the existence of a free completely iterative theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Polynomial and algebraic computation · Logic, Reasoning, and Knowledge
