It is necessary to activate JavaScript to navigate this site.

Grant 19-05497S     1.1.2019 - 31.12.2021
Grantor: Czech Science Foundation

Complexity of mathematical proofs and structures


We study weak logical systems, guided by the question: what is the weakest natural theory in which we can prove a mathematical statement? This question is often fundamentally complexity theoretic in nature, as proofs in such weak systems can be associated with feasible computations. We will study this and related topics in a range of settings, including bounded arithmetic, model theory, algebraic complexity, bounded set theory, and nonclassical logics.

 Main investigator:

Jeřábek Emil

 Participating institutions:

Institute of Mathematics, Czech Academy of Sciences