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

Links

PhilArchive



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

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

Combinatorics for Small Ideals on Pkλ.Yoshihiro Abe - 1997 - Mathematical Logic Quarterly 43 (4):541-549.
Combinatorics on ideals and forcing with trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
Universal forcing notions and ideals.Andrzej Rosłanowski & Saharon Shelah - 2007 - Archive for Mathematical Logic 46 (3-4):179-196.
Forcing properties of ideals of closed sets.Marcin Sabok & Jindřich Zapletal - 2011 - Journal of Symbolic Logic 76 (3):1075 - 1095.
C. C. C. forcing without combinatorics.Alan H. Mekler - 1984 - Journal of Symbolic Logic 49 (3):830-832.
Distributive proper forcing axiom and cardinal invariants.Huiling Zhu - 2013 - Archive for Mathematical Logic 52 (5-6):497-506.
Sacks forcing, Laver forcing, and Martin's axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
A variant of Mathias forcing that preserves \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{ACA}_0}$$\end{document}. [REVIEW]François G. Dorais - 2012 - Archive for Mathematical Logic 51 (7-8):751-780.
PFA and Ideals on $\omega_{2}$ Whose Associated Forcings Are Proper.Sean Cox - 2012 - Notre Dame Journal of Formal Logic 53 (3):397-412.
Indestructibility, instances of strong compactness, and level by level inequivalence.Arthur W. Apter - 2010 - Archive for Mathematical Logic 49 (7-8):725-741.
Forcing with filters and complete combinatorics.Claude Laflamme - 1989 - Annals of Pure and Applied Logic 42 (2):125-163.

Analytics

Added to PP
2014-01-16

Downloads
21 (#731,987)

6 months
2 (#1,192,610)

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 19 references / Add more references