SUBCOMPACT CARDINALS, TYPE OMISSION, AND LADDER SYSTEMS

DOI10.1017/jsl.2022.11OpenAlexW4210438098MaRDI QIDQ5100051

Yair Hayut, Menachem Magidor

Publication date: 29 August 2022

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

supercompact cardinalstype omissionstrong tree property

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The combinatorial essence of supercompactness
• Fragility and indestructibility. II
• The least weakly compact cardinal can be unfoldable, weakly measurable and nearly \(\theta\)-supercompact
• On the consistency strength of the proper forcing axiom
• Partial near supercompactness
• Characterizations of the weakly compact ideal on \(P_\kappa\lambda\)
• Model theoretic characterizations of large cardinals
• THE STRONG TREE PROPERTY AT SUCCESSORS OF SINGULAR CARDINALS
• Ramsey-like cardinals
• Stationary Sets
• Iterated Forcing and Elementary Embeddings
• Indescribable cardinals and elementary embeddings
• Compactness for omitting of types
• Saturated ideals
• Canonical seeds and Prikry trees
• Combinatorial Characterization of Supercompact Cardinals
• Square compactness and the filter extension property
• Partial strong compactness and squares
• From accessible to inaccessible cardinals (Results holding for all accessible cardinal numbers and the problem of their extension to inaccessible ones)
• Aronszajn trees and the independence of the transfer property
• Some combinatorial problems concerning uncountable cardinals
• CHARACTERIZATION OF □_κ IN CORE MODELS
• Equiconsistencies at subcompact cardinals