Covering Property Axiom, Cpa - A Combinatorial Core of the Iterated Perfect Set Model

Informationen zum Autor Krzysztof Ciesielski is Professor of Mathematics at West Virginia University. Klappentext This book explores a new axiom of set theory--CPA! the Covering Property Axiom. CPA is consistent with the usual ZFC axioms. 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 CPAs simplifies proofs! provides deeper insight! and leads to new results. Researchers who use set theory in their work will find much of interest in this book. Zusammenfassung This book explores a new axiom of set theory! CPA! the Covering Property Axiom. Replacing iterated forcing arguments with deductions from CPA simplifies proofs! provides deeper insight! and leads to new results. Researchers who use set theory in their work will find much of interest in this book. Inhaltsverzeichnis 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.

Product details

• Authors: Krzysztof Ciesielski, Krzysztof (West Virginia University) P Ciesielski, Krzysztof Pawlikowski Ciesielski, Janusz Pawlikowski
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Hardback
• Released: 23.08.2004
• EAN: 9780521839204
• ISBN: 978-0-521-83920-4
• No. of pages: 198
• Series: Cambridge Tracts in Mathematic
• Subject: Natural sciences, medicine, IT, technology > Mathematics > Miscellaneous