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.

logic

Audience: researchers in the topic

Computability theory and applications

Series comments: Description: Computability theory, logic

The goal of this endeavor is to run a seminar on the platform Zoom on a weekly basis, perhaps with alternating time slots each of which covers at least three out of four of Europe, North America, Asia, and New Zealand/Australia. While the meetings are always scheduled for Tuesdays, the timezone varies, so please refer to the calendar on the website for details about individual seminars.