BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a25423c057e3
DTSTART;TZID=America/Toronto:20171205T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20171205T143000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-83
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:MOHAMMAD MAHMOUD\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSITY 
 OF\nWATERLOO\n\n\"Borel Reducibility and Linear Orderings\"\n\nWe define B
 orel reducibility introduced by Friedman and Stanley\nbetween classes of c
 ountable structures. We will define what it means\nfor a class of structur
 es to be complete with respect to Borel\nreducibility and then we will go 
 through their proof of the fact that\nthe class of countable linear orderi
 ngs is complete with respect to\nBorel reducibility.\n\nMC 5413
DTSTAMP:20260607T100444Z
END:VEVENT
END:VCALENDAR