Prevalence of Generic Laver Diamond

DOI10.1090/S0002-9939-2015-12540-3zbMath1371.03073arXiv1405.2791MaRDI QIDQ5264184

Sean D. Cox

Publication date: 20 July 2015

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.2791

zbMATH Keywords

Chang's conjectureproper forcing axiomgeneric Laver diamondsupercompact Laver function

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55) Other combinatorial set theory (03E05) Generic absoluteness and forcing axioms (03E57)

Cites Work

• Unnamed Item
• Unnamed Item
• Martin's maximum and tower forcing
• Guessing models and generalized Laver diamond
• On the consistency strength of the proper forcing axiom
• Two cardinal versions of diamond
• Some principles related to Chang's conjecture
• The bounded proper forcing axiom and well orderings of the reals
• Can you take Solovay's inaccessible away?
• On certain indestructibility of strong cardinals and a question of Hajnal
• Set theory. An introduction to independence proofs
• Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
• The axiom of determinacy, forcing axioms, and the nonstationary ideal
• Large cardinals and definable counterexamples to the continuum hypothesis
• Splitting \({\mathcal P}_\kappa \lambda\) into maximally many stationary sets
• Forcing with sequences of models of two types
• Condensation and large cardinals
• Partition Problems in Topology
• Laver sequences for extendible and super-almost-huge cardinals
• Some combinatorial problems concerning uncountable cardinals

This page was built for publication: Prevalence of Generic Laver Diamond