K-Tarski保持定理的一个推广
A Generalization of the Łoś-Tarski Preservation Theorem
摘要:
本文对每个自然数$k$,给出了一阶逻辑句子的前缀类$\exists^k \forall^*$和前缀类$\forall^k \exists^*$在所有有限和无限结构上的语义刻画。这个结果,我们称之为 * 广义的柯罗-塔斯基定理 *,缩写为$\mathsf{GLT}(k)$,当$k$等于0时,得到经典的柯罗-塔斯基保持定理。它还提供了新的表征的$Σ^0_2$和$Π^0_2$前缀类,这是比所有这些类在文献中的特征。此外,我们的语义概念是有限的性质,在文献中所包含的特征。在有限结构的背景下,我们制定了一个抽象的组合性质的结构,当满足一类,确保$\mathsf{GLT}(k)$持有类。这个性质,我们称之为 * 等价有界子结构性质 *,缩写为$\mathsf{EBSP}$,直观地说,一个大的结构包含一个小的“逻辑相似”的子结构。事实证明,这个简单陈述的属性被计算机科学中的各种感兴趣的类别所享有:例子包括单词,树(无序,有序或排名),嵌套单词,有界树深度/灌木深度的图形类,以及$m$ -partite上图。此外,$\mathsf{EBSP}$仍然保存在各种良好的研究操作,如互补,转置,线图操作,不相交的联盟,carnival和张量积等,这使得构建一个广泛的类,满足$\mathsf{EBSP}$,因此$\mathsf{GLT}(k)$。值得注意的是,$\mathsf{EBSP}$可以被视为经典向下Löwenheim-Skolem性质的有限模拟。总之,本文在所有结构和有限结构两个方面都提供了新的概念和结果。
英文摘要:
In this dissertation, we present for each natural number $k$, semantic characterizations of the $\exists^k \forall^*$ and $\forall^k \exists^*$ prefix classes of first order logic sentences, over all structures finite and infinite. This result, that we call the *generalized Łoś-Tarski theorem*, abbreviated $\mathsf{GLT}(k)$, yields the classical Łoś-Tarski preservation theorem when $k$ equals 0. It also provides new characterizations of the $Σ^0_2$ and $Π^0_2$ prefix classes, that are finer than all characterizations of these classes in the literature. Further, our semantic notions are finitary in nature, in contrast to those contained in the literature characterizations. In the context of finite structures, we formulate an abstract combinatorial property of structures, that when satisfied by a class, ensures that $\mathsf{GLT}(k)$ holds over the class. This property, that we call the *Equivalent Bounded Substructure Property*, abbreviated $\mathsf{EBSP}$, intuitively states that a large structure contains a small "logically similar" substructure. It turns out that this simply stated property is enjoyed by a variety of classes of interest in computer science: examples include words, trees (unordered, ordered or ranked), nested words, graph classes of bounded tree-depth/shrub-depth, and $m$-partite cographs. Further, $\mathsf{EBSP}$ remains preserved under various well-studied operations, such as complementation, transpose, the line-graph operation, disjoint union, cartesian and tensor products, etc. This enables constructing a wide spectrum of classes that satisfy $\mathsf{EBSP}$, and hence $\mathsf{GLT}(k)$. Remarkably, $\mathsf{EBSP}$ can be regarded as a finitary analogue of the classical downward Löwenheim-Skolem property. In summary, this dissertation provides new notions and results in both contexts, that of all structures and that of finite structures.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。