Mathias–Prikry and Laver–Prikry type forcing

Annals of Pure and Applied Logic 165 (3):880-894 (2014)
  Copy   BIBTEX

Abstract

We study the Mathias–Prikry and Laver–Prikry forcings associated with filters on ω. We give a combinatorial characterization of Martinʼs number for these forcing notions and present a general scheme for analyzing preservation properties for them. In particular, we give a combinatorial characterization of those filters for which the Mathias–Prikry forcing does not add a dominating real

Links

PhilArchive



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

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 short extenders gap two forcing is of Prikry type.Carmi Merimovich - 2009 - Archive for Mathematical Logic 48 (8):737-747.
A Characterization of Generalized Příkrý Sequences.Gunter Fuchs - 2005 - Archive for Mathematical Logic 44 (8):935-971.
Canonical seeds and Prikry trees.Joel David Hamkins - 1997 - Journal of Symbolic Logic 62 (2):373-396.
Supercompact extender based Prikry forcing.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (5-6):591-602.
The short extenders gap three forcing using a morass.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (1-2):115-135.
Generalized Prikry forcing and iteration of generic ultrapowers.Hiroshi Sakai - 2005 - Mathematical Logic Quarterly 51 (5):507-523.
A formalism for some class of forcing notions.Piotr Koszmider & P. Koszmider - 1992 - Mathematical Logic Quarterly 38 (1):413-421.
On closed unbounded sets consisting of former regulars.Moti Gitik - 1999 - Journal of Symbolic Logic 64 (1):1-12.
Indestructible strong compactness and level by level inequivalence.Arthur W. Apter - 2013 - Mathematical Logic Quarterly 59 (4-5):371-377.
Prikry forcing at κ+ and beyond.William Mitchell - 1987 - Journal of Symbolic Logic 52 (1):44 - 50.
Prikry Forcing at $kappa^+$ and Beyond.William Mitchell - 1987 - Journal of Symbolic Logic 52 (1):44-50.
Iterated ultrapowers and prikry forcing.Patrick Dehornoy - 1978 - Annals of Mathematical Logic 15 (2):109-160.

Analytics

Added to PP
2014-01-16

Downloads
59 (#271,237)

6 months
11 (#233,459)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Katětov order on Borel ideals.Michael Hrušák - 2017 - Archive for Mathematical Logic 56 (7-8):831-847.
Ways of Destruction.Barnabás Farkas & Lyubomyr Zdomskyy - 2022 - Journal of Symbolic Logic 87 (3):938-966.
Canjar Filters.Osvaldo Guzmán, Michael Hrušák & Arturo Martínez-Celis - 2017 - Notre Dame Journal of Formal Logic 58 (1):79-95.

View all 11 citations / Add more citations

References found in this work

Mad families, splitting families and large continuum.Jörg Brendle & Vera Fischer - 2011 - Journal of Symbolic Logic 76 (1):198 - 208.
Adjoining dominating functions.James E. Baumgartner & Peter Dordal - 1985 - Journal of Symbolic Logic 50 (1):94-101.
Mob families and mad families.Jörg Brendle - 1998 - Archive for Mathematical Logic 37 (3):183-197.
Van Douwen’s diagram for dense sets of rationals.Jörg Brendle - 2006 - Annals of Pure and Applied Logic 143 (1-3):54-69.

View all 6 references / Add more references