Current thoughts on Hindman’s Theorem

Abstract: The exact reverse mathematical strength of Hindman’s theorem is a long standing open question. This talk will discuss efforts to carry out an ultrafilter-based proof using only arithmetical comprehension. A particular emphasis is the definability of a class of sets that witness that certain ultrafilters do not encode homogeneous sets for Hindman’s theorem.

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.