The combinatorial essence of supercompactness

DOI10.1016/J.APAL.2011.12.017MaRDI QIDQ450963zbMATH OpenOpenAlexFDO

Authors 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

supercompact cardinalineffable cardinalstrongly compact cardinal

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Large cardinals (03E55) Other set-theoretic hypotheses and axioms (03E65)

Abstract: We introduce combinatorial principles that characterize strong compactness and supercompactness for inaccessible cardinals but also make sense for successor cardinals. Their consistency is established from what is supposedly optimal. Utilizing the failure of a weak version of square, we show that the best currently known lower bounds for the consistency strength of these principles can be applied.

Recommendations

• Strong tree properties for small cardinals
• The ineffable tree property and failure of the singular cardinals hypothesis
• The super tree property at the successor of a singular
• The strong tree property and weak square
• Identity crises and strong compactness
• Covering for category and combinatorics on \(P_\kappa(\lambda)\)
• Easton's theorem for the tree property below \(\aleph_\omega\)
• The tree property
• On \(\kappa\)-compact cardinals
• Cardinal characteristics at \(\kappa\) in a small \(\mathfrak{u}(\kappa)\) model

Cites work

• scientific article; zbMATH DE number 3496166 (Why is no real title available?)
• A general Mitchell style iteration
• Aronszajn trees and the independence of the transfer property
• Combinatorial Characterization of Supercompact Cardinals
• Forcing indestructibility of set-theoretic axioms
• On the consistency strength of the proper forcing axiom
• Partitioning pairs of countable ordinals
• Some combinatorial problems concerning uncountable cardinals
• Some partition relations for ideals on \(P_{\kappa}\lambda\)
• Stacking mice
• The structure of ineffability properties of \(P_{\kappa}\lambda\)

Cited in

(28)

• Guessing models imply the singular cardinal hypothesis
• The ineffable tree property and failure of the singular cardinals hypothesis
• SPECIALISING TREES WITH SMALL APPROXIMATIONS I
• Strong tree properties, Kurepa trees, and guessing models
• The tree property at both \(\aleph_{\omega +1}\) and \(\aleph_{\omega +2}\)
• Guessing models and the approachability ideal
• Small embedding characterizations for large cardinals
• Two upper bounds on consistency strength of \(\neg \square_{\aleph_\omega}\) and stationary set reflection at two successive \(\aleph_n\)
• Indestructibility of some compactness principles over models of \(\mathsf{PFA} \)
• The strong tree property at successors of singular cardinals
• Strong tree properties for two successive cardinals
• Quotients of strongly proper forcings and guessing models
• Narrow systems revisited
• Characterizing large cardinals through Neeman's pure side condition forcing
• Subcompact cardinals, type omission, and ladder systems
• The strong and super tree properties at successors of singular cardinals
• ITP, ISP, and SCH
• Piece selection and cardinal arithmetic
• Simple proofs of SCH from reflection principles without using better scales
• Fragments of strong compactness, families of partitions and ideal extensions
• PFA and guessing models
• Namba forcing, weak approximation, and guessing
• \(I_0\) and combinatorics at \(\lambda ^+\)
• Martin's maximum and tower forcing
• Guessing models and generalized Laver diamond
• A refinement of the Ramsey hierarchy via indescribability
• On the consistency strength of the proper forcing axiom
• Smaller Explicit Superconcentrators

This page was built for publication: The combinatorial essence of supercompactness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450963)