The Covering Property Axiom, CPA: A Combinatorial Core of the Iterated Perfect Set Model

Krzysztof Ciesielski, Janusz Pawlikowski

Cambridge University Press, Aug 23, 2004 - Mathematics

Here the authors formulate and explore a new axiom of set theory, CPA, the Covering Property Axiom. CPA is consistent with the usual ZFC axioms, indeed it is true in the iterated Sacks model and actually captures the combinatorial core of this model. A plethora of results known to be true in the Sacks model easily follow from CPA. Replacing iterated forcing arguments with deductions from CPA simplifies proofs, provides deeper insight, and leads to new results. One may say that CPA is similar in nature to Martin's axiom, as both capture the essence of the models of ZFC in which they hold. The exposition is self contained and there are natural applications to real analysis and topology. Researchers who use set theory in their work will find much of interest in this book.

Contents

• Prisms and axioms CPA Saint and CPA prism: 54
• 17: 65
• 4: 70
• 27: 79
• 2: 98
• CPA and properties F and: 143
• 7: 155
• Notation: 162

About the author

Krzysztof Ciesielski is Professor of Mathematics at West Virginia University.

Janusz Pawlikowksi is Professor of Mathematics at Wroclaw University.

Bibliographic information

• Title: The Covering Property Axiom, CPA: A Combinatorial Core of the Iterated Perfect Set Model; Volume 164 of Cambridge Tracts in Mathematics
• Authors: Krzysztof Ciesielski, Janusz Pawlikowski
• Publisher: Cambridge University Press, 2004
• ISBN: 1139454749, 9781139454742
• Subjects: Mathematics / History & Philosophy; Mathematics / Logic; Mathematics / Set Theory