论定义布尔函数所需的量词数量
On the Number of Quantifiers Needed to Define Boolean Functions
AI总结:
本研究借助多结构博弈分析带序二进制串的一阶量词需求,提出并行对局技术,给出定义不同布尔函数所需量词的紧上界,含稀疏函数的优化结果,类似Lupanov上界。
摘要:
表达一阶(FO)性质所需的量词数量可通过名为多结构博弈的双人组合博弈来刻画。我们在带序关系的二进制串上分析这类博弈,采用一种我们称之为“并行对局”的技术,该技术在许多情形下能显著减少所需量词数量。历史上,串这类有序结构在这类及类似博弈的语境下一直极难分析。尽管如此,本文中我们给出了刻画不同规模串子集所需量词数量的基本紧上界。这些结果可直接得出定义若干不同类别布尔函数所需量词数量的界。我们的其中一项结果与命题逻辑中关于电路规模和公式规模的Lupanov上界类似:我们证明,每个n位输入的布尔函数都可由一个含(1+ε)nlog(n)+O(1)个量词的一阶语句定义,且该结果基本是紧的。当所讨论的布尔函数是稀疏的时,我们将这一数量降至(1+ε)log(n)+O(1)。
英文摘要:
The number of quantifiers needed to express first-order (FO) properties is captured by two-player combinatorial games called multi-structural games. We analyze these games on binary strings with an ordering relation, using a technique we call parallel play, which significantly reduces the number of quantifiers needed in many cases. Ordered structures such as strings have historically been notoriously difficult to analyze in the context of these and similar games. Nevertheless, in this paper, we provide essentially tight upper bounds on the number of quantifiers needed to characterize different-sized subsets of strings. The results immediately give bounds on the number of quantifiers necessary to define several different classes of Boolean functions. One of our results is analogous to Lupanov's upper bounds on circuit size and formula size in propositional logic: we show that every Boolean function on $n$-bit inputs can be defined by a FO sentence having $(1 + \varepsilon)n\log(n) + O(1)$ quantifiers, and that this is essentially tight. We reduce this number to $(1 + \varepsilon)\log(n) + O(1)$ when the Boolean function in question is sparse.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。