12-13 July 2014, FLoC workshop on proof complexity, Vienna, Austria

Proof complexity is the study of the complexity of theorem proving procedures. The central question in proof complexity is: given a theorem F and a proof system P, what is the size of the smallest proof of F in the system P? Moreover, how difficult is it to construct a small proof? Many ingenious techniques have been developed to try to answer these questions; and they bare tight relations to intricate theoretical questions from computational complexity (such as the celebrated P vs. NP problem), mathematical logic (e.g. separating theories of Bounded Arithmetic) as well as to practical problems in SAT solving.

The workshop will be part of the Vienna Summer of Logic and will be affiliated with the conferences SAT'14 and CSL/LICS'14.

For more information, see http://vsl2014.at/pages/PC-index.html