The covering property axiom, CPA : a combinatorial core of the iterated perfect set model / Krzysztof Ciesielski, Janusz PawlikowskiType de document : MonographieCollection : Cambridge tracts in mathematics, 164Langue : anglais.Pays: Grande Bretagne.Éditeur : Cambridge : Cambridge University Pess, 2004Description : 1 vol. (XXI-174 p.) ; 24 cmISBN: 9780521839204.ISSN: 0950-6284.Bibliographie : Bibliogr. p. 165-171. Index.Sujet MSC : 03E17, Mathematical logic and foundations - Set theory, Cardinal characteristics of the continuum
03E35, Mathematical logic and foundations - Set theory, Consistency and independence results
03E05, Mathematical logic and foundations - Set theory, Other combinatorial set theoryEn-ligne : Zentralblatt | MathSciNet Item type: Monographie
|Current library||Call number||Status||Date due||Barcode|
|CMI Salle R||03 CIE (Browse shelf(Opens below))||Available||03058-01|
The Covering Property Axiom (CPA) arose in connection with the investigation of the iterated Sacks model, that is, the iterated perfect set model. Many interesting mathematical properties, especially those concerning real analysis, are known to be true in the Sacks model while they are false under the continuum hypothesis. Usually the proofs are very technical and involve heavy forcing machinery.
The authors have extracted a combinatorial principle that is true in the Sacks model and can be used to give simpler proofs. This principle, which is called CPA, is similar to Martin’s axiom. ... (Zentralblatt)
Bibliogr. p. 165-171. Index