Introduction
(not even a draft)
Review ¶ Given functors T : S e t → S e t T:\sf Set\to Set T : Set → Set and L : B A → B A L:\sf BA\to BA L : BA → BA and the contravariant adjunction “homming into 2”
P : S e t ↔ B A : S P:\sf Set \leftrightarrow BA : S P : Set ↔ BA : S the meaning of the logic L L L is determined by a natural transformation
δ : L P → P T \delta: LP\to PT δ : L P → PT Moreover, L P → P T LP\to PT L P → PT determines, and is determined by, its so-called mate
T S → S L \begin{gather}
TS\to SL
\end{gather} TS → S L 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
n n n is a finite set,
↠ \twoheadrightarrow ↠ is onto,
⇒ \Rightarrow ⇒ is split epi (onto and has a half-inverse),
↣ \rightarrowtail ↣ is injective,
↪ \hookrightarrow ↪ is a section (injective and has a half-inverse).
L P ↣ P T one-step completeness L P ↠ P T all sets of one-step behaviours are definable L F n ↠ P T S F n all finitary predicate liftings are definable T S ↣ S L one-step expressiveness T S ⇒ S L canonical (strongly complete) T ↣ S L P separating (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} L P ↣ PT L P ↠ PT L F n ↠ PTSF n TS ↣ S L TS ⇒ S L T ↣ S L P one-step completeness all sets of one-step behaviours are definable all finitary predicate liftings are definable one-step expressiveness canonical (strongly complete) separating (non-bisimilar successors are distinguished by a formula) 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
...