國立虎尾科技大學 |

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

Record Type:	Language materials, printed : Monograph/item
Title/Author:	The Covering property Axiom, CPA :/ Krzysztof Ciesielski, Janusz Pawlikowski.
Reminder of title:	a combinatorial core of the iterated perfect set model /
Author:	Ciesielski, Krzysztof,
other author:	Pawlikowski, Janusz,
Description:	1 online resource (xxi, 174 pages) :digital, PDF file(s). :
Notes:	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Subject:	Axiomatic set theory. -
Online resource:	https://doi.org/10.1017/CBO9780511546457
ISBN:	9780511546457 (ebook)

The Covering property Axiom, CPA : = a combinatorial core of the iterated perfect set model /
Ciesielski, Krzysztof,1957-

The Covering property Axiom, CPA :a combinatorial core of the iterated perfect set model /Krzysztof Ciesielski, Janusz Pawlikowski. - 1 online resource (xxi, 174 pages) :digital, PDF file(s). - Cambridge tracts in mathematics ;164. - Cambridge tracts in mathematics ;203..

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

1. Axiom CPA[subscript cube] and its consequences : properties (A)-(E) -- 2. Games and axiom CPA[subscript cube][superscript game] -- 3. Prisms and axioms CPA[subscript prism][superscript game] and CPA[subscript prism] -- 4. CPA[subscript prism] and coverings with smooth functions -- 5. Applications of CPA[subscript prism][superscript game] -- 6. CPA and properties (F[superscript *]) and (G) -- 7. CPA in the Sacks 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 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.

ISBN: 9780511546457 (ebook)Subjects--Topical Terms:

528517
Axiomatic set theory.

LC Class. No.: QA248 / .C473 2004

Dewey Class. No.: 511.3/22

The Covering property Axiom, CPA : = a combinatorial core of the iterated perfect set model /
LDR:02297nam a2200301 i 4500 001 1127646
003 UkCbUP
005 20151005020622.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 240926s2004||||enk o ||1 0|eng|d
020 $a 9780511546457 (ebook)
020 $z 9780521839204 (hardback)
035 $a CR9780511546457
040 $a UkCbUP $b eng $e rda $c UkCbUP
050 0 0 $a QA248 $b .C473 2004
082 0 0 $a 511.3/22 $2 22
100 1 $a Ciesielski, Krzysztof, $d 1957- $e author. $3 1447142
245 1 4 $a The Covering property Axiom, CPA : $b a combinatorial core of the iterated perfect set model / $c Krzysztof Ciesielski, Janusz Pawlikowski.
264 1 $a Cambridge : $b Cambridge University Press, $c 2004.
300 $a 1 online resource (xxi, 174 pages) : $b digital, PDF file(s).
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
490 1 $a Cambridge tracts in mathematics ; $v 164
500 $a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
505 0 $a 1. Axiom CPA[subscript cube] and its consequences : properties (A)-(E) -- 2. Games and axiom CPA[subscript cube][superscript game] -- 3. Prisms and axioms CPA[subscript prism][superscript game] and CPA[subscript prism] -- 4. CPA[subscript prism] and coverings with smooth functions -- 5. Applications of CPA[subscript prism][superscript game] -- 6. CPA and properties (F[superscript *]) and (G) -- 7. CPA in the Sacks model.
520 $a 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.
650 0 $a Axiomatic set theory. $3 528517
700 1 $a Pawlikowski, Janusz, $d 1957- $e author. $3 1447143
776 0 8 $i Print version: $z 9780521839204
830 0 $a Cambridge tracts in mathematics ; $v 203. $3 1238301
856 4 0 $u https://doi.org/10.1017/CBO9780511546457