
TL;DR
This paper investigates the prevalence and consistency of the Generic Laver Diamond principle, showing it holds under various conditions and weaker hypotheses than previously known, with implications for set-theoretic combinatorics.
Contribution
It weakens the hypothesis needed for the existence of the Generic Laver Diamond and demonstrates its widespread occurrence in different models of set theory.
Findings
PFA implies iamond_{ ext{Lav}}(\u03c4) for c4= 2
iamond_{ ext{Lav}}(c4) holds in models where Chang's Conjecture fails
A specific forcing adds iamond_{ ext{Lav}}(c4) for successor cardinals
Abstract
Viale \cite{Viale_GuessingModel} introduced the notion of Generic Laver Diamond at ---which we denote ---asserting the existence of a single function from that behaves much like a supercompact Laver function, except with generic elementary embeddings rather than internal embeddings. Viale proved that the Proper Forcing Axiom (PFA) implies . We strengthen his theorem by weakening the hypothesis to a statement strictly weaker than PFA. We also show that the principle provides a uniform, simple construction of 2-cardinal diamonds, and prove that is quite prevalent in models of set theory; in particular: 1) satisfies whenever is a successor cardinal, or when the appropriate version 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 · Computability, Logic, AI Algorithms · Limits and Structures in Graph Theory
