English

Classical Namba forcing can have the weak countable approximation property

Logic 2025-03-24 v2

Abstract

We show that it is consistent from an inaccessible cardinal that classical Namba forcing has the weak ω1\omega_1-approximation property. In fact, this is the case if 1\aleph_1-preserving forcings do not add cofinal branches to 1\aleph_1-sized trees. The exact statement we obtain is similar to Hamkins' Key Lemma. It follows as a corollary that MM\mathsf{MM} implies that there are stationarily many indestructibly weakly ω1\omega_1-guessing models that are not internally unbounded. This answers a question of Cox and Krueger and partially answers another. Our result on MM\mathsf{MM} gives a short proof of a weakening of Cox and Krueger's main result by removing their use of higher Namba forcings, but we find another application of their ideas by answering a question of Adolf, Apter, and Koepke on preservation of successive cardinals by singularizing forcings.

Keywords

Cite

@article{arxiv.2312.14083,
  title  = {Classical Namba forcing can have the weak countable approximation property},
  author = {Maxwell Levine},
  journal= {arXiv preprint arXiv:2312.14083},
  year   = {2025}
}

Comments

Revised version: The statements are the same as the submitted version, plus corrections from a helpful referee report

R2 v1 2026-06-28T13:59:00.875Z