Conferences / Workshops


Proof, Computation, Complexity

15 July - 19 July 2019

The aim of PCC is to stimulate research in proof theory, computation, and complexity from a mathematical perspective, focusing on issues which combine logical and computational aspects. Topics may include applications of formal inference systems in mathematics and computer science, as well as new developments in proof theory motivated by mathematical and computer science demands. Specific areas of interest are (non-exhaustively listed) proof theory, foundations for specification and programming languages, logical methods in specification and program development including program extraction from proofs, type theory, new developments in structural proof theory, and implicit computational complexity.


Group photo



Reinhard Kahle
Universidade NOVA de Lisboa
Lars Kristiansen
University of Oslo
Ralph Matthes
IRIT Toulouse Institute of Computer Science Research
Erik Palmgren
Stockholm University


Reinhard Kahle


For practical matters at the Institute, send an e-mail to