Guessing models and the approachability ideal
From MaRDI portal
(Redirected from Publication:5156468)
Recommendations
Cites work
- A model of Cummings and Foreman revisited
- A weak variation of shelah's I[ω2]
- Adding closed unbounded subsets of _2 with finite forcing
- Advances in Cardinal Arithmetic
- Aronszajn trees on _2 and _3.
- Extensions with the approximation and cover properties have no new large cardinals
- Forcing indestructibility of set-theoretic axioms
- Forcing with sequences of models of two types
- Guessing models and generalized Laver diamond
- Guessing models imply the singular cardinal hypothesis
- scientific article; zbMATH DE number 5130974 (Why is no real title available?)
- scientific article; zbMATH DE number 3702632 (Why is no real title available?)
- Indestructible guessing models and the continuum
- On the consistency strength of the proper forcing axiom
- On the role of supercompact and extendible cardinals in logic
- PFA and guessing models
- Quotients of strongly proper forcings and guessing models
- Reflecting stationary sets and successors of singular cardinals
- Strong tree properties for small cardinals
- Strong tree properties for two successive cardinals
- Successors of singular cardinals
- The combinatorial essence of supercompactness
- The tree property
- 𝐼[𝜔₂] can be the nonstationary ideal on 𝐶𝑜𝑓(𝜔₁)
Cited in
(7)- The saturation of club guessing ideals
- Some consequences of reflection on the approachability ideal
- Weak saturation properties and side conditions
- Indestructibility of some compactness principles over models of \(\mathsf{PFA} \)
- Slender trees and the approximation property
- Total failure of approachability at successors of singulars of countable cofinality
- On indestructible strongly guessing models
This page was built for publication: Guessing models and the approachability ideal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5156468)
