AbstractWe give an axiomatic account of what structure on a category C and an endofunctor H on C yield similar structure on the category H —Coalg of H-coalgebras. We give conditions under which completeness, cocompleteness, symmetric monoidal closed structure, local presentability, and subobject classifiers lift. Our proof of the latter uses a general result about the existance of a subobject classifier in a category containing a small dense subcategory. Our leading example has C = Set with H the endofunctor for which a coalgebra is a finitely branching (labelled) transition system. We explain that example in detail
AbstractThis paper proves that (linear) quasi-isomorphisms and monomorphisms define a closed model c...
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (smal...
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H as the co...
AbstractWe give an axiomatic account of what structure on a category C and an endofunctor H on C yie...
AbstractThe category Class of classes and functions is proved to have a number of properties suitabl...
AbstractGiven an endofunctor F on the category of sets, we investigate how the structure theory of S...
We study categories of coalgebras for endofunctors, which additionally depend on a parameter categor...
AbstractThe notion of an endofunctor having “greatest subcoalgebras” is introduced as a form of comp...
AbstractThis paper presents an elementary and self-contained proof of an existence theorem of final ...
For deterministic systems, expressed as coalgebras over polynomial functors, every tree t (an elemen...
AbstractWe extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H a...
Classically, there are two model category structures on coalgebras in the category of chain complexe...
AbstractFor any Set-endofunctor F, the category SetF of F-coalgebras has preimages, i.e. pullbacks a...
In this paper the familiar construction of the category of coalgebras for a cartesian comonad is ext...
Coalgebras for a functor model different types of transition systems in auniform way. This paper foc...
AbstractThis paper proves that (linear) quasi-isomorphisms and monomorphisms define a closed model c...
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (smal...
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H as the co...
AbstractWe give an axiomatic account of what structure on a category C and an endofunctor H on C yie...
AbstractThe category Class of classes and functions is proved to have a number of properties suitabl...
AbstractGiven an endofunctor F on the category of sets, we investigate how the structure theory of S...
We study categories of coalgebras for endofunctors, which additionally depend on a parameter categor...
AbstractThe notion of an endofunctor having “greatest subcoalgebras” is introduced as a form of comp...
AbstractThis paper presents an elementary and self-contained proof of an existence theorem of final ...
For deterministic systems, expressed as coalgebras over polynomial functors, every tree t (an elemen...
AbstractWe extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H a...
Classically, there are two model category structures on coalgebras in the category of chain complexe...
AbstractFor any Set-endofunctor F, the category SetF of F-coalgebras has preimages, i.e. pullbacks a...
In this paper the familiar construction of the category of coalgebras for a cartesian comonad is ext...
Coalgebras for a functor model different types of transition systems in auniform way. This paper foc...
AbstractThis paper proves that (linear) quasi-isomorphisms and monomorphisms define a closed model c...
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (smal...
We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor H as the co...