Logics Admitting Final Semantics

Alexander Kurz

To appear at Foundations of Software Science and Computation Structures (FOSSACS02), Grenoble, France, 6-14 April, 2002


A logic for coalgebras is said to admit final semantics iff---up to some technical requirements---all definable classes contain a fully abstract final coalgebra. It is shown that a logic admits final semantics iff the formulas of the logic are preserved under coproducts (disjoint unions) and quotients (homomorphic images).

Server START Conference Manager
Update Time 14 Dec 2001 at 14:02:38
Maintainer fossacs02@brics.dk.
Start Conference Manager
Conference Systems