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

再论推广的K-Tarski定理

Revisiting the generalized Łoś-Tarski theorem

Abhisekh Sankaran

摘要:

本文对文[1]中提出的任意结构上的推广的D-T定理($\mathsf{GLT}(k)$)给出了一个新的证明.与[1]中使用$λ$ -饱和度不同,我们直接使用结构的上升链来构造“所需饱和度”。我们还加强了失败的$\mathsf{GLT}(k)$在有限显示在[2]中,通过加强失败的Escherichi-Tarski定理在这种情况下。特别是,我们证明,不只是普遍的句子,但对于每个固定的$k$,即使是$Σ^0_2$句子包含$k$存在量词未能捕捉到有限的遗传性。我们的结论与两个问题作为未来的发展方向,有关的Doker-Tarski定理和$\mathsf{GLT}(k)$,无论是在所有的有限结构的背景下。[1]10.1016/j.apal.2015.11.001 ; [2] 10.1007/978-3-642-32621-9\_22

英文摘要:

We present a new proof of the generalized Łoś-Tarski theorem ($\mathsf{GLT}(k)$) introduced in [1], over arbitrary structures. Instead of using $λ$-saturation as in [1], we construct just the "required saturation" directly using ascending chains of structures. We also strengthen the failure of $\mathsf{GLT}(k)$ in the finite shown in [2], by strengthening the failure of the Łoś-Tarski theorem in this context. In particular, we prove that not just universal sentences, but for each fixed $k$, even $Σ^0_2$ sentences containing $k$ existential quantifiers fail to capture hereditariness in the finite. We conclude with two problems as future directions, concerning the Łoś-Tarski theorem and $\mathsf{GLT}(k)$, both in the context of all finite structures. [1] 10.1016/j.apal.2015.11.001 ; [2] 10.1007/978-3-642-32621-9\_22

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

↑