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

树的泛代数与泛逻辑之间的某些联系

Some connections between universal algebra and logics for trees

Mikołaj Bojańczyk, Henryk Michalewski

摘要:

自动机和逻辑中的一个主要开放问题是:是否存在一种算法,它输入一个正则树语言并决定该语言是否可以在一阶逻辑中定义?本文的目标是提出这个问题和类似的使用通用代数的语言,强调潜在的连接到有限代数的结构理论,包括驯服同余理论。

英文摘要:

One of the major open problems in automata and logic is the following: is there an algorithm which inputs a regular tree language and decides if the language can be defined in first-order logic? The goal of this paper is to present this problem and similar ones using the language of universal algebra, highlighting potential connections to the structural theory of finite algebras, including Tame Congruence Theory.

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

↑