BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Marta Fiori Carones (LMU Munich)
DTSTART:20200505T200000Z
DTEND:20200505T210000Z
DTSTAMP:20260423T004756Z
UID:CTA/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CTA/3/">A th
 eorem from Rival and Sands and reverse mathematics</a>\nby Marta Fiori Car
 ones (LMU Munich) as part of Computability theory and applications\n\n\nAb
 stract\nIn 1980 Ivan Rival and Bill Sands proved that for each infinite po
 set P with finite width (i.e. such that there is a fixed finite bound on t
 he size of antichains in P) there is an infinite chain C ⊆ P such that e
 ach element  of P is comparable to none or to infinitely many elements of 
 C. Moreover\, if P is countable\, C can be found such that each element of
  P is comparable to none or to cofinitely  many elements of C.\nWe prove t
 hat some versions of the previous theorem are equivalent to the Ascending/
 descending sequence principle or to related known principles of the revers
 e mathematics zoo. \n(Joint work with Alberto Marcone\, Paul Shafer and Gi
 ovanni Soldà)\n
LOCATION:https://researchseminars.org/talk/CTA/3/
END:VEVENT
END:VCALENDAR