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

Fraïssé猜想、部分非直谓性与良序原理(第一部分)

Fraïssé's conjecture, partial impredicativity and well-ordering principles, part I

Anton Freund

AI总结:

本研究在反推数学框架下,于Suzuki与Yokoyama拓展的部分非直谓性层级中,找到Fraïssé猜想的更优上界,证明伪Π¹₁-概括原理蕴含该猜想,还提出Δ⁰₂-Ramsey定理余有穷版本并关联相关反射原理,为后续给出组合上界奠基。

摘要:

Montalbán已证明,反推数学中的$Π^1_1$-概括公理蕴含Fraïssé猜想(该猜想由Laver证明)。从量词复杂度角度看,这一蕴含关系必然是严格的,但此前似乎尚未找到更优的上界。我们在Suzuki与Yokoyama提出的层级中找到了这样的上界,该层级拓展了Towsner的部分非直谓性框架。具体而言,我们证明伪$Π^1_1$-概括原理蕴含Fraïssé猜想。作为证明的一部分,我们提出了$Δ^0_2$-Ramsey定理的余有穷版本,该结果本身可能具有独立研究价值。我们还将伪$Π^1_1$-概括与两类原理关联起来:一是Suzuki和Yokoyama提出的伪$β$-模型反射原理,二是Rathjen与Valencia-Vizcaíno研究的超穷归纳$ω$-模型反射原理。在即将发表的姊妹篇论文中,我们将通过一个良序原理刻画伪$Π^1_1$-概括,从而为Fraïssé猜想的强度给出清晰的组合上界。

英文摘要:

Fraïssé's conjecture (proved by Laver) is implied by the $Π^1_1$-comprehension axiom of reverse mathematics, as shown by Montalbán. The implication must be strict for reasons of quantifier complexity, but it seems that no better bound has been known. We locate such a bound in a hierarchy of Suzuki and Yokoyama, which extends Towsner's framework of partial impredicativity. Specifically, we show that Fraïssé's conjecture is implied by a principle of pseudo $Π^1_1$-comprehension. As part of the proof, we introduce a cofinite version of the $Δ^0_2$-Ramsey theorem, which may be of independent interest. We also relate pseudo $Π^1_1$-comprehension to principles of pseudo $β$-model reflection (due to Suzuki and Yokoyama) and reflection for $ω$-models of transfinite induction (studied by Rathjen and Valencia-Vizcaíno). In a forthcoming companion paper, we characterize pseudo $Π^1_1$-comprehension by a well-ordering principle, to get a transparent combinatorial bound for the strength of Fraïssé's conjecture.

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

↑