2003/06/20 by J. Adamek, Jiřı́ Adámek, Stefan Milius +5
Computer Science · #F.4.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Polynomial and algebraic computation #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0306118
arxiv created 2003/06/20 · openalex publication_date 2003/06/20 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.