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:6a25d12f15dfa
DTSTART;TZID=America/Toronto:20171121T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20171121T143000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-82
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:MICHAEL DEVEAU\, DEPARTMENT OF PURE MATHEMATICS\, UNIVERSITY OF
  WATERLOO\n\n\"Isomorphisms that cannot be coded by computable relations 
 -- Part 2\"\n\nLast time\, we saw why it is so useful to code an isomorphi
 sm by the\nimage of a computable relation and also explored some cases whe
 re this\nis always possible. We now turn to constructing a pair of structu
 res\nwhere this is not possible. That is\, we construct two structures --\
 nisomorphic to $(\\omega\, <)$ -- where this method of establishing the\nd
 egree of the isomorphism between them will not work.\n\nMC 5413
DTSTAMP:20260607T201439Z
END:VEVENT
END:VCALENDAR