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 P μ , I investigate how well P μ preserves the maximality property of ordinary Prikry forcing and prove that P μ Prikry sequences are maximal exactly when μ admits no non-canonical seeds via a finite iteration. In particular, I conclude that if μ is a strongly normal supercompactness measure, then P μ 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: 93,127

External links

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 Hamkins - 1997 - Journal of Symbolic Logic 62 (2):373-396.
Power Set Modulo Small, the Singular of Uncountable Cofinality.Saharon Shelah - 2007 - Journal of Symbolic Logic 72 (1):226 - 242.
More on simple forcing notions and forcings with ideals.M. Gitik & S. Shelah - 1993 - Annals of Pure and Applied Logic 59 (3):219-238.
Measure, randomness and sublocales.Alex Simpson - 2012 - Annals of Pure and Applied Logic 163 (11):1642-1659.
Prikry forcing and tree Prikry forcing of various filters.Tom Benhamou - 2019 - Archive for Mathematical Logic 58 (7-8):787-817.
Non-homogeneity of quotients of Prikry forcings.Moti Gitik & Eyal Kaplan - 2019 - Archive for Mathematical Logic 58 (5-6):649-710.
Generalized Prikry forcing and iteration of generic ultrapowers.Hiroshi Sakai - 2005 - Mathematical Logic Quarterly 51 (5):507-523.
Club guessing sequences and filters.Tetsuya Ishiu - 2005 - Journal of Symbolic Logic 70 (4):1037-1071.
Wild edge colourings of graphs.Mirna D.?Amonja, P.�Ter Komj�Th & Charles Morgan - 2004 - Journal of Symbolic Logic 69 (1):255-264.

Analytics

Added to PP
2009-01-28

Downloads
13 (#1,066,279)

6 months
85 (#62,069)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Joel David Hamkins
Oxford University

Citations of this work

The lottery preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
What is the theory without power set?Victoria Gitman, Joel David Hamkins & Thomas A. Johnstone - 2016 - Mathematical Logic Quarterly 62 (4-5):391-406.
Destruction or preservation as you like it.Joel David Hamkins - 1998 - Annals of Pure and Applied Logic 91 (2-3):191-229.
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.

View all 8 citations / Add more citations

References found in this work

Set Theory.Keith J. Devlin - 1981 - Journal of Symbolic Logic 46 (4):876-877.
Selective ultrafilters and homogeneity.Andreas Blass - 1988 - Annals of Pure and Applied Logic 38 (3):215-255.
Iterated ultrapowers and prikry forcing.Patrick Dehornoy - 1978 - Annals of Mathematical Logic 15 (2):109-160.
Fragile measurability.Joel Hamkins - 1994 - Journal of Symbolic Logic 59 (1):262-282.
Some applications of iterated ultrapowers in set theory.Kenneth Kunen - 1970 - Annals of Mathematical Logic 1 (2):179.

Add more references