NB: A PDF version of this announcement is also available.

Simplifying the combinatorics of the first uncountable cardinal

Jindrich Zapletal
Dartmouth College

October 08, 1998
102 Bradley Hall, 4 pm
Tea 3:30 pm, Math Lounge

Abstract: There is a consistent set theoretic assumption saying in effect that the combinatorics of aleph one is as simple as possible. Under this assumption, many objects of general interest of this size are easily classifiable.

This talk will be accessible to graduate students.