The Virtual Large Cardinal Hierarchy
Stamatis Dimopoulos, Victoria Gitman, Dan Saattrup Nielsen

TL;DR
This paper advances the understanding of the virtual large cardinal hierarchy by analyzing virtual versions of superstrong, Woodin, and Berkeley cardinals, providing new characterizations and exploring their interrelations.
Contribution
It introduces new characterizations of virtually Woodin cardinals, explores the virtual Vopenka principle, and clarifies the hierarchy's structure and implications.
Findings
On is virtually Woodin iff for every class A, there is a proper class of virtually A-extendible cardinals.
The virtual Vopenka principle for finite languages is not equivalent but equiconsistent with the virtual Vopenka principle.
If no virtually Berkeley cardinals exist, then On is virtually Woodin iff On is virtually pre-Woodin.
Abstract
We continue the study of the virtual large cardinal hierarchy by analysing virtual versions of superstrong, Woodin, and Berkeley cardinals. Gitman and Schindler showed that virtualizations of strong and supercompact cardinals yield the same large cardinal notion. We provide various equivalent characterizations of virtually Woodin cardinals, including showing that On is virtually Woodin if and only if for every class A, there is a proper class of virtually A-extendible cardinals. We introduce the virtual Vopenka principle for finite languages and show that it is not equivalent to the virtual Vopenka principle (although the two principles are equiconsistent), but is equivalent to the assertion that On is virtually pre-Woodin, a weakening of virtually Woodin, which is equivalent to having for every class A, a weakly virtually A-extendible cardinal. We show that if there are no virtually…
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 · Computability, Logic, AI Algorithms · Mathematical and Theoretical Analysis
