Logics Admitting Final Semantics [chapter]

Alexander Kurz
2002 Lecture Notes in Computer Science  
A logic for coalgebras is said to admit nal semantics i | up to some technical requirements|all de nable classes contain a fully abstract nal coalgebra. It is shown that a logic admits nal semantics i the formulas of the logic are preserved under coproducts (disjoint unions) and quotients (homomorphic images).
doi:10.1007/3-540-45931-6_17 fatcat:ndk5qa4rhzbazg5cb4p5j3l67a