# Logics Admitting Final Semantics

@inproceedings{Kurz2002LogicsAF, title={Logics Admitting Final Semantics}, author={Alexander Kurz}, booktitle={FoSSaCS}, year={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 (homomorphicimages).

## 6 Citations

### Coalgebraic Modal Logic in CoCasl

- Philosophy, Computer ScienceWADT
- 2006

COCASL is extended by full coalgebraic modal logic based on predicate liftings for functors and becomes a modern modal language that covers a wide range of Kripke and non-Kripke semantics of modal logics via the coal algebraic interpretation.

### Algebraic-Coalgebraic Specification in Co Casl

- Computer Science, MathematicsWADT
- 2002

It is shown that the well-known coalgebraic modal logic can be expressed in CoCasl, and sufficient criteria for the existence of cofree models is presented, also for several variants of nested cofree and free specifications.

### Expressivity of coalgebraic modal logic: The limits and beyond

- PhilosophyTheor. Comput. Sci.
- 2005

### A proof-theoretic semantic analysis of dynamic epistemic logic

- Philosophy, Computer ScienceJ. Log. Comput.
- 2016

An analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics, and a generalisation of Belnap’s cut elimination metatheorem for display calculi and a revised version of the display-style calculus D.EAK are provided.

### Coalgebraic Methods for Object-Oriented Speci cation

- Mathematics, Computer Science
- 2002

Derivation system for the terms over a coalgebraic class signature Σ and a ground signature Ω, Part I is presented.

### Algebraic-coalgebraic specification in CoCasl

- Computer Science, MathematicsJ. Log. Algebraic Methods Program.
- 2006

## References

SHOWING 1-10 OF 29 REFERENCES

### Semantical Principles in the Modal Logic of Coalgebras

- Computer ScienceSTACS
- 2001

This paper presents a multimodal language which is bisimulation invariant and (under a natural completeness condition) expressive enough to characterise elements of the underlying state space up to bisimulations.

### Characterizing Specification Languages which Admit Initial Semantics

- Computer ScienceTheor. Comput. Sci.
- 1983

### Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study

- MathematicsRAIRO Theor. Informatics Appl.
- 2001

This paper gives a semantical underpinning for a many- sorted modal logic associated with certain dynamical systems, like tran- sition systems, automata or classes in object-oriented languages, as coalgebras of so-called polynomial func- tors, built up from constants and identities, using products, coproducts and powersets.