Combinatorial Characterization of Supercompact Cardinals
From MaRDI portal
Cites work
Cited in
(36)- The structure of ineffability properties of \(P_{\kappa}\lambda\)
- Small embedding characterizations for large cardinals
- Partition relations for \(\kappa\)-normal ideals on \(P_{\kappa}(\lambda)\)
- Maximum deconstructibility in module categories
- The super tree property at the successor of a singular
- Two-cardinal versions of weak compactness: partitions of triples
- The strong tree property at successors of singular cardinals
- The ineffable tree property and failure of the singular cardinals hypothesis
- An Extension of the Closed Unbounded Filter
- Closure Sets of Functions and a Hierarchy of Filters
- Necessary and sufficient conditions for the existence of an \(n\)-subtle cardinal
- Guessing models and generalized Laver diamond
- The combinatorial essence of supercompactness
- Notes on the partition property of \({\mathcal{P}_\kappa\lambda}\)
- Strong tree properties for two successive cardinals
- Hierarchies of forcing axioms, the continuum hypothesis and square principles
- The consistency strength of the perfect set property for universally Baire sets of reals
- Subcompact cardinals, type omission, and ladder systems
- The strong tree property and weak square
- On the universality of the nonstationary ideal
- Rado's conjecture and its Baire version
- Characterizing large cardinals through Neeman's pure side condition forcing
- Characterizing large cardinals in terms of layered posets
- ITP, ISP, and SCH
- The tree property at both \(\aleph_{\omega +1}\) and \(\aleph_{\omega +2}\)
- Indestructibility of some compactness principles over models of \(\mathsf{PFA} \)
- Strong tree properties, Kurepa trees, and guessing models
- On the consistency strength of the proper forcing axiom
- Two-cardinal versions of weak compactness: partitions of pairs
- Two-cardinal ideal operators and indescribability
- Narrow systems revisited
- The strong and super tree properties at successors of singular cardinals
- Guessing models, trees and cardinal arithmetic
- Super-ineffability and normal welch games
- A model of Cummings and Foreman revisited
- Patching ideal families on \({\mathcal P}_\kappa\lambda\)
This page was built for publication: Combinatorial Characterization of Supercompact Cardinals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4404891)