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:6a245fa10473c
DTSTART;TZID=America/Toronto:20161004T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20161004T153000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-47
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:MOHAMMAD MAHMOUD\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSITY 
 OF\nWATERLOO \n\n“A syntactic characterization” \n\nR.i.c.e. relations
  can be characterized in a purely syntactic way\nusing computably infinita
 ry formulas and without referring to the\ndifferent copies of the structur
 e. We go through the proof of Theorem\nII.1.14 that establishes this chara
 cterization. \n\nMC 5417
DTSTAMP:20260606T175753Z
END:VEVENT
END:VCALENDAR