Tuesday, 3 April 2001
   2:30 - 4:00  Stephen Watson
                Transfinite Recursion without the Details

Abstract:
We describe how many difficult transfinite recursions can be defined
by removing the quantifiers of a mathematical instruction by
relativizing them according to a schedule to elementary submodels and
finite approximations thereof.  Our examples come from set-theoretic
topology but may be broadly applicable.