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: 92,907

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

Borel sets and Ramsey's theorem.Fred Galvin & Karel Prikry - 1973 - Journal of Symbolic Logic 38 (2):193-198.
Partition properties and Prikry forcing on simple spaces.J. M. Henle - 1990 - Journal of Symbolic Logic 55 (3):938-947.
On closed unbounded sets consisting of former regulars.Moti Gitik - 1999 - Journal of Symbolic Logic 64 (1):1-12.
On measures on complete Boolean algebras.Karel Prikry - 1971 - Journal of Symbolic Logic 36 (3):395-406.
Precipitous ideals.T. Jech, M. Magidor, W. Mitchell & K. Prikry - 1980 - Journal of Symbolic Logic 45 (1):1-8.
On descendingly incomplete ultrafilters.Kenneth Kunen & Karel Prikry - 1971 - Journal of Symbolic Logic 36 (4):650-652.
On partitions into stationary sets.Karel Prikry & Robert M. Solovay - 1975 - Journal of Symbolic Logic 40 (1):75-80.
Diagonal Prikry extensions.James Cummings & Matthew Foreman - 2010 - Journal of Symbolic Logic 75 (4):1383-1402.
Prikry forcing at κ+ and beyond.William Mitchell - 1987 - Journal of Symbolic Logic 52 (1):44 - 50.

Analytics

Added to PP
2009-01-28

Downloads
85 (#202,687)

6 months
13 (#218,677)

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