More on the preservation of large cardinals under class forcing
Bagaria Joan, Poveda Alejandro

TL;DR
This paper establishes broad preservation results for large cardinals, specifically extendible and $C^{(n)}$-extendible cardinals, under various class forcing iterations, with applications to principles like Vopenka's and the Ground Axiom.
Contribution
It provides new general preservation theorems for large cardinals under class forcing, extending previous results and applying to diverse forcing scenarios including Easton-support and class iterations.
Findings
Preservation of $C^{(n)}$-extendible cardinals under Easton-support iterations.
Forcing with class iterations can produce many disagreements between universe and HOD.
Consistency of $C^{(n)}$-extendible cardinals with V=HOD and the Ground Axiom.
Abstract
We prove two general results about the preservation of extendible and -extendible cardinals under a wide class of forcing iterations (Theorems 5.4 and 7.5). As applications we give new proofs of the preservation of Vop\v{e}nka's Principle and -extendible cardinals under Jensen's iteration for forcing the GCH, previously obtained by Brooke-Taylor and Tsaprounis, res\-pectively. We prove that -extendible cardinals are preserved by forcing with standard Easton-support iterations for any possible -definable behaviour of the power-set function on regular cardinals. We show that one can force proper class-many disagreements between the universe and HOD with respect to the calculation of successors of regular cardinals, while preserving -extendible cardinals. We also show, assuming the GCH, that the class forcing iteration of…
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 · Mathematical and Theoretical Analysis · Computability, Logic, AI Algorithms
