Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 20 Dec 2021 in math.LO

Abstract: 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 $\Delta1_1$ provably in $\mathrm{WKL}*_0 + \neg\mathrm{I}\Sigma0_1$, and $\mathrm{WKL}$ is the strongest $\Pi1_2$ statement that is $\Pi1_1$-conservative over $\mathrm{RCA}*_0 + \neg\mathrm{I}\Sigma0_1$. Applying our results to the $\Delta0_n$-definable sets in models of $\mathrm{RCA}*_0 + \mathrm{B}\Sigma0_n + \neg\mathrm{I}\Sigma0_n$ that also satisfy an appropriate relativization of Weak K\"onig's Lemma, we prove that for each $n \ge 1$, the set of $\Pi1_2$ sentences that are $\Pi1_1$-conservative over $\mathrm{RCA}*_0 + \mathrm{B}\Sigma0_n + \neg\mathrm{I}\Sigma0_n$ is c.e. In contrast, we prove that the set of $\Pi1_2$ sentences that are $\Pi1_1$-conservative over $\mathrm{RCA}*_0 + \mathrm{B}\Sigma0_n$ is $\Pi_2$-complete. This answers a question of Towsner. We also show that $\mathrm{RCA}_0 + \mathrm{RT}2_2$ is $\Pi1_1$-conservative over $\mathrm{B}\Sigma0_2$ if and only if it is conservative over $\mathrm{B}\Sigma0_2$ with respect to $\forall \Pi0_5$ sentences.

Summary

We haven't generated a summary for this paper yet.