We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a Set-monad M for functors arising as liftings. As an application we introduce the notion of commuting pair of endofunctors with respect to the monad M and show that under reasonable assumptions, the final coalgebra of one of the endofunctors involved can be obtained as the free algebra generated by the initial algebra of the other endofunctor
We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this log...
AbstractA standard construction of the final coalgebra of an endofunctor involves defining a chain o...
AbstractThe notion of an endofunctor having “greatest subcoalgebras” is introduced as a form of comp...
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor as the comp...
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H as the co...
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H as the co...
AbstractWe extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H a...
AbstractWe extend Barr's well-known characterization of the final coalgebra of a Set-endofunctor as ...
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H as the co...
AbstractWe extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H a...
AbstractWhilst the relationship between initial algebras and monads is well-understood, the relation...
AbstractThe category Class of classes and functions is proved to have a number of properties suitabl...
AbstractThis paper presents an elementary and self-contained proof of an existence theorem of final ...
AbstractConsideration of categories of transition systems and related constructions leads to the stu...
We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this log...
We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this log...
AbstractA standard construction of the final coalgebra of an endofunctor involves defining a chain o...
AbstractThe notion of an endofunctor having “greatest subcoalgebras” is introduced as a form of comp...
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor as the comp...
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H as the co...
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H as the co...
AbstractWe extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H a...
AbstractWe extend Barr's well-known characterization of the final coalgebra of a Set-endofunctor as ...
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H as the co...
AbstractWe extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H a...
AbstractWhilst the relationship between initial algebras and monads is well-understood, the relation...
AbstractThe category Class of classes and functions is proved to have a number of properties suitabl...
AbstractThis paper presents an elementary and self-contained proof of an existence theorem of final ...
AbstractConsideration of categories of transition systems and related constructions leads to the stu...
We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this log...
We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this log...
AbstractA standard construction of the final coalgebra of an endofunctor involves defining a chain o...
AbstractThe notion of an endofunctor having “greatest subcoalgebras” is introduced as a form of comp...