BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Duarte Maia Nascimento (University of Chicago)
DTSTART:20260917T180000Z
DTEND:20260917T190000Z
DTSTAMP:20260620T024951Z
UID:OLS/217
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/217/">Es
 caping Tennenbaum's Theorem</a>\nby Duarte Maia Nascimento (University of 
 Chicago) as part of Online logic seminar\n\nInteractive livestream: https:
 //zoom.us/j/122323340\n\nAbstract\nTennenbaum's theorem states that PA doe
 s not admit any\ncomputable model other than the "usual natural numbers" (
 this is called\nthe standard model). In 2022\, Fedor Pakhomov proved that 
 this theorem is\nfragile in regards to how PA is expressed\, by constructi
 ng a theory that\nis definitionally equivalent to PA (roughly: "it's PA bu
 t with a\ndifferent choice of symbols") for which there is a computable\nn
 onstandard model. I will introduce the audience to this result and\,\ntime
  allowing\, present the way in which we have been able to improve on\nPakh
 omov's original construction and some remaining open questions.\n
LOCATION:https://researchseminars.org/talk/OLS/217/
URL:https://zoom.us/j/122323340
END:VEVENT
END:VCALENDAR