The combinatorial essence of supercompactness

DOI10.1016/j.apal.2011.12.017zbMath1280.03051arXiv1012.2040MaRDI QIDQ450963

Christoph Weiß

Publication date: 26 September 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

strongly compact cardinal; supercompact cardinal; ineffable cardinal

Mathematics Subject Classification ID

03E35: Consistency and independence results

03E55: Large cardinals

03E05: Other combinatorial set theory

03E65: Other set-theoretic hypotheses and axioms

Related Items

NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING, SUBCOMPACT CARDINALS, TYPE OMISSION, AND LADDER SYSTEMS, Characterizing large cardinals through Neeman's pure side condition forcing, A REFINEMENT OF THE RAMSEY HIERARCHY VIA INDESCRIBABILITY, Guessing models and the approachability ideal, ITP, ISP, AND SCH, Guessing models imply the singular cardinal hypothesis, The tree property at both ℵ_ω+1and ℵ_ω+2, SPECIALISING TREES WITH SMALL APPROXIMATIONS I, Martin's maximum and tower forcing, Guessing models and generalized Laver diamond, Strong tree properties for two successive cardinals, Simple proofs of SCH from reflection principles without using better scales, PFA and guessing models, On the consistency strength of the proper forcing axiom, Small embedding characterizations for large cardinals, QUOTIENTS OF STRONGLY PROPER FORCINGS AND GUESSING MODELS, THE STRONG TREE PROPERTY AT SUCCESSORS OF SINGULAR CARDINALS, Fragments of strong compactness, families of partitions and ideal extensions, The ineffable tree property and failure of the singular cardinals hypothesis

Cites Work

• Unnamed Item
• On the consistency strength of the proper forcing axiom
• Some partition relations for ideals on \(P_{\kappa}\lambda\)
• The structure of ineffability properties of \(P_{\kappa}\lambda\)
• Partitioning pairs of countable ordinals
• Forcing indestructibility of set-theoretic axioms
• A general Mitchell style iteration
• Stacking mice
• Combinatorial Characterization of Supercompact Cardinals
• Aronszajn trees and the independence of the transfer property
• Some combinatorial problems concerning uncountable cardinals