Non-well-founded sets modeled as ideal fixed points
Information and Computation
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
On the greatest fixed point of a set functor
Theoretical Computer Science
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
A small final coalgebra theorem
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Category Theory and Computer Science
On final coalgebras of continuous functors
Theoretical Computer Science - Category theory and computer science
Final coalgebras as greatest fixed points in ZF set theory
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
A compositional approach to defining logics for coalgebras
Theoretical Computer Science - Selected papers of CMCS'03
Completely iterative algebras and completely iterative monads
Information and Computation
Terminal coalgebras and free iterative theories
Information and Computation
Mathematical Structures in Computer Science
The category-theoretic solution of recursive program schemes
Theoretical Computer Science - Algebra and coalgebra in computer science
Modular construction of complete coalgebraic logics
Theoretical Computer Science
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
Coequational Logic for Finitary Functors
Electronic Notes in Theoretical Computer Science (ENTCS)
Terminal Sequence Induction via Games
Logic, Language, and Computation
Completely iterative algebras and completely iterative monads
Information and Computation
Free modal algebras: a coalgebraic perspective
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Electronic Notes in Theoretical Computer Science (ENTCS)
Equational properties of iterative monads
Information and Computation
Coequational logic for accessible functors
Information and Computation
Pointwise extensions of gsos-defined operations
Mathematical Structures in Computer Science
Initial algebras and terminal coalgebras in many-sorted sets
Mathematical Structures in Computer Science
Connections of coalgebra and semantic modeling
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Realization of Coinductive Types
Electronic Notes in Theoretical Computer Science (ENTCS)
The category theoretic solution of recursive program schemes
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
CIA structures and the semantics of recursion
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
A coalgebraic perspective on minimization and determinization
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Well-Pointed coalgebras (extended abstract)
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
ACM Transactions on Computational Logic (TOCL)
Coinductive Predicates and Final Sequences in a Fibration
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 5.23 |
A standard construction of the final coalgebra of an endofunctor involves defining a chain of iterates, starting at the final object of the underlying category and successively applying the functor. In this paper we show that, for a finitary set functor, this construction always yields a final coalgebra in ω2 = ω + ω steps.