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 ω1-approximation property. In fact, this is the case if 1-preserving forcings do not add cofinal branches to 1-sized trees. The exact statement we obtain is similar to Hamkins' Key Lemma. It follows as a corollary that MM implies that there are stationarily many indestructibly weakly ω1-guessing models that are not internally unbounded. This answers a question of Cox and Krueger and partially answers another. Our result on 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…