Lévy-Montague reflection is -conservative over
arXiv:2608.07050
Abstract
We study a Lévy-Montague reflection scheme in second-order arithmetic: for each formula , the scheme asserts that every set belongs to a countable coded -model such that is absolute, at all parameters from the model, between the model and the universe. Our central result is a model extension construction: every countable model of can be extended, without changing its first-order part, to a model of together with the full scheme . It follows at once that is -conservative over both and , that its first-order part is exactly , and that it is -conservative over . The result opens an avenue for adopting, within a theory conservative over , Feferman's -formalization of universe-based category-theoretic arguments that was achieved using Lévy-Montague reflection. The conservation proof itself, however, is non-finitary. The extension is the union of an -tower of forcing extensions, and its uncountable cofinality is what secures reflection. We are only able to prove the conservation in . The results were obtained with extensive use of Anthropic's large language model Fable 5.
arXiv comment26 pages