Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

Semantics of Coalgebraic Logic

(draft)

We first review the definitions and results that make sense for the general setting of coalgebraic logic.

Syntax and Semantics

one-step syntax

ALA\mathcal A\stackrel L \longrightarrow \mathcal A

syntax is the initial algebra

LIILI\longrightarrow I

one-step semantics

LPδPTLP\stackrel \delta \longrightarrow PT

semantics wrt XTXX\to TX

For the next result we assume that X\mathcal X is a concrete category. Various generalisations to abstract categories are also possible.

Proposition: Formulas are invariant under bisimilarity.

Proof: Follows from the naturality of LPPTLP \to PT.

The Logic Functor Induced by the Coalgebra Functor

The definitions above are parametric in LL and LPPTLP\to PT.

On the other hand, from a coalgebraic point of view, TT is given and we should ask how to derive LL from TT.

If A\mathcal A is a variety in the sense of universal algebra, then we can define a functor by its action on the free algebras. Moreover, if the variety has a presentation by operations of finite arity, then we can restrict attention to finitely generated free algebras and define LL as

LFn=PTSFn,LFn=PTSFn,

where nn ranges over finite sets.

(to be continued)