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

无限词量词交替层次的第二层次

Level Two of the Quantifier Alternation Hierarchy over Infinite Words

Manfred Kufleitner, Tobias Walter

摘要:

逻辑片断的各种判定问题的研究在计算机科学中有着悠久的历史。本文研究无限词上的一阶逻辑片段的隶属问题,该隶属问题要求给定的语言是否在某个固定片段中可定义。引入字母拓扑作为片段$Σ_2$在无限词上的有效表征的一部分。这里,$Σ_2$由一阶公式和两个量词块组成,从一个存在量词开始。它的布尔闭包是$\mathbb{B}Σ_2$。我们的第一个主要结果是字母拓扑的布尔闭包的一个有效的刻画,即给定一个$ω$ -正则语言$L$,在字母拓扑中$L$是否是开集的布尔组合是可判定的.然后,这是用于转移地点和Zeitoun的最近的可判定性结果$\mathbb{B}Σ_2$从有限到无限的话。

英文摘要:

The study of various decision problems for logic fragments has a long history in computer science. This paper is on the membership problem for a fragment of first-order logic over infinite words; the membership problem asks for a given language whether it is definable in some fixed fragment. The alphabetic topology was introduced as part of an effective characterization of the fragment $Σ_2$ over infinite words. Here, $Σ_2$ consists of the first-order formulas with two blocks of quantifiers, starting with an existential quantifier. Its Boolean closure is $\mathbb{B}Σ_2$. Our first main result is an effective characterization of the Boolean closure of the alphabetic topology, that is, given an $ω$-regular language $L$, it is decidable whether $L$ is a Boolean combination of open sets in the alphabetic topology. This is then used for transferring Place and Zeitoun's recent decidability result for $\mathbb{B}Σ_2$ from finite to infinite words.

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

↑