Atlas home || Conferences | Abstracts | about Atlas

Boise Extravaganza in Set Theory
March 31 - April 2, 2000
Boise State University
Boise, ID, USA

Organizers
Tomek Bartoszynski, Marion Scheepers

View Abstracts
Conference Homepage

A combinatorial core of the iterated perfect set model
by
Krzysztof Chris Ciesielski
Department of Mathematics, West Virginia University
Coauthors: Janusz Pawlikowski (University of Wroclw and West Virginia University)

Many interesting mathematical properties, especially concerning real analysis, are known to be true in the iterated perfect set (Sacks) model, while they are false under the continuum hypothesis. However, the proofs that these facts are indeed true in this model are usually very technical and involve heavy forcing machinery. In the presented paper we extract a combinatorial principle, a Covering Property Axiom CPA, that is true in the model and show that it implies, in particular, the following facts that are false under CH. (Most to these were known earlier to be true on the iterated perfect set model. However our proofs are essentially simpler than the original arguments.)

Date received: February 28, 2000


Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cadv-08.