Moss’s Coalgebraic Logic
(under construction)
Given a coalgebra γ : X → T X \gamma:X\to TX γ : X → TX and the set of all formulas Φ \Phi Φ and θ ∈ T Φ \theta\in T\Phi θ ∈ T Φ , we define the semantics of the formla ∇ θ \nabla\theta ∇ θ via
x ⊩ ∇ θ ⟺ γ ( x ) T ^ ( ⊩ ) θ x\Vdash \nabla\theta \quad\Longleftrightarrow\quad \gamma(x)\, \widehat T(\Vdash)\, \theta x ⊩ ∇ θ ⟺ γ ( x ) T ( ⊩ ) θ where T ^ \widehat T T is the relation lifting of T T T .
Example: If T = P T=\mathcal P T = P the powerset functor and R ⊆ X × Y R\subseteq X\times Y R ⊆ X × Y , then the relation lifting P ^ R ⊆ P X × P Y \widehat{\mathcal P}R\subseteq \mathcal PX\times\mathcal PY P R ⊆ P X × P Y is given as follows.
( A , B ) ∈ P ^ R ⇔ ∀ x ∈ A . ∃ y ∈ B . ( x , y ) ∈ R & ∀ y ∈ B . ∃ x ∈ A . ( x , y ) ∈ R (A,B)\in\widehat{\mathcal P}R \quad\Leftrightarrow\quad \forall x\in A.\exists y\in B. (x,y)\in R \quad \&\quad
\forall y\in B.\exists x\in A. (x,y)\in R ( A , B ) ∈ P R ⇔ ∀ x ∈ A .∃ y ∈ B . ( x , y ) ∈ R & ∀ y ∈ B .∃ x ∈ A . ( x , y ) ∈ R Instantiating A = γ ( x ) A=\gamma(x) A = γ ( x ) and B = θ B=\theta B = θ we get
γ ( x ) P ^ ( ⊩ ) θ ⇔ ∀ y ∈ γ ( x ) . ∃ ϕ ∈ θ . y ⊩ ϕ & ∀ ϕ ∈ θ . ∃ y ∈ γ ( x ) . y ⊩ θ \gamma(x)\, \widehat{\mathcal P}(\Vdash)\, \theta \quad\Leftrightarrow\quad \forall y\in\gamma(x).\exists \phi\in\theta. y\Vdash\phi \quad \&\quad
\forall\phi\in\theta.\exists y\in \gamma(x). y\Vdash\theta γ ( x ) P ( ⊩ ) θ ⇔ ∀ y ∈ γ ( x ) .∃ ϕ ∈ θ . y ⊩ ϕ & ∀ ϕ ∈ θ .∃ y ∈ γ ( x ) . y ⊩ θ With θ = { ϕ 1 , … ϕ n } \theta = \{\phi_1,\ldots\phi_n\} θ = { ϕ 1 , … ϕ n } we can now rewrite this using □ \Box □ and ◊ \Diamond ◊ to obtain
∇ θ = □ ( ϕ 1 ∨ … ϕ n ) ∧ ◊ ϕ 1 ∧ … ◊ ϕ n \nabla\theta = \Box(\phi_1\vee\ldots\phi_n)\wedge\Diamond\phi_1\wedge\ldots\Diamond\phi_n ∇ θ = □ ( ϕ 1 ∨ … ϕ n ) ∧ ◊ ϕ 1 ∧ … ◊ ϕ n Definition: The syntax of Moss’s logic [1] is given by the functor
F T U : B A → B A FTU:{\sf BA}\to {\sf BA} FT U : BA → BA and the semantics is given for finite sets X X X by the BA-morphism F T U P X → P T X FTUPX \to PTX FT U PX → PTX which is the adjoint transpose of the function T U P ⟶ ρ U P T X TUP\stackrel\rho\longrightarrow UPTX T U P ⟶ ρ U PTX that arises from applying the relation lifting of T T T to the elementship relation.[semanticsmoss]
X × 2 X ⟶ ∈ 2 T X × T ( 2 X ) ⟶ T ^ ∈ 2 T ( 2 X ) → 2 T X \begin{align}
X\times 2^X & \stackrel\in\longrightarrow 2\\
TX\times T(2^X) & \stackrel{\widehat T\in}\longrightarrow 2\\
T(2^X) &\to 2^{TX}
\end{align} X × 2 X TX × T ( 2 X ) T ( 2 X ) ⟶ ∈ 2 ⟶ T ∈ 2 → 2 TX References ¶