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.

Montone Neighbourhood Coalgebras

(draft)

Introduction

The idea of this section is to run through parts of [HK04] and adapt it to ordered neighbourhood frames. It could also be interesting to study metric neighbourhood frames.

The neighbourhood frames of modal logic are coalgebras for the functor UpPUp\mathcal P [HK04,Lem.3.4]. Here, UpPX={AP(PX)aA,aaaA}Up\mathcal P X=\{A\subseteq \mathcal P(\mathcal PX) \mid a\in A, a\subseteq a' \Rightarrow a'\in A\}. On functions, we have

UpP f A={f[a]aA}.Up\mathcal P\ f\ A = {\uparrow}\{f[a] \mid a\in A\}.

There are three well-known ways of extending powerset to orders. In domain theory, they are known as the upper, lower and convex powerdomain, and also known under the names of Hoare, Smyth and Plotkin, respectively. They correspond to the downset functor D\mathcal D, the upset functor U\mathcal U and the convex powerset functor P\overline{\mathcal P}. The first two arise from ordering powerset by inclusion and reverse inclusion. The third arises as the posetification of the powerset.

Similarly, there are three ways to extend the monotone neighbourhood functor UpPUp\mathcal P to posets.

Recall that on objects UX=[X,2]o\mathcal UX=[X,2]^o and DX=[Xo,2]\mathcal DX = [X^o,2]. As a functor (and as a monad)

DUX=[[X,2],2]\mathcal D\mathcal U X=[[X,2],2]

and

UDX=[[Xo,2],2]o.\mathcal U\mathcal DX=[[X^o,2],2]^o.

On discrete XX, we have DUX=(UDX)o\mathcal D\mathcal UX = (\mathcal U\mathcal DX)^o, so both are legitimate order generalisations of the functor UpPUp\mathcal P.

Finally, there is also the posetification UpP\overline{Up\mathcal P}.

We derive the notions of cospan (bi)simulation of the functors DU\mathcal D\mathcal U and UD\mathcal U\mathcal D and UpPUp\mathcal P.

Coalgebra Morphisms

Proposition: ff is a morphism of DU\mathcal D\mathcal U-coalgebras iff

aξx.bν(fx).yb.xa.fxybν(fx).aξ(x).xa.yb. yfx\begin{gather} \forall a\in \xi x.\exists b\in\nu(fx).\forall y\in b.\exists x\in a. fx \le y\\[1ex] \forall b\in \nu(fx).\exists a\in\xi(x).\forall x\in a.\exists y\in b. \ y\le fx \end{gather}

ff is a morphism of DU\mathcal D\mathcal U-coalgebras iff

aξx.bν(fx).yb.xa.fxybν(fx).aξx.xa.yb.yfx\begin{gather} \forall a\in \xi x.\exists b\in\nu(fx).\forall y\in b.\exists x\in a. fx \ge y\\[1ex] \forall b\in \nu(fx).\exists a\in\xi x.\forall x\in a.\exists y\in b. y \ge fx \end{gather}

ff is a morphism of UpP\overline{Up\mathcal P}-coalgebras if

Morphisms of DU\mathcal D\mathcal U and UD\mathcal U\mathcal D-coalgebras coincide on discrete coalgebras. Here is an attempt at a visual summary:

![](https://i.imgur.com/a1wXKKp.png =400x600)

Morphisms as Relations

In sets every function is a relation and every coalgebra morphism a bisimulation. In ordered sets every function f:XYf:X\to Y gives rise to two relation f:XYf_\diamond:X\looparrowright Y and f:YXf^\diamond: Y\looparrowright X with

(x,y)f  fxy(y,x)f  yfx(x,y)\in f_\diamond \ \Leftrightarrow \ fx\le y \quad\quad\quad\quad (y,x)\in f^\diamond \ \Leftrightarrow \ y\le fx

We have shown in Cospan Bisimulations 2 that these relations are cospan (bi)simulations if ff is a coalgebra morphism. This example suggests that more is true.

Proposition: ff is a morphism of DU\mathcal D\mathcal U-coalgebras iff ff_\diamond and ff^\diamond are cospan-(bi)simulations.

Proof: We only need to instantiate the characterisation of DU\mathcal D\mathcal U-cospan-(bi)simulation from the section on Bisimulation for Ordered Coalgebras.

An analogous statement is true for UD\mathcal U\mathcal D-coalgebras (CHECK).

![](https://i.imgur.com/1FLZ0fs.png =80x80)

(WHERE DO WE SEE THE DIFFERENCE BETWEEN THE TYPES OF COALGEBRAS IN THE LOGICS?)

Def: The two-sorted modal logic for ordered neighbourhood frames has point-formulas ϕ\phi and set-formulas ψ\psi given as

ϕ::=ψϕϕϕϕpψ::=ϕψψψψ\begin{align*} \phi &::= \Box\psi \mid \phi\wedge\phi \mid \phi\vee\phi \mid p \\[1ex] \psi &::= \Diamond\phi \mid \psi\wedge\psi \mid \psi\vee\psi \end{align*}

and axioms saying that \Box preserves finite meets and \Diamond preserves finite joins.

Remark: This logic can be derived from the semantics using the principles of functorial modal logic (FML). This construction then guarantees the following proposition.

Prop: Formulas are invariant under morphisms and behavioural equivalence. Moreover, the logic is sound and complete for ordered neighbourhood models.

References

Dahlqvist and Kurz: The Positivication of Coalgebraic Logics. CALCO 2017. (Section 3.3 and 3.4)

Hansen, Kupke: A Coalgebraic Perspective on Monotone Modal Logic. 2004.

M. Pauly. Bisimulation for general non-normal modal logic. Manuscript, 1999.