Ceers计算真算术的理论
The Theory of Ceers Computes True Arithmetic
摘要:
证明了可计算约简下的可计算等价等价关系(ceers)的偏序理论与真算术是1-等价的。对于由暗中心组成的结构和由亮中心组成的结构,我们得到了相同的结果。我们还显示了同样的结构$\mathcal{I}$ -度在黑暗中,光,或完整的结构。在每种情况下,我们表明,有一个可解释的副本$(\mathbb{N},+,\cdot)$。
英文摘要:
We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the structure comprised of the light ceers. We also show the same for the structure of $\mathcal{I}$-degrees in the dark, light, or complete structure. In each case, we show that there is an interpretable copy of $(\mathbb{N},+,\cdot)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。