JOINT DIAMONDS AND LAVER DIAMONDS
From MaRDI portal
Publication:5195051
Abstract: The concept of jointness for guessing principles, specifically and various Laver diamonds, is introduced. A family of guessing sequences is joint if the elements of any given sequence of targets may be simultaneously guessed by the members of the family. While equivalent in the case of , joint Laver diamonds are nontrivial new objects. We give equiconsistency results for most of the large cardinals under consideration and prove sharp separations between joint Laver diamonds of different lengths in the case of -supercompact cardinals.
Recommendations
Cites work
- Diamonds
- Extensions with the approximation and cover properties have no new large cardinals
- Good and Ok Ultrafilters
- How large is the first strongly compact cardinal? or a study on identity crises
- Iterated forcing and elementary embeddings
- Large cardinals with few measures
- Laver sequences for extendible and super-almost-huge cardinals
- Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
- Menas’ Result is Best Possible
- On certain indestructibility of strong cardinals and a question of Hajnal
- On strong compactness and supercompactness
- On the Existence of Nonregular Ultrafilters and the Cardinality of Ultrapowers
- Perfect-set forcing for uncountable cardinals
- Stationary sets
- The lottery preparation
- The number of normal measures
Cited in
(7)- Diamond-free families
- Jensen's diamond principle and its relatives
- scientific article; zbMATH DE number 1944133 (Why is no real title available?)
- Two cardinal versions of diamond
- Prevalence of generic Laver diamond
- Guessing models and generalized Laver diamond
- Capturing sets of ordinals by normal ultrapowers
This page was built for publication: JOINT DIAMONDS AND LAVER DIAMONDS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5195051)