Trotter-Weil层次的连接层是可判定的
The Join Levels of the Trotter-Weil Hierarchy are Decidable
摘要:
有限幺半群的DA簇有大量不同的刻画,从二元一阶逻辑FO ^2到无二义性多项式。为了研究DA的子簇的结构,Trotter和Weil考虑了有限幺半群簇与带的交集,即,幂等幺半群幂等幺半群的变种已经被很好地理解和完全分类。Trotter和Weil表明,对于每个带簇V,DA内部存在唯一的最大簇W,使得与带的交集产生给定的带簇V。这个层次是无限的,它耗尽DA;由于乐队的多样性,它自然具有锯齿形。在他们的论文中,Trotter和Weil证明了该层次结构的角点和交叉层是可判定的。在本文中,我们给出了一个单一的身份的ω-条款的Trotter-Weil层次的每个连接水平,这产生可判定性。此外,我们表明,连接水平和随后的交叉水平不一致。阿尔梅达和阿泽维多证明了R-平凡和L-平凡有限幺半群的连接是可判定的;这是Trotter-Weil层次的第一个非平凡连接层。我们将这个结果扩展到Trotter-Weil层次结构的其他连接级别。在文章的最后,我们给出了两个应用。首先,我们证明了确定性和共确定性产品的层次结构是可判定的。其次,证明了无歧义区间逻辑的方向交替深度是可判定的。
英文摘要:
The variety DA of finite monoids has a huge number of different characterizations, ranging from two-variable first-order logic FO^2 to unambiguous polynomials. In order to study the structure of the subvarieties of DA, Trotter and Weil considered the intersection of varieties of finite monoids with bands, i.e., with idempotent monoids. The varieties of idempotent monoids are very well understood and fully classified. Trotter and Weil showed that for every band variety V there exists a unique maximal variety W inside DA such that the intersection with bands yields the given band variety V. These maximal varieties W define the Trotter-Weil hierarchy. This hierarchy is infinite and it exhausts DA; induced by band varieties, it naturally has a zigzag shape. In their paper, Trotter and Weil have shown that the corners and the intersection levels of this hierarchy are decidable. In this paper, we give a single identity of omega-terms for every join level of the Trotter-Weil hierarchy; this yields decidability. Moreover, we show that the join levels and the subsequent intersection levels do not coincide. Almeida and Azevedo have shown that the join of R-trivial and L-trivial finite monoids is decidable; this is the first non-trivial join level of the Trotter-Weil hierarchy. We extend this result to the other join levels of the Trotter-Weil hierarchy. At the end of the paper, we give two applications. First, we show that the hierarchy of deterministic and codeterministic products is decidable. And second, we show that the direction alternation depth of unambiguous interval logic is decidable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。