6 search results - page 1 / 2 » Coequational Logic for Finitary Functors |
ENTCS
2008
13 years 4 months ago
2008
Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Ad
IANDC
2010
13 years 1 months ago
2010
Covarieties of coalgebras are those classes of coalgebras for an endofunctor H on the category of sets that are closed under coproducts, subcoalgebras and quotients. Equivalently,...
LOGCOM
2010
13 years 3 months ago
2010
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L∗ of the limit L of the firs...
ENTCS
2008
13 years 4 months ago
2008
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
ENTCS
2002
13 years 4 months ago
2002
In this paper we show that it is possible to model observable behaviour of coalgebras independently from their internal dynamics, but within the general framework of representing ...