An isomorphism theorem for models of Weak K\"onig's Lemma without primitive recursion
Abstract
We prove that if (M,X) and (M,Y) are countable models of the theory WKL*0 such that I1(A) fails for some A ∈ X Y, then (M,X) and (M,Y) are isomorphic. As a consequence, the analytic hierarchy collapses to 11 provably in WKL*0 + 01, and WKL is the strongest 12 statement that is 11-conservative over RCA*0 + 01. Applying our results to the 0n-definable sets in models of RCA*0 + B0n + 0n that also satisfy an appropriate relativization of Weak K\"onig's Lemma, we prove that for each n 1, the set of 12 sentences that are 11-conservative over RCA*0 + B0n + 0n is c.e. In contrast, we prove that the set of 12 sentences that are 11-conservative over RCA*0 + B0n is 2-complete. This answers a question of Towsner. We also show that RCA0 + RT22 is 11-conservative over B02 if and only if it is conservative over B02 with respect to ∀ 05 sentences.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.