Atlas home || Conferences | Abstracts | about Atlas

Spring General Topology & Dynamic Systems Conference
March 16-19, 2000
University of the Incarnate Word and The University of Texas at San Antonio
San Antonio, TX, USA

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

To follow the talk only a minimal knowledge of set theory is required.

Date received: February 13, 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 # cady-50.