Timeline for Is Prikry forcing minimal?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 6, 2013 at 19:23 | comment | added | Asaf Karagila♦ | @Andres: That's great! I'll go take a look! | |
| Aug 6, 2013 at 19:01 | comment | added | Andrés E. Caicedo | I saw Kanovei talk about this at Caltech a few years ago. There are two notes, but neither seems (yet) published, both accessible from Gitik's page: "Intermediate models of Prikry generic extensions" by Gitik, Kanovei, Koepke, and "A remark on subforcings of the Prikry forcing", by Gitik. In the latter, he shows that any nontrivial subfrocing of Prikry forcing is isomorphic to Prikry forcing with the same ultrafilter. In the former, they prove the result Philip described. | |
| Aug 6, 2013 at 18:41 | vote | accept | Asaf Karagila♦ | ||
| Aug 6, 2013 at 16:03 | comment | added | Philip Welch | Then "Yes" once more! | |
| Aug 6, 2013 at 16:02 | history | edited | Philip Welch | CC BY-SA 3.0 |
Clarification that $G$ is the generic set from which the sequence $x$ arises.
|
| Aug 6, 2013 at 15:59 | comment | added | Asaf Karagila♦ | Thank you for the answer and the reference Philip. When I say that $y,w$ are pairwise generic I mean that neither is definable from the other, so $y\notin M[w]$ and $w\notin M[y]$ either. | |
| Aug 6, 2013 at 15:55 | history | answered | Philip Welch | CC BY-SA 3.0 |