Project

The complexities of mathematical problems

Duration
01 October 2012 → 30 June 2020
Funding
Regional and community funding: Special Research Fund, Research Foundation - Flanders (FWO)
Research disciplines
  • Natural sciences
    • History and foundations
Keywords
computability theory Medvedev degrees Muchnik degrees mass problems effectively closed sets Reverse Mathematics
 
Project description

Mathematical logic lets mathematicians rephrase philosophical questions as precise mathematical questions. This project’s theme is to use tools from mathematical logic, specifically tools from computability theory, to study the question "How complicated is the universe of mathematical problems?" We analyze the complexity of the universe of problems as a whole and the complexities of several well-known concrete problems.