Pith. sign in

REVIEW

Classical Namba forcing can have the weak countable approximation property

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.14083 v2 pith:QUBIC5IG submitted 2023-12-21 math.LO

Classical Namba forcing can have the weak countable approximation property

classification math.LO
keywords forcingsnambaalephanotheranswersapproximationclassicalforcing
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.