Inner models with large cardinal features usually obtained by forcing
Arthur Apter, Victoria Gitman, Joel David Hamkins

TL;DR
This paper constructs various inner models with large cardinal features typically obtained by forcing, demonstrating their existence under different large cardinal assumptions and introducing three proof methods.
Contribution
It introduces new inner models with large cardinal properties obtained without forcing, using three general proof techniques.
Findings
Inner models with supercompact, strongly compact, and Ramsey cardinals constructed.
Existence of inner models with GCH+V=HOD under certain assumptions.
Inner models with indestructible supercompact cardinals and level-by-level equivalences.
Abstract
We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible supercompact cardinal. If there is a supercompact cardinal, then there is an inner model with a supercompact cardinal \kappa for which 2^\kappa=\kappa^+, another for which 2^\kappa=\kappa^++ and another in which the least strongly compact cardinal is supercompact. If there is a strongly compact cardinal, then there is an inner model with a strongly compact cardinal, for which the measurable cardinals are bounded below it and another inner model W with a strongly compact cardinal \kappa, such that H_{\kappa^+}^V\subseteq HOD^W. Similar facts hold for supercompact, measurable and strongly Ramsey cardinals. If a cardinal is supercompact up to a weakly iterable…
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
