部分和linear orders的均匀含量
The uniform content of partial and linear orders
摘要:
$ADS$原则断言$ω$上的每个线性顺序都有一个无限的升序或降序序列。这已被广泛研究的反向数学文献,开始与工作的Hirschfeldt和海岸。我们引入$ADC$原理,它断言线性序有一个无限的上升或下降链。很容易看出这两个在二阶算术的基本系统$RCA_0$上是等价的;它们甚至在计算上是等价的。然而,我们证明了$ADC$严格弱于$ADS$下Weihrauch(一致)约简。事实上,我们表明,即使是原则$SADS$,这是限制$ADS$的线性订单类型$ω+ ω^*$,是不是Weihrauch可约$ADC$。在这方面,我们定义了一个更自然的稳定形式的$ADS$,我们称之为$General\text-SADS$,这是限制的$ADS$的线性顺序的类型$k + ω$,$ω+ ω^*$,或$ω+ k$,其中$k$是一个有限数。我们类似地定义$GeneralSADC$。我们证明了$GeneralSADC$不是Weihrauch可约的$SADS$,因此特别地,每个$SADS$和$SADC$在Weihrauch可约下严格弱于它的一般版本。最后,我们转向$CAC$原理,它断言$ω$上的每个偏序都有一个无限链或反链。这有两个以前研究过的稳定变体,$SCAC$和$WSCAC$,分别由Hirschfeldt和Jockusch,以及Jockusch,Kastermans,Lempp,Lerman和Solomon引入,并且已知与$RCA_0$等效。在这里,我们表明,$SCAC$严格弱于$WSCAC$下甚至可计算约简。
英文摘要:
The principle $ADS$ asserts that every linear order on $ω$ has an infinite ascending or descending sequence. This has been studied extensively in the reverse mathematics literature, beginning with the work of Hirschfeldt and Shore. We introduce the principle $ADC$, which asserts that linear order has an infinite ascending or descending chain. The two are easily seen to be equivalent over the base system $RCA_0$ of second order arithmetic; they are even computably equivalent. However, we prove that $ADC$ is strictly weaker than $ADS$ under Weihrauch (uniform) reducibility. In fact, we show that even the principle $SADS$, which is the restriction of $ADS$ to linear orders of type $ω+ ω^*$, is not Weihrauch reducible to $ADC$. In this connection, we define a more natural stable form of $ADS$ that we call $General\text-SADS$, which is the restriction of $ADS$ to linear orders of type $k + ω$, $ω+ ω^*$, or $ω+ k$, where $k$ is a finite number. We define $GeneralSADC$ analogously. We prove that $GeneralSADC$ is not Weihrauch reducible to $SADS$, and so in particular, each of $SADS$ and $SADC$ is strictly weaker under Weihrauch reducibility than its general version. Finally, we turn to the principle $CAC$, which asserts that every partial order on $ω$ has an infinite chain or antichain. This has two previously studied stable variants, $SCAC$ and $WSCAC$, which were introduced by Hirschfeldt and Jockusch, and by Jockusch, Kastermans, Lempp, Lerman, and Solomon, respectively, and which are known to be equivalent over $RCA_0$. Here, we show that $SCAC$ is strictly weaker than $WSCAC$ under even computable reducibility.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。