About Prikry generic extensions (Q1814134): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 00:31, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | About Prikry generic extensions |
scientific article |
Statements
About Prikry generic extensions (English)
0 references
25 June 1992
0 references
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).
0 references
measurable cardinal
0 references
Prikry-generic sequence
0 references
greatest lower bound
0 references
least upper bound
0 references
Mathias forcing
0 references