BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Hongyu Zhu (University of Wisconsin)
DTSTART:20260326T180000Z
DTEND:20260326T190000Z
DTSTAMP:20260423T035728Z
UID:OLS/201
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/201/">A 
 Complete Bounded Theory with Unbounded Types</a>\nby Hongyu Zhu (Universit
 y of Wisconsin) as part of Online logic seminar\n\n\nAbstract\nSay a first
 -order theory is bounded if for some finite $n$\, it is $\\forall_n$-axiom
 atizable\; Similarly for a type. This notion is closely related to descrip
 tive complexity and provides a measure of complexity for theories and type
 s. In an attempt to connect the complexity of theories and that of their t
 ypes\, we show the existence of a bounded (in fact universal) theory which
  has an unbounded type. The construction uses trees\, and one key step of 
 the proof is showing the pseudofiniteness of finite-height trees.\n
LOCATION:https://researchseminars.org/talk/OLS/201/
END:VEVENT
END:VCALENDAR