About Prikry generic extensions (Q1814134): Difference between revisions

Let \(M\) be a model of ZFC with a measurable cardinal \(\kappa\), and let \(\sigma\) be a Prikry-generic sequence in \(\kappa\). The author investigates the structure of the family of models \(\{M [\sigma \upharpoonright E]\): \(E\subseteq \omega\}\). It turns out that no countably infinite strictly decreasing sequence has a greatest lower bound with respect to constructibility, nor does any strictly increasing sequence have a least upper bound. In the case of \(\omega_ 1\)- sequences, the author shows that one may, but need not, have a least upper or greatest lower bound; one can have \(M\) and \(M[ \sigma]\) as glb or lub. The author discusses the same questions for Mathias forcing (mostly with respect to a selective ultrafilter).