< Back to previous page

Project

Investigations into the strength Hindman's theorem and its alternative formulations.

Hindman’s theorem is a milestone in Combinatorics which gives rise to long-standing open problems in Mathematical Logic. The study of Ramsey’s theorem and Goodstein sequences is closely related to the research on Hindman’s theorem and provides useful methods to adapt in this case. The project aims to investigate and classify the computational strength of Hindman’s theorem and its alternative formulations.

Date:1 Jan 2021 →  Today
Keywords:Hindman's theorem, Ramsey Theory, Combinatorics, Proof Theory, Reverse Mathematics, Computability
Disciplines:Mathematical logic and foundations, Combinatorics