The combinatorial essence of supercompactness
From MaRDI portal
Publication:450963
DOI10.1016/J.APAL.2011.12.017zbMATH Open1280.03051arXiv1012.2040OpenAlexW2127604217MaRDI QIDQ450963FDOQ450963
Authors: Christoph Weiß 
Publication date: 26 September 2012
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1012.2040
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
Other combinatorial set theory (03E05) Consistency and independence results (03E35) Large cardinals (03E55) Other set-theoretic hypotheses and axioms (03E65)
Cites Work
- Partitioning pairs of countable ordinals
- Title not available (Why is that?)
- Aronszajn trees and the independence of the transfer property
- On the consistency strength of the proper forcing axiom
- A general Mitchell style iteration
- Combinatorial Characterization of Supercompact Cardinals
- Some combinatorial problems concerning uncountable cardinals
- The structure of ineffability properties of \(P_{\kappa}\lambda\)
- Forcing indestructibility of set-theoretic axioms
- Stacking mice
- Some partition relations for ideals on \(P_{\kappa}\lambda\)
Cited In (28)
- 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
- Indestructibility of some compactness principles over models of \(\mathsf{PFA} \)
- Two upper bounds on consistency strength of \(\neg \square_{\aleph_\omega}\) and stationary set reflection at two successive \(\aleph_n\)
- The strong tree property at successors of singular cardinals
- Strong tree properties for two successive cardinals
- Narrow systems revisited
- Quotients of strongly proper forcings and guessing models
- 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
- Fragments of strong compactness, families of partitions and ideal extensions
- Simple proofs of SCH from reflection principles without using better scales
- PFA and guessing models
- Namba forcing, weak approximation, and guessing
- \(I_0\) and combinatorics at \(\lambda ^+\)
- Martin's maximum and tower forcing
- A refinement of the Ramsey hierarchy via indescribability
- Guessing models and generalized Laver diamond
- Smaller Explicit Superconcentrators
- On the consistency strength of the proper forcing axiom
- Guessing models imply the singular cardinal hypothesis
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)
