Speaker
Lorenzo Carlucci
(Sapienza Università di Roma)
Description
Hindman's famous Finite Sums Theorem gives rise to interesting and sometimes long-standing open problems in finite, countable and uncountable combinatorics. We give an overview of some of these problems with a focus on aspects relevant to proof-theory and reverse mathematics.
