zbMATH — the first resource for mathematics

Logics admitting final semantics. (English) Zbl 1077.03510
Nielsen, Mogens (ed.) et al., Foundations of software science and computation structures. 5th international conference, FOSSACS 2002, held as part of the joint European conferences on theory and practice of software, ETAPS 2002, Grenoble, France, April 8–12, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43366-X). Lect. Notes Comput. Sci. 2303, 238-249 (2002).
Summary: 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).
For the entire collection see [Zbl 0989.00051].

03B70 Logic in computer science
18C50 Categorical semantics of formal languages
68Q60 Specification and verification (program logics, model checking, etc.)
68Q65 Abstract data types; algebraic specification
Full Text: Link