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:20161106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a256d6cdf133
DTSTART;TZID=America/Toronto:20170328T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20170328T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-64
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:JONNY STEPHENSON\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSITY 
 OF\nWATERLOO\n\n\"The c.e. embeddability condition\"\n\nWe will discuss th
 e c.e. embeddability condition\, which is a condition\nintroduced by Richt
 er\, and which provides an exact characterization of\nthose structures whi
 ch do not code any non-c.e. sets. Such structures\ncannot have nontrivial 
 Turing or enumeration degrees. If time permits\,\nwe will demonstrate that
  linear orderings have the c.e. embeddability\ncondition.\n\nMC 5403
DTSTAMP:20260607T130900Z
END:VEVENT
END:VCALENDAR