WEAK WELL ORDERS AND FRAISSE'S CONJECTURE

被引：0

作者：

Freund, Anton ^{[1
]}

Manca, Davide ^{[1
]}

机构：

[1] Univ Wurzburg, Inst Math, Emil Fischer Str 40, D-97074 Wurzburg, Germany

来源：

JOURNAL OF SYMBOLIC LOGIC | 2023年

关键词：

weak well order; Fraisse's conjecture; reverse mathematics; arithmetic transfinite recursion;

D O I：

10.1017/jsl.2023.70

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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 Fraisse's conjecture, which has been proved by Laver. We also fill a small gap in Shore's proof that Fraisse's conjecture implies arithmetic transfinite recursion over RCA(0) , by giving a new proof of Sigma(0)(2) -induction.

引用

页数：16

共 22 条

[1]

[Anonymous], 1987, Studies in Proof Theory

[2] Provability algebras and proof-theoretic ordinals, I [J].

Beklemishev, LD .

ANNALS OF PURE AND APPLIED LOGIC, 2004, 128 (1-3) :103-123

[3]

Clote P., 1989, Archive for Mathematical Logic, V29, P9, DOI 10.1007/BF01630807

[4]

Downey RG, 1999, DE GRU LOG APPLICAT, V2, P55

[5] SYSTEMS OF PREDICATIVE ANALYSIS .2. REPRESENTATIONS OF ORDINALS [J].

FEFERMAN, S .

JOURNAL OF SYMBOLIC LOGIC, 1968, 33 (02) :193-&

[6]

Friedman H, 1975, P INT C MATH CAN MAT, P235

[7] WEAK COMPARABILITY OF WELL ORDERINGS AND REVERSE MATHEMATICS [J].

FRIEDMAN, HM ;

HIRST, JL .

ANNALS OF PURE AND APPLIED LOGIC, 1990, 47 (01) :11-29

[8]

Hirst Jeffry L., 2005, Reverse mathematics 2001, V21, P222

[9] REVERSE MATHEMATICS AND ORDINAL EXPONENTIATION [J].

HIRST, JL .

ANNALS OF PURE AND APPLIED LOGIC, 1994, 66 (01) :1-18

[10] On principles between Σ1- and Σ2-induction, and monotone enumerations [J].

Kreuzer, Alexander P. ;

Yokoyama, Keita .

JOURNAL OF MATHEMATICAL LOGIC, 2016, 16 (01)

← 1 2 3 →