The combinatorial essence of supercompactness
From MaRDI portal
Publication:450963
DOI10.1016/j.apal.2011.12.017zbMath1280.03051arXiv1012.2040OpenAlexW2127604217MaRDI QIDQ450963
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
Consistency and independence results (03E35) Large cardinals (03E55) Other combinatorial set theory (03E05) Other set-theoretic hypotheses and axioms (03E65)
Related Items
Small embedding characterizations for large cardinals, Fragments of strong compactness, families of partitions and ideal extensions, THE STRONG TREE PROPERTY AT SUCCESSORS OF SINGULAR CARDINALS, Martin's maximum and tower forcing, SUBCOMPACT CARDINALS, TYPE OMISSION, AND LADDER SYSTEMS, Indestructibility of some compactness principles over models of \(\mathsf{PFA} \), Piece selection and cardinal arithmetic, SPECIALISING TREES WITH SMALL APPROXIMATIONS I, Strong tree properties, Kurepa trees, and guessing models, On the consistency strength of the proper forcing axiom, Guessing models and generalized Laver diamond, Strong tree properties for two successive cardinals, The ineffable tree property and failure of the singular cardinals hypothesis, Characterizing large cardinals through Neeman's pure side condition forcing, A REFINEMENT OF THE RAMSEY HIERARCHY VIA INDESCRIBABILITY, Simple proofs of SCH from reflection principles without using better scales, PFA and guessing models, Guessing models and the approachability ideal, NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING, QUOTIENTS OF STRONGLY PROPER FORCINGS AND GUESSING MODELS, ITP, ISP, AND SCH, Guessing models imply the singular cardinal hypothesis, The tree property at both ℵω+1and ℵω+2
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