|
Organizers |
Not collapsing cardinals ≤ k in ( < k)-support iterations
by
Saharon Shelah
Hebrew University and Rutgers University
We address the problem stated in the title showing how one may preserve various versions of completeness in ( < k)-support iterations and pointing out the limitations provided by ZFC theorems. The paper presenting this topic ([Sh:587]) is at the final stage of preparations.
Date received: March 18, 1996
Copyright © 1996 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 # caac-09.