
TL;DR
This paper introduces and analyzes $C^{(n)}$-cardinals, a hierarchy of large cardinals based on elementary substructure properties, revealing their naturalness and connections to reflection principles and Vopeka's Principle.
Contribution
It defines $C^{(n)}$-cardinals, explores their hierarchy, and links them to reflection principles and Vopeka's Principle, providing new insights into large cardinal theory.
Findings
$C^{(n)}$-cardinals form a finer hierarchy from superstrong to rank-into-rank levels.
Existence of $C^{(n)}$-extendible cardinals is equivalent to reflection principles.
New characterizations of Vopeka's Principle using $C^{(n)}$-extendible cardinals.
Abstract
For each natural number , let be the closed and unbounded proper class of ordinals such that is a elementary substructure of . We say that is a \emph{-cardinal} if it is the critical point of an elementary embedding , transitive, with in . By analyzing the notion of -cardinal at various levels of the usual hierarchy of large cardinal principles we show that, starting at the level of superstrong cardinals and up to the level of rank-into-rank embeddings, -cardinals form a much finer hierarchy. The naturalness of the notion of -cardinal is exemplified by showing that the existence of -extendible cardinals is equivalent to simple reflection principles for classes of structures, which generalize the notions of supercompact and extendible cardinals.…
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 · Homotopy and Cohomology in Algebraic Topology · Computability, Logic, AI Algorithms
