WEAK WELL ORDERS AND FRAÏSSÉ’S CONJECTURE

IF 0.5 3区数学 Q3 LOGIC

Journal of Symbolic Logic Pub Date : 2023-09-27 DOI:10.1017/jsl.2023.70

ANTON FREUND, DAVIDE MANCA

引用次数: 0

Abstract

Abstract The notion of countable well order admits an alternative definition in terms of embeddings between initial segments. We use the framework of reverse mathematics to investigate the logical strength of this definition and its connection with Fraïssé’s conjecture, which has been proved by Laver. We also fill a small gap in Shore’s proof that Fraïssé’s conjecture implies arithmetic transfinite recursion over $\mathbf {RCA}_0$ , by giving a new proof of $\Sigma ^0_2$ -induction.

查看原文本刊更多论文

弱井阶和fraÏssÉ的猜想

可数井阶的概念允许在初始段之间的嵌入方面有另一种定义。我们用逆向数学的框架来研究这个定义的逻辑强度及其与Fraïssé猜想的联系，该猜想已被Laver证明。我们还通过给出$\Sigma ^0_2$ -归纳法的新证明，填补了Shore关于Fraïssé猜想在$\mathbf {RCA}_0$上蕴涵算术超限递归的证明中的一个小空白。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Symbolic Logic 数学-数学

CiteScore

1.20

自引率

16.70%

发文量

审稿时长

6-12 weeks

期刊介绍： The Journal of Symbolic Logic publishes research in mathematical logic and its applications of the highest quality. Papers are expected to exhibit innovation and not merely be minor variations on established work. They should also be of interest to a broad audience. JSL has been, since its establishment in 1936, the leading journal in the world devoted to mathematical logic. Its prestige derives from its longevity and from the standard of submissions -- which, combined with the standards of reviewing, all contribute to the fact that it receives more citations than any other journal in logic.