Journal of Mathematical Logic:2150019 (forthcoming)

Abstract
In Part I of this series [5], we introduced a class of notions of forcing which we call [Formula: see text]-Prikry, and showed that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are [Formula: see text]-Prikry. We proved that given a [Formula: see text]-Prikry poset [Formula: see text] and a [Formula: see text]-name for a nonreflecting stationary set [Formula: see text], there exists a corresponding [Formula: see text]-Prikry poset that projects to [Formula: see text] and kills the stationarity of [Formula: see text]. In this paper, we develop a general scheme for iterating [Formula: see text]-Prikry posets, as well as verify that the Extender-based Prikry forcing is [Formula: see text]-Prikry. As an application, we blow-up the power of a countable limit of Laver-indestructible supercompact cardinals, and then iteratively kill all nonreflecting stationary subsets of its successor. This yields a model in which the singular cardinal hypothesis fails and simultaneous reflection of finite families of stationary sets holds.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1142/s0219061321500197
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,290
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Specializing Trees and Answer to a Question of Williams.Mohammad Golshani & Saharon Shelah - 2020 - Journal of Mathematical Logic 21 (1):2050023.
Collapsing the Cardinals of HOD.James Cummings, Sy David Friedman & Mohammad Golshani - 2015 - Journal of Mathematical Logic 15 (2):1550007.
Ordinal Definability and Combinatorics of Equivalence Relations.William Chan - 2019 - Journal of Mathematical Logic 19 (2):1950009.
Mathias–Prikry and Laver–Prikry Type Forcing.Michael Hrušák & Hiroaki Minami - 2014 - Annals of Pure and Applied Logic 165 (3):880-894.
Supercompact Extender Based Prikry Forcing.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (5-6):591-602.
The subcompleteness of diagonal Prikry forcing.Kaethe Minden - 2020 - Archive for Mathematical Logic 59 (1-2):81-102.
Local Saturation and Square Everywhere.Monroe Eskew - 2020 - Journal of Mathematical Logic 20 (3):2050019.
On Cuts in Ultraproducts of Linear Orders I.Mohammad Golshani & Saharon Shelah - 2016 - Journal of Mathematical Logic 16 (2):1650008.
The Short Extenders Gap Two Forcing is of Prikry Type.Carmi Merimovich - 2009 - Archive for Mathematical Logic 48 (8):737-747.
Generalized Prikry Forcing and Iteration of Generic Ultrapowers.Hiroshi Sakai - 2005 - Mathematical Logic Quarterly 51 (5):507-523.
Prikry forcing and tree Prikry forcing of various filters.Tom Benhamou - 2019 - Archive for Mathematical Logic 58 (7-8):787-817.
Coherent Adequate Forcing and Preserving CH.John Krueger & Miguel Angel Mota - 2015 - Journal of Mathematical Logic 15 (2):1550005.

Analytics

Added to PP index
2021-01-19

Total views
1 ( #1,552,396 of 2,518,732 )

Recent downloads (6 months)
1 ( #408,070 of 2,518,732 )

How can I increase my downloads?

Downloads

Sorry, there are not enough data points to plot this chart.

My notes