paper

Vopěnka's Principle without Choice: Preservation under Symmetric Extensions

arXiv:2609.06856

Abstract

We give a detailed proof that every set-sized symmetric extension of a model of again satisfies , where is formulated for arbitrary set-sized languages. For each standard , the same preservation theorem holds for , with set parameters and arbitrary set-sized languages. We also prove that and are equiconsistent, and that proves the existence of a proper class of Löwenheim-Skolem cardinals. Relative to , the axiom is independent of . The preservation theorem also yields Feferman-Lévy and full Solovay models satisfying . We consider whether every countable model of has a class-generic extension satisfying .

arXiv comment20 pages, no figures