BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Benoit Monin (Créteil University)
DTSTART:20210927T203000Z
DTEND:20210927T213000Z
DTSTAMP:20260423T005736Z
UID:CTA/61
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CTA/61/">The
  computational content of Milliken’s tree theorem</a>\nby Benoit Monin (
 Créteil University) as part of Computability theory and applications\n\n\
 nAbstract\nThe Milliken’s tree theorem is an extension of Ramsey’s the
 orem to trees. It implies for instance that if we assign to all the sets o
 f two strings of the same length\, one among k colors\, there is an infini
 te binary tree within which every pair of strings of the same length has t
 he same color. We are going to present some results on Milliken’s tree t
 heorem from the viewpoint of computability theory and reverse mathematics.
 \n
LOCATION:https://researchseminars.org/talk/CTA/61/
END:VEVENT
END:VCALENDAR