On coalgebra based on classes
Logic in Computer Science
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.cs/0306118,
title = {On coalgebra based on classes},
author = {J. Adamek and S. Milius and J. Velebil},
journal= {arXiv preprint arXiv:cs/0306118},
year = {2007}
}