PSU Mark
Eberly College of Science Mathematics Department

Meeting Details

For more information about this meeting, contact Jan Reimann, Stephen Simpson.

Title:Borel combinatorics, recursion theory, and countable Borel equivalance relations
Seminar:Logic Seminar
Speaker:Andrew Marks, California Institute of Technology
We use determinacy to settle several questions in Borel combinatorics related to colorings and matchings of n-regular graphs. We then describe how these results can be used to show that recursive isomorphism on 2^\omega is not a universal countable Borel equivalence relation in a "nicely uniform" way.

Room Reservation Information

Room Number:MB315
Date:10 / 09 / 2012
Time:02:30pm - 03:45pm