arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.06970cs.LOmath.LO
收藏

恶魔加细半群的有限表示性

Finite Representability of Semigroups with Demonic Refinement

Robin Hirsch, Jaš Šemrl

摘要:

二元关系的组合和恶魔细化$\sqsubseteq$由\begin{align*} (x, y)\in (R;S)&\iff \exists z((x, z)\in R\wedge (z, y)\in S) R\sqsubseteq S&\iff (dom(S)\subseteq dom(R) \wedge R\restriction_{dom(S)}\subseteq S) \end{align*}定义,其中$dom(S)=\{x:\exists y (x, y)\in S\}$和$R\restriction_{dom(S)}$表示$R$对$(x, y)$对的限制,其中$x\in dom(S)$。恶魔演算被引入到非确定性程序的完全正确性建模中,并已被应用于程序验证。我们证明了类$R(\sqsubseteq, ;)$的抽象$(\leq, \circ)$结构同构于一组二元关系有序的恶魔细化与组合不能公理化的任何有限的一阶$(\leq, \circ)$公式。我们提供了一个相当简单的,无限的,递归公理化定义$R(\sqsubseteq, ;)$。证明了有限可表示的$(\leq, \circ)$结构在有限基上有表示.这似乎是第一个签名的二元关系与组合,其中表示类是非可公理化的,但其中有限表示有限可表示结构属性持有。

英文摘要:

Composition and demonic refinement $\sqsubseteq$ of binary relations are defined by \begin{align*} (x, y)\in (R;S)&\iff \exists z((x, z)\in R\wedge (z, y)\in S) R\sqsubseteq S&\iff (dom(S)\subseteq dom(R) \wedge R\restriction_{dom(S)}\subseteq S) \end{align*} where $dom(S)=\{x:\exists y (x, y)\in S\}$ and $R\restriction_{dom(S)}$ denotes the restriction of $R$ to pairs $(x, y)$ where $x\in dom(S)$. Demonic calculus was introduced to model the total correctness of non-deterministic programs and has been applied to program verification. We prove that the class $R(\sqsubseteq, ;)$ of abstract $(\leq, \circ)$ structures isomorphic to a set of binary relations ordered by demonic refinement with composition cannot be axiomatised by any finite set of first-order $(\leq, \circ)$ formulas. We provide a fairly simple, infinite, recursive axiomatisation that defines $R(\sqsubseteq, ;)$. We prove that a finite representable $(\leq, \circ)$ structure has a representation over a finite base. This appears to be the first example of a signature for binary relations with composition where the representation class is non-finitely axiomatisable, but where the finite representations for finite representable structures property holds.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑