Comparing WO$(\omega^\omega)$ with $\Sigma^0_2$ induction
Stephen G. Simpson

TL;DR
This paper investigates the logical strength of the statement WO$(oldsymbol{ ext{ extomega}}^ ext{ extomega})$, showing its relation to various subsystems of second-order arithmetic, particularly its implications and independence from $oldsymbol{ ext{ extSigma}}^0_2$ induction and bounding schemes.
Contribution
It establishes that WO$( ext{ extomega}^ ext{ extomega})$ is implied by I$oldsymbol{ ext{ extSigma}}^0_2$ and independent of B$oldsymbol{ ext{ extSigma}}^0_2$, clarifying its position in the reverse-mathematical hierarchy.
Findings
WO$( ext{ extomega}^ ext{ extomega})$ is implied by I$ ext{ extSigma}^0_2$
WO$( ext{ extomega}^ ext{ extomega})$ is independent of B$ ext{ extSigma}^0_2$
WO$( ext{ extomega}^ ext{ extomega})$ and B$ ext{ extSigma}^0_2$ do not imply I$ ext{ extSigma}^0_2$
Abstract
Let WO be the statement that the ordinal number is well ordered. WO has occurred several times in the reverse-mathematical literature. The purpose of this expository note is to discuss the place of WO within the standard hierarchy of subsystems of second-order arithmetic. We prove that WO is implied by I and independent of B. We also prove that WO and B together do not imply I.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Mathematical and Theoretical Analysis · Numerical Methods and Algorithms
