7
$\begingroup$

It is known that Namba forcing is stationary-preserving and hence can be used in the setting of Martin's Maximum. Does this result in any striking consequences?

$\endgroup$
6
  • $\begingroup$ Maybe the Strong Chang Conjecture? $\endgroup$ Apr 11, 2010 at 0:20
  • $\begingroup$ Is the proof a relatively direct application of Namba forcing? Or is it more indirect? $\endgroup$ Apr 11, 2010 at 0:41
  • $\begingroup$ I added the forcing tag. $\endgroup$ Apr 11, 2010 at 0:43
  • $\begingroup$ @Francois: Are you referring to Shelah's result that "Namba forcing is semiproper" implies SCC? $\endgroup$
    – Haim
    Apr 11, 2010 at 0:53
  • 1
    $\begingroup$ That's what I was wondering. I'd like an application with a proof along the lines of those in Baumgartner's great article on PFA. If the proof of the Strong Chang Conjecture is: MM implies Namba is semi-proper which implies SCC, then I'm not satisfied. $\endgroup$ Apr 11, 2010 at 1:01

3 Answers 3

8
$\begingroup$

Magidor's proof that MM implies that there are no good scales of length lambda^+ for lambda>cf(lambda)=w, utilizes a Namba-style forcing.

$\endgroup$
6
$\begingroup$

I think that I may have found a suitable candidate; namely, the result of Konig and Yoshinobu that $MM$ implies that there are no $\omega_{1}$-regressive $\omega_{2}$-Kurepa trees. The proof seems to have the same relatively direct flavor as those in Baumgartner's $PFA$ article.

$\endgroup$
3
$\begingroup$

Justin Moore asked a similar question a while ago, and I pointed him to my papers with Claverie and Doebler. Even though it doesn't exactly answer your question: Namba-like forcings (in the sense that they are stationary set preserving and make $\omega_2$ $\omega$-cofinal) have many applications in the presence of ${\sf MM}$. The most recent one is my proof with David Asperó that ${\sf MM}^{++}$ implies Woodin's $(*)$, see https://ivv5hpp.uni-muenster.de/u/rds/MM_implies_star.pdf .

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.