The subcompleteness of diagonal Prikry forcing

Archive for Mathematical Logic 59 (1-2):81-102 (2020)
  Copy   BIBTEX

Abstract

Let \ be an infinite discrete set of measurable cardinals. It is shown that generalized Prikry forcing to add a countable sequence to each cardinal in \ is subcomplete. To do this it is shown that a simplified version of generalized Prikry forcing which adds a point below each cardinal in \, called generalized diagonal Prikry forcing, is subcomplete. Moreover, the generalized diagonal Prikry forcing associated to \ is subcomplete above \, where \ is any regular cardinal below the first limit point of \.

Links

PhilArchive



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

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

A Characterization of Generalized Příkrý Sequences.Gunter Fuchs - 2005 - Archive for Mathematical Logic 44 (8):935-971.
Supercompact extender based Prikry forcing.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (5-6):591-602.
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.
The short extenders gap two forcing is of Prikry type.Carmi Merimovich - 2009 - Archive for Mathematical Logic 48 (8):737-747.
The short extenders gap three forcing using a morass.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (1-2):115-135.
Mathias–Prikry and Laver–Prikry type forcing.Michael Hrušák & Hiroaki Minami - 2014 - Annals of Pure and Applied Logic 165 (3):880-894.
Closure properties of parametric subcompleteness.Gunter Fuchs - 2018 - Archive for Mathematical Logic 57 (7-8):829-852.
Canonical seeds and Prikry trees.Joel David Hamkins - 1997 - Journal of Symbolic Logic 62 (2):373-396.
Iterated ultrapowers and Prikry forcing.Patrick Dehornoy - 1978 - Annals of Mathematical Logic 15 (2):109.
Canonical Seeds and Prikry Trees.Joel Hamkins - 1997 - Journal of Symbolic Logic 62 (2):373-396.
A formalism for some class of forcing notions.Piotr Koszmider & P. Koszmider - 1992 - Mathematical Logic Quarterly 38 (1):413-421.
Combinatorics and forcing with distributive ideals.Pierre Matet - 1997 - Annals of Pure and Applied Logic 86 (2):137-201.
The subcompleteness of Magidor forcing.Gunter Fuchs - 2018 - Archive for Mathematical Logic 57 (3-4):273-284.

Analytics

Added to PP
2019-05-18

Downloads
16 (#855,572)

6 months
4 (#698,851)

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

The subcompleteness of Magidor forcing.Gunter Fuchs - 2018 - Archive for Mathematical Logic 57 (3-4):273-284.
A Characterization of Generalized Příkrý Sequences.Gunter Fuchs - 2005 - Archive for Mathematical Logic 44 (8):935-971.

Add more references