Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Automata and Algebras in Categories
Automata and Algebras in Categories
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
On tree coalgebras and coalgebra presentations
Theoretical Computer Science
On the final sequence of a finitary set functor
Theoretical Computer Science
Terminal coalgebras and free iterative theories
Information and Computation
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Coequational logic for accessible functors
Information and Computation
| Hi-index | 0.00 |
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. Adamek. However, the logic is more complicated for other functors than polynomial ones, and simple deduction rules can no longer be formulated. A simpler coequational logic for finitely branching labelled transition systems was later presented by the author. The current paper carries that research further: it yields a simple coequational logic for finitary functors that preserve preimages. Furthermore we prove a statement for semantical consequences of sets of coequations in the case of accessible functors.