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

关于本原正公式的统一量化强度

On the Strength of Uniqueness Quantification in Primitive Positive Formulas

Victor Lagerkvist, Gustav Nordh

摘要:

唯一性量化($\exists !$)是一阶逻辑中的量词,其中要求恰好存在一个满足给定属性的元素。在本文中,我们研究的强度时,唯一性量化,它是用来在一个给定的一组关系$Γ$,所谓的原始正定义(PP-定义)的合取公式的存在量化。我们完全分类的布尔集的关系,唯一性量化具有相同的强度存在量化在PP-定义,并给出了几个结果有效的任意有限域。我们还考虑应用程序的$\exists !$量化PP-定义在计算机科学中,它可以用来研究的计算复杂性的问题的解决方案的数量是很重要的。利用我们的分类给出了唯一可满足性问题的一个新的和简化的可分性定理的证明,并证明了唯一约束满足问题的一个一般结果。

英文摘要:

Uniqueness quantification ($\exists !$) is a quantifier in first-order logic where one requires that exactly one element exists satisfying a given property. In this paper we investigate the strength of uniqueness quantification when it is used in place of existential quantification in conjunctive formulas over a given set of relations $Γ$, so-called primitive positive definitions (pp-definitions). We fully classify the Boolean sets of relations where uniqueness quantification has the same strength as existential quantification in pp-definitions and give several results valid for arbitrary finite domains. We also consider applications of $\exists !$-quantified pp-definitions in computer science, which can be used to study the computational complexity of problems where the number of solutions is important. Using our classification we give a new and simplified proof of the trichotomy theorem for the unique satisfiability problem, and prove a general result for the unique constraint satisfaction problem.

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

↑