arXiv:2304.03021 [math.LO]AbstractReferencesReviewsResources
Weak well orders and Fraïssé's conjecture
Published 2023-04-06Version 1
The notion of 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\"iss\'e's conjecture, which has been proved by Laver. We also fill a small gap in Shore's proof that Fra\"iss\'e's conjecture implies arithmetic transfinite recursion over ${\bf RCA}_0$, by giving a new proof of $\Sigma^0_2$-induction.
Categories: math.LO
Related articles: Most relevant | Search more
arXiv:1607.04506 [math.LO] (Published 2016-07-15)
Partial orders and immunity in reverse mathematics
arXiv:1411.1592 [math.LO] (Published 2014-11-06)
The complexity of satisfaction problems in reverse mathematics
arXiv:1501.07709 [math.LO] (Published 2015-01-30)
Iterative forcing and hyperimmunity in reverse mathematics