arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.02108math.LOcs.LO
收藏

一元结构在带熵链接的一阶逻辑中的描述复杂度

Description Complexity of Unary Structures in First-Order Logic with Links to Entropy

Reijo Jaakkola, Antti Kuusisto, Miikka Vilander

AI总结:

研究一阶逻辑中一元结构的描述复杂度,利用公式大小博弈推导出线性复杂度的上下界,并建立了 Shannon 熵与 Boltzmann 熵之间的渐近匹配关系。

摘要:

模型的描述复杂度是定义该模型的最短公式的长度。我们研究了一阶逻辑 FO 中一元结构的描述复杂度,同时将其与熵形式的语义复杂度建立联系。一元结构类提供了一种简单的方式,将表格布尔数据集表示为关系结构。我们用 FO 公式定义结构,这些公式相对于模型大小是严格线性的,而非使用朴素的二次公式,并且我们使用基于公式大小博弈的论证来获得描述复杂度的相关下界。对于典型结构,上下界实际上匹配至一个次线性项,从而得出了随机选择结构的期望描述复杂度的精确渐近结果。随后,我们给出了 Shannon 熵与描述复杂度之间关系的界限。通过建立两种熵之间的渐近匹配,我们将这种关系也扩展到了 Boltzmann 熵。尽管一元结构很简单,但我们的论证需要使用公式大小博弈、Stirling 近似和 Chernoff 界。

英文摘要:

The description complexity of a model is the length of the shortest formula that defines the model. We study the description complexity of unary structures in first-order logic FO, also drawing links to semantic complexity in the form of entropy. The class of unary structures provides, e.g., a simple way to represent tabular Boolean data sets as relational structures. We define structures with FO-formulas that are strictly linear in the size of the model as opposed to using the naive quadratic ones, and we use arguments based on formula size games to obtain related lower bounds for description complexity. For a typical structure the upper and lower bounds in fact match up to a sublinear term, leading to a precise asymptotic result on the expected description complexity of a randomly selected structure. We then give bounds on the relationship between Shannon entropy and description complexity. We extend this relationship also to Boltzmann entropy by establishing an asymptotic match between the two entropies. Despite the simplicity of unary structures, our arguments require the use of formula size games, Stirling's approximation and Chernoff bounds.

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

↑