AD for long ordinal-definable games, other new axioms, and GCH
by
J. Mycielski
University of Colorado - Boulder

It will be shown that ZFC plus all those axioms implies 2^{\aleph_{\alpha+ n}} = \aleph_{\alpha+ n + 1} for n < \omega, if \alpha = 0 or if \aleph_\alpha is strongly inaccessible. The problem of evaluating 2^{\aleph_\omega} by means of those axioms (or any other natural axioms) remains unsolved.

http://www.colorado.edu/math/children/faculty/jmyciel/

Date received: February 19, 2000