arXiv Analytics

Sign in

arXiv:2112.10876 [math.LO]AbstractReferencesReviewsResources

An isomorphism theorem for models of Weak König's Lemma without primitive recursion

Marta Fiori-Carones, Leszek Aleksander Kołodziejczyk, Tin Lok Wong, Keita Yokoyama

Published 2021-12-20, updated 2022-08-27Version 2

We prove that if $(M,\mathcal{X})$ and $(M,\mathcal{Y})$ are countable models of the theory $\mathrm{WKL}^*_0$ such that $\mathrm{I}\Sigma_1(A)$ fails for some $A \in \mathcal{X} \cap \mathcal{Y}$, then $(M,\mathcal{X})$ and $(M,\mathcal{Y})$ are isomorphic. As a consequence, the analytic hierarchy collapses to $\Delta^1_1$ provably in $\mathrm{WKL}^*_0 + \neg\mathrm{I}\Sigma^0_1$, and $\mathrm{WKL}$ is the strongest $\Pi^1_2$ statement that is $\Pi^1_1$-conservative over $\mathrm{RCA}^*_0 + \neg\mathrm{I}\Sigma^0_1$. Applying our results to the $\Delta^0_n$-definable sets in models of $\mathrm{RCA}^*_0 + \mathrm{B}\Sigma^0_n + \neg\mathrm{I}\Sigma^0_n$ that also satisfy an appropriate relativization of Weak K\"onig's Lemma, we prove that for each $n \ge 1$, the set of $\Pi^1_2$ sentences that are $\Pi^1_1$-conservative over $\mathrm{RCA}^*_0 + \mathrm{B}\Sigma^0_n + \neg\mathrm{I}\Sigma^0_n$ is c.e. In contrast, we prove that the set of $\Pi^1_2$ sentences that are $\Pi^1_1$-conservative over $\mathrm{RCA}^*_0 + \mathrm{B}\Sigma^0_n$ is $\Pi_2$-complete. This answers a question of Towsner. We also show that $\mathrm{RCA}_0 + \mathrm{RT}^2_2$ is $\Pi^1_1$-conservative over $\mathrm{B}\Sigma^0_2$ if and only if it is conservative over $\mathrm{B}\Sigma^0_2$ with respect to $\forall \Pi^0_5$ sentences.

Comments: 29 pages. Somewhat more polished version compared to v1, with small improvements and simplifications throughout the text but no major mathematical changes. Introduction slightly expanded to point out model-theoretic aspects of the paper
Categories: math.LO
Subjects: 03H15, 03C10, 03B30, 03C62, 03F30, 03F35
Related articles: Most relevant | Search more
arXiv:1912.09049 [math.LO] (Published 2019-12-19)
The Strength of Ramsey's Theorem For Pairs over trees: I. Weak König's Lemma
arXiv:1410.3649 [math.LO] (Published 2014-10-14)
Categorical characterizations of the natural numbers require primitive recursion
arXiv:1502.03622 [math.LO] (Published 2015-02-12)
Bar recursion as primitive recursion with nonstandard numbers