## Many-valued Coalgebraic Logic: From Boolean Algebras to Primal Varieties <br> ###### CALCO 2023, June 19 <br> ###### *Alexander Kurz*, Wolfgang Poiger <br> ###### <font size="-1" color=grey>(layout optimized for Brave browser)</font> --- <style type="text/css"> .reveal p { text-align: left; } .reveal ul { display: block; } .reveal ol { display: block; } .reveal { font-size: 24px; } </style> ### Introduction --- - Coalgebraic Logic - Many-Valued Logic - Universal Algebra - Modal Logic --- ### Coalgebraic Logic --- | State Machines | Logics | | :---: | :---: | | state space $X\in \cal X$ | algebra of propositions $A\in \cal A$ | | type of transitions $\sf T:\cal X\to X$ | type of modalities $\sf L:\cal A\to A$ | | coalgebra $X\to \mathsf TX$ | algebra $\mathsf LA\to A$ | <!-- (Goldblatt, Scott, Johnstone, Smyth, Abramsky, Vickers, ...) --> --- ### Stone Duality ![](https://hackmd.io/_uploads/Sy5yC0OPh.png =830x) *Two-valued* dualising object: $\mathsf PX={\sf Set}(X,2)$ and $\mathsf SA = {\sf BA}(A,2)$. *Idea:* Starting from $\sf T$, define $\sf L = PTS$ on finitely generated free BAs and extend to BA via sifted colimits. --- ### Abstract Coalgebraic Logics From $\sf L = PTS$ one obtains the **one-step semantics** as a natural transformation $$\delta:\sf LP\to PT$$ We call $$(\sf L,\delta)$$ an *abstract coalgebraic logic*. This gives a "semantics functor" $$\sf Coalg(T) \to Alg(L)$$ Invariance under bisimulation, expressiveness, completeness can be established for abstract coalgebric logics. --- ### Example Let $A$ be a Boolean algebra. Define $LA$ as the free $\sf BA$ over the meet-semi lattice $A$. It is well-known that $LP\cong P\cal P$ on finite sets. Explicitely: $LA$ is the free $\sf BA$ - generated by $\Box a$, $a\in A$ - modulo $\Box\top=\top$ and $\Box(a\wedge a')=\Box a \wedge \Box a'$. --- ### Presenting Functors **Theorem (K-Rosicky 2012):** A functor $L$ on a variety has a presentation by operations and equations iff it is determined by its action on finitely generated free algebras. ... iff it is the left-Kan extension of its restriction to finitely generated free algebras ... iff $L$ preserves filtered colimits --- ### Concrete Coalgebraic Logics ![](https://hackmd.io/_uploads/HJUPgV6v3.png) --- ### Many-Valued Coalgebraic Logic $\sf BA$ is the variety generated by $2$. $\mathcal V = \mathbb {HSP}(D)$ is generated by a *finite lattice $D$ of truth degrees*. ![](https://hackmd.io/_uploads/r1RWZNaDh.png) --- ### Universal Algebra --- ### Primal Algebras (Foster 1953) ![](https://hackmd.io/_uploads/rJaHmVpDn.png) ![](https://hackmd.io/_uploads/SJJn7Eawh.png) --- ![](https://hackmd.io/_uploads/ByHlE4pw3.png) --- ### Semi-Primal Algebras (Foster 1967) <font size=4 color=grey> Originally, we wanted to write this paper for semi-primal algebras, continuing *K-P-Teheux (2023) [New perspectives on semi-primal varieties](https://arxiv.org/pdf/2301.13406.pdf)* but it turned out that the interesting question already arises in the primal case. </font> ![](https://hackmd.io/_uploads/SJlsaVTv2.png) ![](https://hackmd.io/_uploads/HyHTjNTv2.png) --- For every variety $\cal A$ generated by a semi-primal algebra $\bf L$ one has the following diagram. ![](https://hackmd.io/_uploads/ByZQkH6Dn.png) --- ### Hu's Theorem (Hu 1969) In the primal case, the previous diagram collapses: ![](https://hackmd.io/_uploads/Sy20xS6P2.png) From a logical point of view, adding constants for each truth value is sufficient for the collapse. --- ### Lifting Abstract Coalgebraic Logics --- ![](https://hackmd.io/_uploads/BJ6HGB6w3.png =600x) $\cal A$ is a variety generated by a finite primal algebra. $(\frak P, \frak S)$ is the equivalence of Hu's theorem, lifting $(\sf P,S)$ to $(\sf P',S')$. $\sf L' = \frak P \sf L\frak S$ is the abstract lifting of $\sf L$. ![](https://hackmd.io/_uploads/ByUszHTDn.png) --- ### Lifting Concrete Coalgebraic Logics --- $D$ is a finite primal algebra with a lattice reduct. The order on $D$ is term-definable: ![](https://hackmd.io/_uploads/HJW7XapPh.png =300x) We can consider $\tau_d$ as a modal operator: \begin{gather} \tau_d(x\wedge y)=\tau_d(x)\wedge \tau_d(y)\\ \tau_d1 = 1 \end{gather} --- ![](https://hackmd.io/_uploads/BJG3GAav3.png) Compare this with ![](https://hackmd.io/_uploads/ryDVwppP3.png) ![](https://hackmd.io/_uploads/rkSPw6pwh.png) --- This example is a special case of part (b) of the theorem. We will see later that neighbourhood frames give rise to an example that falls under (a) but not under (b). ![](https://hackmd.io/_uploads/B1miNCpDn.png) --- As a corollary we obtain a generalization of the example: ![](https://hackmd.io/_uploads/rJyuIRTw2.png) --- ### Neighborhood Frames Instance of Theorem 15 (a): ![](https://hackmd.io/_uploads/SJHhtk0Dn.png) To present the lifting $\sf L'$ of $\sf L$ we need a modal operator $\Box_d$ for each $d\in D\setminus\{0\}$, satisfying ![](https://hackmd.io/_uploads/rk8Ah10Dn.png =700x) where $T_1(d)=1$ if $d=1$ and $T_1(d)=0$ if $d\not=1$. --- ### Conclusion <font size=5> Using an equivalence of categories $\mathbb {HSP}(2) \simeq\mathbb {HSP}(D)$ we investigated how to lift a 2-valued modal logic to a $D$-valued modal logic in a principled way. Future Work: - From a universal algebra point of view: generalizing from primal to semi-primal (and beyond) algebras. - From a coalgebraic point of view: generalizing to many-valued semantics via enriching over a quantale of truth values (or distances). - Combining both approaches using eniched universal algebra. - Approximation techniques for reasoning with infinitely many truth-values. </font>
{"metaMigratedAt":"2023-06-19T19:40:12.075Z","metaMigratedFrom":"YAML","description":"Coalgebraic Logic","showTitle":"false","showTags":"false","title":"Many-valued Coalgebraic Logic - From Boolean Algebras to Primal Varieties (Slides)","breaks":true,"slideOptions":"{\"theme\":\"white\",\"transition\":\"fade\",\"transitionSpeed\":\"slow\",\"spotlight\":{\"enabled\":false},\"controls\":false}","contributors":"[{\"id\":\"d215bc36-9464-43c8-81b4-4d58ae2c492a\",\"add\":7020,\"del\":902}]"}
    243 views