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.

Introduction

(not even a draft)

Review

Given functors T:SetSetT:\sf Set\to Set and L:BABAL:\sf BA\to BA and the contravariant adjunction “homming into 2

P:SetBA:SP:\sf Set \leftrightarrow BA : S

the meaning of the logic LL is determined by a natural transformation

δ:LPPT\delta: LP\to PT

Moreover, LPPTLP\to PT determines, and is determined by, its so-called mate

TSSL\begin{gather} TS\to SL \end{gather}

which maps a one-step behaviour to its theory.

One-Step Properties

It is possible to express properties of the logic in terms of the properties of these natural transformations. Below

LPPTone-step completenessLPPTall sets of one-step behaviours are definableLFnPTSFnall finitary predicate liftings are definableTSSLone-step expressivenessTSSLcanonical (strongly complete)TSLPseparating (non-bisimilar successors are distinguished by a formula)\begin{array}{|l|l|} \hline LP\stackrel{}{\rightarrowtail}PT & \textrm{one-step completeness} \\ \hline LP\stackrel{}{\twoheadrightarrow}PT & \textrm{all sets of one-step behaviours are definable} \\ \hline LFn\twoheadrightarrow PTSFn & \textrm{all finitary predicate liftings are definable} \\ \hline TS\rightarrowtail SL & \textrm{one-step expressiveness}\\ \hline TS\Rightarrow SL & \textrm{canonical (strongly complete)} \\ \hline T \rightarrowtail SLP & \textrm{separating (non-bisimilar successors are distinguished by a formula)} \\ \hline \end{array}

References

The algebraic approach to coalgebraic logic was proposed in

This paper proves that one-step completeness implies completeness. That one-step expressiveness implies expressiveness is due to

...