Classical Namba forcing can have the weak countable approximation property
Abstract
We show that it is consistent from an inaccessible cardinal that classical Namba forcing has the weak -approximation property. In fact, this is the case if -preserving forcings do not add cofinal branches to -sized trees. The exact statement we obtain is similar to Hamkins' Key Lemma. It follows as a corollary that implies that there are stationarily many indestructibly weakly -guessing models that are not internally unbounded. This answers a question of Cox and Krueger and partially answers another. Our result on 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