有限模型上的级联理论
The theory of concatenation over finite models
摘要：
我们提出了FC，一个新的逻辑的话，结合有限模型理论的串联理论-一阶逻辑，是基于字方程。与连接理论一样，FC也是建立在词方程的基础上的;与之相反，它的语义被定义为只允许有限模型，将宇宙限制在一个词及其所有因子上。因此，FC在有限模型上具有FO的许多理想属性，同时比FO[<]更具表达力。在这些理想的属性中最值得注意的是有效的模型检验的充分标准，以及通过为传递闭包或不动点添加运算符来捕获各种复杂性类。FC不仅使我们能够获得新的见解和技术的表达能力和有效的评估文件spectrum，但它也提供了一个通用的框架，逻辑的话，也有潜在的应用在其他领域。
英文摘要：
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast to it, its semantics are defined to only allow finite models, by limiting the universe to a word and all its factors. As a consequence of this, FC has many of the desirable properties of FO on finite models, while being far more expressive than FO[<]. Most noteworthy among these desirable properties are sufficient criteria for efficient model checking, and capturing various complexity classes by adding operators for transitive closures or fixed points. Not only does FC allow us to obtain new insights and techniques for expressive power and efficient evaluation of document spanners, but it also provides a general framework for logic on words that also has potential applications in other areas.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
