An isomorphism theorem for models of Weak K\"onig's Lemma without primitive recursion
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 is c.e. In contrast, we prove that the set of sentences that are -conservative over is -complete. This answers a question of Towsner. We also show that is -conservative over if and only if it is conservative over with respect to sentences.
Keywords
Cite
@article{arxiv.2112.10876,
title = {An isomorphism theorem for models of Weak K\"onig's Lemma without primitive recursion},
author = {Marta Fiori-Carones and Leszek Aleksander Kołodziejczyk and Tin Lok Wong and Keita Yokoyama},
journal= {arXiv preprint arXiv:2112.10876},
year = {2022}
}
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