A Characterization of Generalized Příkrý Sequences

Archive for Mathematical Logic 44 (8):935-971 (2005)
  Copy   BIBTEX

Abstract

A generalization of Příkrý's forcing is analyzed which adjoins to a model of ZFC a set of order type at most ω below each member of a discrete set of measurable cardinals. A characterization of generalized Příkrý generic sequences reminiscent of Mathias' criterion for Příkrý genericity is provided, together with a maximality theorem which states that a generalized Příkrý sequence almost contains every other one lying in the same extension.This forcing can be used to falsify the covering lemma for a higher core model if there is an inner model with infinitely many measurable cardinals – changing neither cardinalities nor cofinalities. Another application is an alternative proof of a theorem of Mitchell stating that if the core model contains a regular limit θ of measurable cardinals, then there is a model in which every set of measurable cardinals of K bounded in θ has an indiscernible sequence but there is no such sequence for the entire set of measurables of K below θ

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,343

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

The subcompleteness of diagonal Prikry forcing.Kaethe Minden - 2020 - Archive for Mathematical Logic 59 (1-2):81-102.
Iterated ultrapowers and prikry forcing.Patrick Dehornoy - 1978 - Annals of Mathematical Logic 15 (2):109-160.
A Cardinal Pattern Inspired by AD.Arthur W. Apter - 1996 - Mathematical Logic Quarterly 42 (1):211-218.
Generalized Prikry forcing and iteration of generic ultrapowers.Hiroshi Sakai - 2005 - Mathematical Logic Quarterly 51 (5):507-523.
Incomparable Vγ$V_\gamma$‐degrees.Teng Zhang - 2023 - Mathematical Logic Quarterly 69 (1):58-62.
The consistency strength of choiceless failures of SCH.Arthur W. Apter & Peter Koepke - 2010 - Journal of Symbolic Logic 75 (3):1066-1080.
Ad and patterns of singular cardinals below θ.Arthur Apter - 1996 - Journal of Symbolic Logic 61 (1):225-235.

Analytics

Added to PP
2013-11-23

Downloads
41 (#573,490)

6 months
5 (#702,808)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Mathias criterion for the Magidor iteration of Prikry forcings.Omer Ben-Neria - 2023 - Archive for Mathematical Logic 63 (1):119-134.
On sequences generic in the sense of Magidor.Gunter Fuchs - 2014 - Journal of Symbolic Logic 79 (4):1286-1314.
On the consistency strength of critical leaps.Gunter Fuchs - forthcoming - Archive for Mathematical Logic:1-14.

View all 9 citations / Add more citations

References found in this work

The covering lemma for L[U].A. J. Dodd & R. B. Jensen - 1982 - Annals of Mathematical Logic 22 (2):127-135.

Add more references