Lévy-Montague reflection is Π11-conservative over WKL0
Fedor Pakhomov
Abstract
We study a Lévy-Montague reflection scheme Rfn 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 RCA0 can be extended, without changing its first-order part, to a model of WKL0 together with the full scheme Rfn. It follows at once that WKL0+Rfn is Π11-conservative over both WKL0 and RCA0, that its first-order part is exactly IΣ1, and that it is Π02-conservative over PRA. The result opens an avenue for adopting, within a theory conservative over PRA, Feferman's ZFC-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 ω1-tower of forcing extensions, and its uncountable cofinality is what secures reflection. We are only able to prove the conservation in PRA+1-Con(Z2). The results were obtained with extensive use of Anthropic's large language model Fable 5.
Create a lesson
Related papers
Stalnaker's logical problem of conditionals is unsolvable
Alexander W. Kocurek, James Walsh, Yale Weiss
Strong completeness of the logic J
Juan P. Aguilera, Grigorii Stepanov
Contact relations on bounded distributive lattices and related structures
Ivo Düntsch, Rafał Gruszczyński
Embeddings of Propositional Logics into the Provability Logics S and D
Mashu Noguchi
Some results on NIP groups and their Ellis groups
Atticus Stonestrom
Group-extensive embeddings into Fraïssé structures and stationary weak independence relations
Aleksandra Kwiatkowska, Rob Sullivan, Jeroen Winkel