The Covering Property Axiom, CPA: A Combinatorial Core of the Iterated Perfect Set Model
Krzysztof Ciesielski · Janusz Pawlikowski
Aug 2004 · Cambridge Tracts in Mathematics Book 164 · Cambridge University Press
Ebook
206
Pages
reportRatings and reviews aren’t verified Learn More
About this ebook
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.
About the author
Krzysztof Ciesielski is Professor of Mathematics at West Virginia University.
Janusz Pawlikowksi is Professor of Mathematics at Wroclaw University.
Rate this ebook
Tell us what you think.
Reading information
Smartphones and tablets
Install the Google Play Books app for Android and iPad/iPhone. It syncs automatically with your account and allows you to read online or offline wherever you are.
Laptops and computers
You can listen to audiobooks purchased on Google Play using your computer's web browser.
eReaders and other devices
To read on e-ink devices like Kobo eReaders, you'll need to download a file and transfer it to your device. Follow the detailed Help Center instructions to transfer the files to supported eReaders.
