The Covering Property Axiom, CPA
The Covering Property Axiom, CPA
Looking for an inspection copy?
This title is not currently available for inspection.
$151.00
USDHere 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.
- Self contained exposition of a new axiom
- Applications to other parts of mathematics such as real analysis and topology
- Simple proofs without using forcing
Product details
November 2004Hardback
9780521839204
198 pages
229 × 152 × 16 mm
0.46kg
3 b/w illus.
Available
Table of Contents
- 1. Axiom CPAcube and its consequences: properties (A)-(E)
- 2. Games and axiom CPAgame/cube
- 3. Prisms and axioms CPAgame/prism and CPAprism
- 4. CPAprism and coverings with smooth functions
- 5. Applications of CPAgame/prism
- 6. CPA and properties (F*) and (G)
- 7. CPA in the Sacks model.
