Canonical Seeds and Prikry Trees

Journal of Symbolic Logic 62 (2):373-396 (1997)
  Copy   BIBTEX

Abstract

Applying the seed concept to Prikry tree forcing $\mathbb{P}_\mu$, I investigate how well $\mathbb{P}_\mu$ preserves the maximality property of ordinary Prikry forcing and prove that $\mathbb{P}_\mu$ Prikry sequences are maximal exactly when $\mu$ admits no non-canonical seeds via a finite iteration. In particular, I conclude that if $\mu$ is a strongly normal supercompactness measure, then $\mathbb{P}_\mu$ Prikry sequences are maximal, thereby proving, for a large class of measures, a conjecture of W. Hugh Woodin's.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Canonical seeds and Prikry trees.Joel David Hamkins - 1997 - Journal of Symbolic Logic 62 (2):373-396.
Generalized Prikry forcing and iteration of generic ultrapowers.Hiroshi Sakai - 2005 - Mathematical Logic Quarterly 51 (5):507-523.
Mathias–Prikry and Laver–Prikry type forcing.Michael Hrušák & Hiroaki Minami - 2014 - Annals of Pure and Applied Logic 165 (3):880-894.
A Characterization of Generalized Příkrý Sequences.Gunter Fuchs - 2005 - Archive for Mathematical Logic 44 (8):935-971.
The short extenders gap two forcing is of Prikry type.Carmi Merimovich - 2009 - Archive for Mathematical Logic 48 (8):737-747.
Supercompact extender based Prikry forcing.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (5-6):591-602.
The short extenders gap three forcing using a morass.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (1-2):115-135.
A formalism for some class of forcing notions.Piotr Koszmider & P. Koszmider - 1992 - Mathematical Logic Quarterly 38 (1):413-421.
Indestructible strong compactness and level by level inequivalence.Arthur W. Apter - 2013 - Mathematical Logic Quarterly 59 (4-5):371-377.
An $mathbb{S}_{max}$ Variation for One Souslin Tree.Paul Larson - 1999 - Journal of Symbolic Logic 64 (1):81-98.
Prikry forcing at κ+ and beyond.William Mitchell - 1987 - Journal of Symbolic Logic 52 (1):44 - 50.

Analytics

Added to PP
2017-02-21

Downloads
6 (#1,425,536)

6 months
1 (#1,533,009)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Joel David Hamkins
Oxford University

Citations of this work

Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
Elementary chains and C (n)-cardinals.Konstantinos Tsaprounis - 2014 - Archive for Mathematical Logic 53 (1-2):89-118.
The large cardinals between supercompact and almost-huge.Norman Lewis Perlmutter - 2015 - Archive for Mathematical Logic 54 (3-4):257-289.

Add more citations

References found in this work

No references found.

Add more references