BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Valentina Harizanov (George Washington University)
DTSTART:20220330T000000Z
DTEND:20220330T010000Z
DTSTAMP:20260423T005736Z
UID:CTA/82
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CTA/82/">Com
 putable isomorphism problem</a>\nby Valentina Harizanov (George Washington
  University) as part of Computability theory and applications\n\n\nAbstrac
 t\nThese classes include arbitrary structures with at least one relation o
 f arity at least $2$\, abelian $p$-groups\, linear orders\, Boolean algebr
 as\, fields of a fixed characteristic\, nilpotent semigroups\, nilpotent g
 roups\, and nilpotent rings. These classes have isomorphic computable stru
 ctures that are not hyperarithmetically isomorphic. One of the methods we 
 use to establish $\\Sigma _{1}^{1}$-completeness of the isomorphism proble
 m for $K$ is based on a uniform effective interpretation\nof computable st
 ructures in a specific class into computable structures in $K$.\n
LOCATION:https://researchseminars.org/talk/CTA/82/
END:VEVENT
END:VCALENDAR