Covering Property Axiom, CPA

A Combinatorial Core of the Iterated Perfect Set Model
PDF
(0 Seiten)
  Sofort lieferbar | Lieferzeit:3-5 Tage I

Unser bisheriger Preis:ORGPRICE: 133,95 EUR

Jetzt 63,18 EUR*

ISBN-13:
9780511208454
Einband:
PDF
Seiten:
0
Autor:
Krzysztof Ciesielski
Serie:
Cambridge Tracts in Mathematics
eBook Typ:
PDF
eBook Format:
PDF
Kopierschutz:
Adobe DRM [Hard-DRM]
Sprache:
Englisch
Beschreibung:

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

Kunden Rezensionen

Zu diesem Artikel ist noch keine Rezension vorhanden.
Helfen sie anderen Besuchern und verfassen Sie selbst eine Rezension.