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:6a256d70e7847
DTSTART;TZID=America/Toronto:20170620T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20170620T153000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-76
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:JONNY STEPHENSON\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSITY 
 OF\nWATERLOO\n\n\"Effective bi-interpretability and Graphs II\"\n\nLast ti
 me we saw that every structure is effectively bi-interpretable\nwith a str
 ucture over a simple language consisting of a unary\npredicate U and a sym
 metric binary predicate E. This week\, we will\nshow that any structure ov
 er this language is effectively\nbi-interpretable with a graph. This will 
 complete the proof that every\nstructure is effectively bi-interpretable w
 ith a graph.\n\nMC 5403
DTSTAMP:20260607T130904Z
END:VEVENT
END:VCALENDAR