Midwest Computability Seminar

XXVII
Part ii


The Midwest Computability Seminar is meeting remotely in the fall of 2021. The recurring Zoom link is:

https://notredame.zoom.us/j/99754332165?pwd=RytjK1RFZU5KWnZxZ3VFK0g4YTMyQT09

Meeting ID: 997 5433 2165

Passcode: midwest


slides     Panopto video     YouTube video


This session will be held jointly with the Computability Theory and Applications Online Seminar.


DATE: Monday, September 27th, 2021

TIME: 3:30 - 4:30 PM Central Time


SPEAKER: Benoit Monin - Créteil University

TITLE: The computational content of Milliken’s tree theorem

ABSTRACT: The Milliken’s tree theorem is an extension of Ramsey’s theorem to trees. It implies for instance that if we assign to all the sets of two strings of the same length, one among k colors, there is an infinite binary tree within which every pair of strings of the same length has the same color. We are going to present some results on Milliken’s tree theorem from the viewpoint of computability theory and reverse mathematics.



Past and Future Sessions

Previous Seminars:

If you haven't been receiving the announcements and would like to be included in the list, send an email to drh@math.uchicago.edu.