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:20260404T131152Z
UID:CTA/3
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/CTA/3
 /">A theorem from Rival and Sands and reverse mathematics</a>\nby Marta Fi
 ori Carones (LMU Munich) as part of Computability theory and applications\
 n\n\nAbstract\nIn 1980 Ivan Rival and Bill Sands proved that for each infi
 nite poset P with finite width (i.e. such that there is a fixed finite bou
 nd on the size of antichains in P) there is an infinite chain C ⊆ P such
  that each element  of P is comparable to none or to infinitely many eleme
 nts of C. Moreover\, if P is countable\, C can be found such that each ele
 ment of P is comparable to none or to cofinitely  many elements of C.\nWe 
 prove that some versions of the previous theorem are equivalent to the Asc
 ending/descending sequence principle or to related known principles of the
  reverse mathematics zoo. \n(Joint work with Alberto Marcone\, Paul Shafer
  and Giovanni Soldà)\n
LOCATION:https://stable.researchseminars.org/talk/CTA/3/
END:VEVENT
END:VCALENDAR