Generalized Prikry forcing and iteration of generic ultrapowers

Mathematical Logic Quarterly 51 (5):507-523 (2005)
  Copy   BIBTEX

Abstract

It is known that there is a close relation between Prikry forcing and the iteration of ultrapowers: If U is a normal ultrafilter on a measurable cardinal κ and 〈Mn, jm,n | m ≤ n ≤ ω〉 is the iteration of ultrapowers of V by U, then the sequence of critical points 〈j0,n | n ∈ ω〉 is a Prikry generic sequence over Mω. In this paper we generalize this for normal precipitous filters

Categories

Keywords

Reprint years

DOI

10.1002/malq.200410047

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A Characterization of Generalized Příkrý Sequences.Gunter Fuchs - 2005 - Archive for Mathematical Logic 44 (8):935-971.
Iterated ultrapowers and prikry forcing.Patrick Dehornoy - 1978 - Annals of Mathematical Logic 15 (2):109-160.
Supercompact extender based Prikry forcing.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (5-6):591-602.
Canonical seeds and Prikry trees.Joel David Hamkins - 1997 - Journal of Symbolic Logic 62 (2):373-396.
A minimal Prikry-type forcing for singularizing a measurable cardinal.Peter Koepke, Karen Räsch & Philipp Schlicht - 2013 - Journal of Symbolic Logic 78 (1):85-100.
The short extenders gap two forcing is of Prikry type.Carmi Merimovich - 2009 - Archive for Mathematical Logic 48 (8):737-747.
A formalism for some class of forcing notions.Piotr Koszmider & P. Koszmider - 1992 - Mathematical Logic Quarterly 38 (1):413-421.
The short extenders gap three forcing using a morass.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (1-2):115-135.
Essential Forcing Generics.Stephanie Cawthorne & David Kueker - 2000 - Notre Dame Journal of Formal Logic 41 (1):41-52.
Mathias–Prikry and Laver–Prikry type forcing.Michael Hrušák & Hiroaki Minami - 2014 - Annals of Pure and Applied Logic 165 (3):880-894.
On closed unbounded sets consisting of former regulars.Moti Gitik - 1999 - Journal of Symbolic Logic 64 (1):1-12.
Grigorieff Forcing on Uncountable Cardinals Does Not Add a Generic of Minimal Degree.Brooke M. Andersen & Marcia J. Groszek - 2009 - Notre Dame Journal of Formal Logic 50 (2):195-200.
The proper forcing axiom, Prikry forcing, and the singular cardinals hypothesis.Justin Tatch Moore - 2006 - Annals of Pure and Applied Logic 140 (1):128-132.
Universal forcing notions and ideals.Andrzej Rosłanowski & Saharon Shelah - 2007 - Archive for Mathematical Logic 46 (3-4):179-196.
Forcing in łukasiewicz predicate logic.Antonio Di Nola, George Georgescu & Luca Spada - 2008 - Studia Logica 89 (1):111-145.

Analytics

Added to PP
2013-12-01

Downloads
25 (#595,425)

6 months
5 (#526,961)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

An ideal game.F. Galvin, T. Jech & M. Magidor - 1978 - Journal of Symbolic Logic 43 (2):284-292.
Iterated ultrapowers and prikry forcing.Patrick Dehornoy - 1978 - Annals of Mathematical Logic 15 (2):109-160.
Iterated ultrapowers and Prikry forcing.Patrick Dehornoy - 1978 - Annals of Mathematical Logic 15 (2):109.
An application of ultrapowers to changing cofinality.Patrick Dehornoy - 1983 - Journal of Symbolic Logic 48 (2):225-235.

Add more references