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:20160313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20151101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a24a09ad0fec
DTSTART;TZID=America/Toronto:20161025T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20161025T153000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-49
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:JONATHAN STEPHENSON\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSI
 TY OF\nWATERLOO \n\n“Joins of r.i.c.e relations and r.i.c.e complete rel
 ations” \n\nWe will show that there is a natural way to form both finite
  and\ninfinite joins of subsets of a structure. We will also introduce\nr.
 i.c.e complete relations\, and show that every structure has a\nr.i.c.e. c
 omplete relation. We will use this to define a jump operator\non relations
  in structures.
DTSTAMP:20260606T223506Z
END:VEVENT
END:VCALENDAR