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:69f906370daa2
DTSTART;TZID=America/Toronto:20251010T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20251010T153000
URL:https://uwaterloo.ca/pure-mathematics/events/logic-seminar-79
SUMMARY:Logic Seminar
CLASS:PUBLIC
DESCRIPTION:JOEY LAKERDAS-GAYLE\, UNIVERSITY OF WATERLOO\n\n_Weakly uniform
  computable categoricity_\n\nA computable structure A is Y-computably cate
 gorical if for every\ncomputable copy B of A\, some isomorphism between A 
 and B is computable\nin the oracle Y. Motivated by results about isomorphi
 sm spectra of\ncomputable structures\, we introduce a relativized notion o
 f uniform\ncomputable categoricity: For sets X and Yof natural numbers\, w
 e say\nthat a computable structure A is weakly X-uniformly Y-computably\nc
 ategorical if A is Y-computably categorical and we can find\nY-computable 
 isomorphisms uniformly in X. We will investigate some\nnatural questions a
 bout weakly uniform computable categoricity and\ncompute some particular e
 xamples.\n\nMC 5403
DTSTAMP:20260504T204855Z
END:VEVENT
END:VCALENDAR