We introduce a property of forcing notions, called the anti-, which comes from Aronszajn trees. This property canonically defines a new chain condition stronger than the countable chain condition, which is called the property . In this paper, we investigate the property . For example, we show that a forcing notion with the property does not add random reals. We prove that it is consistent that every forcing notion with the property has precaliber 1 and for forcing notions with the (...) property fails. This negatively answers a part of one of the classical problems about implications between fragments of. (shrink)

We present an exposition of Section VI.1 and most of Section VI.2 from Shelah’s book Proper and Improper Forcing. These sections offer proofs of the preservation under countable support iteration of proper forcing of various properties, including proofs that ωω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\omega^\omega}$$\end{document} -bounding, the Sacks property, the Laver property, and the P-point property are preserved by countable support iteration of proper forcing.

We build a model in which the continuum hypothesis and Suslin's hypothesis are true, yet there is an Aronszajn tree with no stationary antichain.

There are two versions of the Proper Iteration Lemma. The stronger (but less well‐known) version can be used to give simpler proofs of iteration theorems (e.g., [7, Lemma 24] versus [9, Theorem IX.4.7]). In this paper we give another demonstration of the fecundity of the stronger version by giving a short proof of Shelah's theorem on the preservation of the ωω‐bounding property. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim).