The Covering property Axiom, CPA: a combinatorial core of the iterated perfect set model

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 Sac...

Full description

Saved in:
Bibliographic Details
Main Author: Ciesielski, Krzysztof 1957- (Author)
Format: Electronic eBook
Language:English
Published: Cambridge Cambridge University Press 2004
Series:Cambridge tracts in mathematics 164
Subjects:
Online Access:BSB01
FHN01
UBR01
Volltext
Summary: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
Physical Description:1 Online-Ressource (xxi, 174 Seiten)
ISBN:9780511546457
DOI:10.1017/CBO9780511546457

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text