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:6a257d266cada
DTSTART;TZID=America/Toronto:20171031T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20171031T143000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-81
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\"
 \n\nWhen we wish to show that two structures have an isomorphism of a\ncer
 tain degree between them\, a standard technique is to carefully\nchoose so
 me computable set $U$ and then show that under a natural\nisomorphism $f$\
 , the image $f(U)$ has the degree we are interested in.\nWe show a case of
  two structures isomorphic to $(\\omega\, <)$ where\nthis method of establ
 ishing the degree of the isomorphism between them\nwill not work.
DTSTAMP:20260607T141606Z
END:VEVENT
END:VCALENDAR