The diamond covering property axiom

Mathematical Logic Quarterly 62 (4-5):407-411 (2016)
  Copy   BIBTEX

Abstract

The Covering Property Axiom, which attempts to capture some of the combinatorics of the Sacks model, the model obtained from by countable support iteration of length of the Sacks forcing, seems to miss a Suslin tree. We add a diamond polish to the axiom to remedy this.

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.201400114

Other Versions

No versions found

Links

PhilArchive



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

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

The covering number and the uniformity of the ideal ℐf.Noboru Osuga - 2006 - Mathematical Logic Quarterly 52 (4):351-358.
Different covering numbers of compact tree ideals.Jelle Mathis Kuiper & Otmar Spinas - forthcoming - Archive for Mathematical Logic:1-20.
On iterating semiproper preorders.Tadatoshi Miyamoto - 2002 - Journal of Symbolic Logic 67 (4):1431-1468.
The cardinal coefficients of the Ideal $${{\mathcal {I}}_{f}}$$.Noboru Osuga & Shizuo Kamo - 2008 - Archive for Mathematical Logic 47 (7-8):653-671.
Applications of the ergodic iteration theorem.Jindřich Zapletal - 2010 - Mathematical Logic Quarterly 56 (2):116-125.
The covering number of the strong measure zero ideal can be above almost everything else.Miguel A. Cardona, Diego A. Mejía & Ismael E. Rivera-Madrid - 2022 - Archive for Mathematical Logic 61 (5):599-610.
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.
Some weak fragments of Martin’s axiom related to the rectangle refining property.Teruyuki Yorioka - 2008 - Archive for Mathematical Logic 47 (1):79-90.
A formalism for some class of forcing notions.Piotr Koszmider & P. Koszmider - 1992 - Mathematical Logic Quarterly 38 (1):413-421.

Analytics

Added to PP
2017-03-26

Downloads
18 (#1,108,436)

6 months
7 (#698,214)

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

No references found.

Add more references