Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Additions and corrections to “Terminal coalgebras in well-founded set theory”
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Covarieties and complete covarieties
Theoretical Computer Science
Theoretical Computer Science - Logic, semantics and theory of programming
Terminal coalgebras and free iterative theories
Information and Computation
Coequational logic for accessible functors
Information and Computation
Quantitative Kleene coalgebras
Information and Computation
From grammars and automata to algebras and coalgebras
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
From T-coalgebras to filter structures and transition systems
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
| Hi-index | 0.00 |
We use some results of Trnková to show first that subcoalgebras are always closed under finite intersections. Assuming that the type functor F is bounded, we obtain a concrete representation of the terminal F-coalgebra. We also provide several equivalent characterizations of boundedness.