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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69f579f7ad6b4
DTSTART;TZID=America/Toronto:20251031T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20251031T153000
URL:https://uwaterloo.ca/pure-mathematics/events/logic-seminar-81
SUMMARY:Logic Seminar
CLASS:PUBLIC
DESCRIPTION:JAVA VILLANO\, UNIVERSITY OF TORONTO\n\n_Relativizing computabl
 e categoricity_\n\nA computable structure A is said to be computably categ
 orical if for\nall computable copies B of A\, there exists a computable is
 omorphism\nbetween A and B. We can relativize this notion to any Turing de
 gree d\nby asking that for any d-computable copy B of A\, there is a\nd-co
 mputable isomorphism between A and B. In this talk\, we will\ndiscuss resu
 lts about this relativization. In particular\, we will\ndiscuss how for di
 rected graphs\, categoricity relative to a degree\nneed not be monotonic i
 n the c.e.~ degrees\, and how for other\nstructures besides directed graph
 s\, categorical behavior relative to a\ndegree stabilizes on certain Turin
 g cones.\n\nMC 5403
DTSTAMP:20260502T041343Z
END:VEVENT
END:VCALENDAR