9 search results - page 1 / 2 » Recursive coalgebras of finitary functors |
ITA
2007
14 years 9 months ago
2007
Abstract For finitary set functors preserving inverse images several concepts of coalgebras A are proved to be equivalent: (i) A has a homomorphism into the initial algebra, (ii) ...
LOGCOM
2010
14 years 8 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...
67
Voted
ENTCS
2008
14 years 9 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
83
Voted
ENTCS
2008
14 years 9 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...
88
Voted
IANDC
2006
14 years 9 months ago
2006
We discuss Osius's [22] concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiven...