It is necessary to activate JavaScript to navigate this site.

Grant IAA100190902     1.1.2009 - 31.12.2013
Grantor: Grant Agency of Czech Academy of Sciences

Mathematical logic, complexity, and algorithms

Project of basic research in mathematical logic and theoretical computer science. We focus on bounded arithmetic and proof complexity, set theory, computational complexity theory, and the theory of algorithms. The topics range from foundational areas of mathematics to algorithmic problems motivated by applied research. The results of the project will be published in high quality international scientific journals and in the proceedings of selective conferences.

 Main investigator:

Sgall Jiří

 Participating institutions:

Institute of Mathematics, Czech Academy of Sciences