二元关系可表示性不可判定的极小签名
Minimal signatures with undecidability of representability by binary relations
AI总结:
本文证明有限一元半群表示为有补二元关系半群的问题不可判定,从而确定复合与取补构成 Tarski 关系代数签名中可表示性不可判定性的极小子签名,并将结果推广到核、余核及任意可定义运算的签名。
摘要:
集合 $X$ 上的二元关系半群(在复合运算下)若对 $X\times X$ 内的取补运算封闭,则称其为\emph{有补的}。我们解决了 Boris Schein 于 1991 年提出的一个问题,证明了可表示为有补二元关系半群的有限一元半群类是不可判定的,因此复合与取补构成了 Tarski 关系代数签名中具有可表示性不可判定性的极小子签名。此外,我们对带有返回关系的核与余核的一元运算的二元关系半群证明了类似结果。我们将其推广到可包含任意可定义运算的签名,并给出了一列越来越弱的签名,每个签名都可在前一个签名中定义,每个签名都具有可表示性不可判定性,但其极限签名仅包含复合运算,这对应于众所周知的、可判定的且有限公理化的半群簇。所有这些结果也都针对有限集合上的二元关系可表示性得到了证明。
英文摘要:
A semigroup of binary relations (under composition) on a set $X$ is \emph{complemented} if it is closed under the taking of complements within $X\times X$. We resolve a 1991 problem of Boris Schein by showing that the class of finite unary semigroups that are representable as complemented semigroups of binary relations is undecidable, so composition with complementation forms a minimal subsignature of Tarski's relation algebra signature that has undecidability of representability. In addition we prove similar results for semigroups of binary relations endowed with unary operations returning the kernel and cokernel of a relation. We generalise to signatures which may include arbitrary, definable operations and provide a chain of weaker and weaker signatures, each definable in the previous signature, each having undecidability of representability, but whose limit signature includes composition only, which corresponds to the well known, decidable and finitely axiomatised variety of semigroups. All these results are also proved for representability as binary relations over a finite set.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。