Prof. RNDr. Pavel Pudlák, DrSc., is a leading scientist in the field of mathematical logic and theoretical computer science. His research is motivated by fundamental questions like the P=NP problem. His main topics of interest include proof complexity and related areas of complexity theory, combinatorics and algebra. He works at the Institute of Mathematics of the Academy of Sciences of the Czech Republic. His seminars in logic and complexity theory at the Institute have been formative for a number of accomplished mathematicians and computer scientists. He worked at a number of foreign universities and institutes, including the Institute for Advanced Study in Princeton. He has been invited to lecture at outstanding universities and conferences, e.g., at the prestigious International Congress of Mathematicians.