BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:David Gonzalez (University of California Berkeley)
DTSTART:20240201T190000Z
DTEND:20240201T200000Z
DTSTAMP:20260423T021227Z
UID:OLS/144
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/144/">Ge
 nerically computable linear orderings</a>\nby David Gonzalez (University o
 f California Berkeley) as part of Online logic seminar\n\n\nAbstract\nW. C
 alvert\, D\, Cenzer and V. Harizanov introduced notions of generic computa
 bility for structures that are stratified by the computable ordinals. In a
  recent collaboration with these authors we examined these notions in the 
 context of linear orderings. Our main results contrast one another. We sho
 w that every linear ordering has a 1-generically computable copy. On the o
 ther hand\, we have that the set of linear orderings with a n-generically 
 computable copy for n>1 is as complicated as possible: Sigma 1 1-complete.
 \n\nThis talk will put these results in context and describe the new\, mor
 e structural approach we took to this problem. In particular\, I will desc
 ribe these results through the lens of a surprising connection with Ramsey
 -like properties.\n
LOCATION:https://researchseminars.org/talk/OLS/144/
END:VEVENT
END:VCALENDAR