BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jason Block (College of William & Mary)
DTSTART:20251113T190000Z
DTEND:20251113T200000Z
DTSTAMP:20260423T052840Z
UID:OLS/187
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/187/">Me
 asuring the Complexity of Countable Models of Presburger Arithmetic</a>\nb
 y Jason Block (College of William & Mary) as part of Online logic seminar\
 n\n\nAbstract\nWe examine two methods for classifying the complexity of co
 untable structures: degree spectra\, and Scott analysis. Degree spectra me
 asure how difficult it is to compute copies of structures\, while Scott an
 alysis measures the complexity of describing structures up to isomorphism.
  We examine the possible degree spectra and Scott complexities of countabl
 e Presburger groups and compare these results with those for models of Pea
 no Arithmetic. We also discuss how these measures of complexity succeed/fa
 il in distinguishing the intended model of the theory.\n
LOCATION:https://researchseminars.org/talk/OLS/187/
END:VEVENT
END:VCALENDAR