JOINT DIAMONDS AND LAVER DIAMONDS
From MaRDI portal
Publication:5195051
DOI10.1017/JSL.2019.3zbMATH Open1439.03094arXiv1708.02145OpenAlexW3104159163MaRDI QIDQ5195051FDOQ5195051
Publication date: 17 September 2019
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1708.02145
Recommendations
Other combinatorial set theory (03E05) Consistency and independence results (03E35) Large cardinals (03E55)
Cites Work
- Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
- Iterated Forcing and Elementary Embeddings
- The number of normal measures
- Perfect-set forcing for uncountable cardinals
- Large cardinals with few measures
- How large is the first strongly compact cardinal? or a study on identity crises
- Stationary Sets
- Good and Ok Ultrafilters
- The lottery preparation
- Laver sequences for extendible and super-almost-huge cardinals
- On strong compactness and supercompactness
- Extensions with the approximation and cover properties have no new large cardinals
- On certain indestructibility of strong cardinals and a question of Hajnal
- Diamonds
- On the Existence of Nonregular Ultrafilters and the Cardinality of Ultrapowers
- Menas’ Result is Best Possible
Cited In (4)
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)