Guessing models and the approachability ideal

DOI10.1142/S0219061321500033OpenAlexW3043954286MaRDI QIDQ5156468

Boban Velickovic, Rahman Mohammadpour

Publication date: 18 October 2021

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.10125

zbMATH Keywords

supercompact cardinalsapproachability idealside conditions

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55) Other combinatorial set theory (03E05)

Related Items (2)

Weak saturation properties and side conditions ⋮ Indestructibility of some compactness principles over models of \(\mathsf{PFA} \)

Cites Work

• Unnamed Item
• Unnamed Item
• Guessing models and generalized Laver diamond
• The combinatorial essence of supercompactness
• Strong tree properties for two successive cardinals
• PFA and guessing models
• On the consistency strength of the proper forcing axiom
• A model of Cummings and Foreman revisited
• Adding closed unbounded subsets of \(\omega_2\) with finite forcing
• Aronszajn trees on \(\aleph_2\) and \(\aleph_3\).
• Reflecting stationary sets and successors of singular cardinals
• The tree property
• Forcing with sequences of models of two types
• On the role of supercompact and extendible cardinals in logic
• QUOTIENTS OF STRONGLY PROPER FORCINGS AND GUESSING MODELS
• Successors of Singular Cardinals
• Forcing indestructibility of set-theoretic axioms
• 𝐼[𝜔₂ can be the nonstationary ideal on 𝐶𝑜𝑓(𝜔₁)]
• Extensions with the approximation and cover properties have no new large cardinals
• Advances in Cardinal Arithmetic
• Strong tree properties for small cardinals
• Guessing models imply the singular cardinal hypothesis
• A weak variation of shelah's I[ω₂]
• Indestructible guessing models and the continuum

This page was built for publication: Guessing models and the approachability ideal