Saved in:
Bibliographic Details
Main Author: Peng, Yinhe
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2406.13108
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • We introduce an iteration of forcing notions satisfying the countable chain condition with minimal damage to a strong coloring. Applying this method, we prove that Martin's axiom is strictly stronger than its restriction to forcing notions satisfying the countable chain condition in all finite powers. Our method shows also the finer distinction, that Martin's axiom is strictly stronger than its restriction to forcing notions whose squares satisfy the countable chain condition.