AbstractIn this paper we extend the theory of serial and uniserial finite dimensional algebras to coalgebras of arbitrary dimension. Nakayama–Skorniakov Theorems are proved in this new setting and the structure of such coalgebras is determined up to Morita–Takeuchi equivalences. Our main structure theorem asserts that over an algebraically closed field k the basic coalgebra of a serial indecomposable coalgebra is a subcoalgebra of a path coalgebra kΓ where the quiver Γ is either a cycle or a chain (finite or infinite). In the uniserial case, Γ is either a single point or a loop. For cocommutative coalgebras, an explicit description is given, serial coalgebras are uniserial and these are isomorphic to a direct sum of subcoalgebras of the div...
For deterministic systems, expressed as coalgebras over polynomial functors, every tree t (an elemen...
AbstractFor coalgebras over fields, there is a well-known construction which gives the cofree coalge...
AbstractIn this paper we show that it is possible to model observable behaviour of coalgebras indepe...
AbstractIn this paper we extend the theory of serial and uniserial finite dimensional algebras to co...
AbstractWe study serial coalgebras by means of their valued Gabriel quivers. In particular, Hom-comp...
AbstractWe show that coalgebras whose lattice of right coideals is distributive are coproducts of co...
Abstract. This paper constructs model structures on the categories of coal-gebras and pointed irredu...
We prove that the simplicial cocommutative coalgebra of singular chains on a connected topological s...
AbstractThe notion of an endofunctor having “greatest subcoalgebras” is introduced as a form of comp...
Abstract In this paper we dene coprime subcoalgebra and we characterize nite dimensional coprime co...
AbstractDana Scott’s model of λ-calculus was based on a limit construction which started from an alg...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
AbstractLogical definability is investigated for certain classes of coalgebras related to state-tran...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
. We introduce a convenient category of combinatorial objects, known as cell-sets, on which we study...
For deterministic systems, expressed as coalgebras over polynomial functors, every tree t (an elemen...
AbstractFor coalgebras over fields, there is a well-known construction which gives the cofree coalge...
AbstractIn this paper we show that it is possible to model observable behaviour of coalgebras indepe...
AbstractIn this paper we extend the theory of serial and uniserial finite dimensional algebras to co...
AbstractWe study serial coalgebras by means of their valued Gabriel quivers. In particular, Hom-comp...
AbstractWe show that coalgebras whose lattice of right coideals is distributive are coproducts of co...
Abstract. This paper constructs model structures on the categories of coal-gebras and pointed irredu...
We prove that the simplicial cocommutative coalgebra of singular chains on a connected topological s...
AbstractThe notion of an endofunctor having “greatest subcoalgebras” is introduced as a form of comp...
Abstract In this paper we dene coprime subcoalgebra and we characterize nite dimensional coprime co...
AbstractDana Scott’s model of λ-calculus was based on a limit construction which started from an alg...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
AbstractLogical definability is investigated for certain classes of coalgebras related to state-tran...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
. We introduce a convenient category of combinatorial objects, known as cell-sets, on which we study...
For deterministic systems, expressed as coalgebras over polynomial functors, every tree t (an elemen...
AbstractFor coalgebras over fields, there is a well-known construction which gives the cofree coalge...
AbstractIn this paper we show that it is possible to model observable behaviour of coalgebras indepe...