4 search results - page 1 / 1 » Coequational logic for accessible functors |
IANDC
2010
13 years 2 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,...
ENTCS
2008
13 years 5 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
ENTCS
2007
13 years 4 months ago
2007
Polyadic coalgebraic modal logic is studied in the setting of locally presentable categories. It is shown that under certain assumptions, accessible functors admit expressive logi...
FOSSACS
2005
Springer
13 years 10 months ago
2005
Springer
Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modeled as coalgebras. Logics with modal operators obtained from so-calle...