Skip to main content
Conference ProceedingsOPEN ACCESS

Logics admitting final semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2303 238-249
DOI: 10.1007/3-540-45931-6_17
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 (homomorphicimages).

Cite

CITATION STYLE

APA

Kurz, A. (2002). Logics admitting final semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2303, pp. 238–249). Springer Verlag. https://doi.org/10.1007/3-540-45931-6_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free