BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Matthew Harrison-Trainor (Victoria University of Wellington\, New 
 Zealand)
DTSTART:20200513T010000Z
DTEND:20200513T020000Z
DTSTAMP:20260404T131149Z
UID:CTA/5
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/CTA/5
 /">The tree of tuples of a structure</a>\nby Matthew Harrison-Trainor (Vic
 toria University of Wellington\, New Zealand) as part of Computability the
 ory and applications\n\n\nAbstract\nGiven a countable structure\, one can 
 associate a tree of finite tuples from that structure\, with each tuple la
 beled by its atomic type. This tree encodes the back-and-forth information
  of the structure\, and hence determines the isomorphism type\, but it is 
 still missing something: with Montalban I proved that there are structures
  which cannot be computably (or even hyperarithmetically) recovered from t
 heir tree of tuples. I'll explain the meaning of this result by exploring 
 two separate threads in computable structure theory: universality and codi
 ng.\n
LOCATION:https://stable.researchseminars.org/talk/CTA/5/
END:VEVENT
END:VCALENDAR