A forcing order has the countable chain condition when every antichain in a forcing order is countable. Such forcing preserves cardinals and cofinalities at least .
Every uncountable subset of a Knaster forcing has an uncountable pairwise compatible subset. The property implies the countable chain condition for forcing. Finite Cohen forcing has this property by the delta-system lemma and agreement on the finite root. A Knaster forcing times any CCC forcing is CCC
If is a normal splitting Suslin tree and is Knaster, then is CCC, so forces that the ground tree is still CCC Countable levels and splitting persist. A new cofinal branch would give an uncountable antichain by splitting, so none is added. This permits adding many Cohen reals while retaining a Suslin tree, and distinguishes Knaster preservation from an unjustified preservation claim for every CCC forcing.

Ancestors (7)

  1. Chain condition for forcing
  2. Forcing
  3. Set theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7. Home

Synonyms (1)

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.