BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20261013T191608EDT-2481CXPkjJ@132.216.98.100
DTSTAMP:20261013T231608Z
DESCRIPTION:Uncountable bases above E_0 (after Conley and Miller)\n\nTo stu
 dy the relative difficulty of classification problems\, a recent trend has
  been to encode them as countable Borel equivalence relations\, and to the
 n preorder the equivalence relations under a notion called Borel reducibil
 ity. This preorder has a minimal element (equality on the reals)\, and thi
 s minimal element has a unique successor called E_0 (equality mod rational
 s on the reals). Although it is known that this preorder is not linear\, i
 t is still a major open question to determine if E_0 has a unique successo
 r or not. We will give an overview of the first major result in this direc
 tion due to Conley and Miller\, which states that under the weaker notion 
 of measure reducibility\, not only is there no unique successor of E_0\, b
 ut in fact any basis above E_0 must be uncountable.\n
DTSTART:20180327T183000Z
DTEND:20180327T193000Z
LOCATION:Room 920\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue 
 Sherbrooke Ouest
SUMMARY:Forte Shinko\, CalTech
URL:https://www.mcgill.ca/mathstat/channels/event/forte-shinko-caltech-2862
 16
END:VEVENT
END:VCALENDAR