Research Explorer

Project

Investigations into the strength Hindman's theorem and its alternative formulations.
Code
01D28620
Duration
01 January 2021 → 31 December 2024
Funding
Regional and community funding: Special Research Fund
Research disciplines
  • Natural sciences
    • Combinatorics
    • Mathematical logic and foundations
Keywords
Combinatorics Proof Theory Computability Reverse Mathematics Ramsey Theory Hindman's theorem
 
Project description
 

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.