Strong unfoldability, shrewdness and combinatorial consequences
Philipp L\"ucke

TL;DR
This paper establishes the equivalence of strong unfoldability and shrewd cardinals, constructs ordinal anticipating Laver functions, and explores combinatorial principles and chain conditions related to these large cardinals.
Contribution
It proves the equivalence of strong unfoldability and shrewdness, introduces ordinal anticipating Laver functions, and analyzes the consistency of combinatorial principles at these cardinals.
Findings
Strong unfoldability and shrewd cardinals coincide.
Existence of ordinal anticipating Laver functions for strong unfoldability.
The principle iamond_(Reg) holds at certain strongly unfoldable cardinals.
Abstract
We show that the notions of "strongly unfoldable cardinals", introduced by Villaveces in his model-theoretic studies of models of set theory, and "shrewd cardinals", introduced by Rathjen in a proof-theoretic context, coincide. We then proceed by using ideas from the proof of this equivalence to establish the existence of "ordinal anticipating Laver functions" for strong unfoldability. With the help of these functions, we show that the principle holds at every strongly unfoldable cardinal with the property that there exists a subset of such that every subset of is ordinal definable from . While a result of D\v{z}amonja and Hamkins shows that can consistently fail at a strongly unfoldable cardinal , this implication can be used to prove that various canonical extensions of the axioms…
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 · Neurological and metabolic disorders
