An isomorphism theorem for models of Weak K\"onig's Lemma without primitive recursion
Marta Fiori-Carones, Leszek Aleksander Ko{\l}odziejczyk, Tin Lok Wong,, Keita Yokoyama

TL;DR
This paper establishes an isomorphism theorem for models of Weak K"onig's Lemma without primitive recursion, revealing collapse results in the analytic hierarchy and analyzing the conservativity of certain subsystems over base theories.
Contribution
It proves an isomorphism theorem for countable models of WKL*0 under specific failure conditions of IΣ₁, and characterizes the complexity of conservative extensions over various subsystems.
Findings
Analytic hierarchy collapses to Δ¹₁ in certain models.
WKL is the strongest Π¹₂ statement that is Π¹₁-conservative over RCA*₀ + ¬IΣ₁.
The set of Π¹₂ sentences that are Π¹₁-conservative over certain theories is c.e. or Π₂-complete.
Abstract
We prove that if and are countable models of the theory such that fails for some , then and are isomorphic. As a consequence, the analytic hierarchy collapses to provably in , and is the strongest statement that is -conservative over . Applying our results to the -definable sets in models of that also satisfy an appropriate relativization of Weak K\"onig's Lemma, we prove that for each , the set of sentences that are -conservative over $\mathrm{RCA}^*_0 + \mathrm{B}\Sigma^0_n +…
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
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Complexity and Algorithms in Graphs
