NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING

DOI10.1017/JSL.2018.30zbMath1477.03178arXiv1610.00319OpenAlexW3098624263WikidataQ128715420 ScholiaQ128715420MaRDI QIDQ4647111

John Krueger, Sean D. Cox

Publication date: 4 January 2019

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

forcing axiomsNamba forcingweak \(\omega_{1}\)-approximation propertyweak \(\omega_{1}\)-guessingwGMP

Mathematics Subject Classification ID

Consistency and independence results (03E35) Large cardinals (03E55) Other combinatorial set theory (03E05) Other set-theoretic hypotheses and axioms (03E65) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (3)

Fresh function spectra ⋮ Guessing models imply the singular cardinal hypothesis ⋮ Specializing trees and answer to a question of Williams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Guessing models and generalized Laver diamond
• The combinatorial essence of supercompactness
• On the consistency strength of the proper forcing axiom
• On the Hamkins approximation property
• Martin's maximum, saturated ideals, and nonregular ultrafilters. I
• Internally club and approachable
• QUOTIENTS OF STRONGLY PROPER FORCINGS AND GUESSING MODELS
• Iterated Forcing and Elementary Embeddings
• Ideals and Generic Elementary Embeddings
• Some Combinatorial Properties of Trees
• Extensions with the approximation and cover properties have no new large cardinals
• Separating stationary reflection principles
• Indestructible guessing models and the continuum

This page was built for publication: NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING