Combinatorics and forcing with distributive ideals

Annals of Pure and Applied Logic 86 (2):137-201 (1997)
  Copy   BIBTEX

Abstract

We present a version for κ-distributive ideals over a regular infinite cardinal κ of some of the combinatorial results of Mathias on happy families. We also study an associated notion of forcing, which is a generalization of Mathias forcing and of Prikry forcing

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(96)00022-x

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,597

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

Mathias–Prikry and Laver–Prikry type forcing.Michael Hrušák & Hiroaki Minami - 2014 - Annals of Pure and Applied Logic 165 (3):880-894.
Mathias–Prikry and Laver type forcing; summable ideals, coideals, and +-selective filters.David Chodounský, Osvaldo Guzmán González & Michael Hrušák - 2016 - Archive for Mathematical Logic 55 (3-4):493-504.
Forcing with filters and complete combinatorics.Claude Laflamme - 1989 - Annals of Pure and Applied Logic 42 (2):125-163.
Mathias like criterion for the extender based Prikry forcing.Carmi Merimovich - 2021 - Annals of Pure and Applied Logic 172 (9):102994.
More on simple forcing notions and forcings with ideals.M. Gitik & S. Shelah - 1993 - Annals of Pure and Applied Logic 59 (3):219-238.
The variety of projections of a tree Prikry forcing.Tom Benhamou, Moti Gitik & Yair Hayut - 2023 - Journal of Mathematical Logic 24 (3).
Combinatorial properties of classical forcing notions.Jörg Brendle - 1995 - Annals of Pure and Applied Logic 73 (2):143-170.
Indestructibility, instances of strong compactness, and level by level inequivalence.Arthur W. Apter - 2010 - Archive for Mathematical Logic 49 (7-8):725-741.
Unsupported Boolean algebras and forcing.Miloš S. Kurilić - 2004 - Mathematical Logic Quarterly 50 (6):594-602.
The variety of projections of a tree Prikry forcing.Tom Benhamou, Moti Gitik & Yair Hayut - 2023 - Journal of Mathematical Logic 24 (3).

Analytics

Added to PP
2014-01-16

Downloads
24 (#914,270)

6 months
2 (#1,689,094)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Q-pointness, p-pointness and feebleness of ideals.Pierre Matet & Janusz Pawlikowski - 2003 - Journal of Symbolic Logic 68 (1):235-261.
A generalization of the Dual Ellentuck Theorem.Lorenz Halbeisen & Pierre Matet - 2003 - Archive for Mathematical Logic 42 (2):103-128.

Add more citations

References found in this work

Happy families.A. R. D. Mathias - 1977 - Annals of Mathematical Logic 12 (1):59.
A new proof that analytic sets are Ramsey.Erik Ellentuck - 1974 - Journal of Symbolic Logic 39 (1):163-165.
Δ12-sets of reals.Jaime I. Ihoda & Saharon Shelah - 1989 - Annals of Pure and Applied Logic 42 (3):207-223.
Borel sets and Ramsey's theorem.Fred Galvin & Karel Prikry - 1973 - Journal of Symbolic Logic 38 (2):193-198.
Every analytic set is Ramsey.Jack Silver - 1970 - Journal of Symbolic Logic 35 (1):60-64.

View all 17 references / Add more references