### Logic List Mailing Archive

## FLoC workshop on proof complexity

**12-13 Jul 2014**

Vienna, Austria

FLoC workshop on proof complexity
---------------------------------
Vienna, July 12/13 2014
http://vsl2014.at/pages/PC-index.html
The workshop will be part of the Vienna Summer of Logic and will be
affiliated with the conferences SAT'14 and CSL/LICS'14.
Proof complexity is the study of the complexity of theorem proving
procedures. The central question in proof complexity is: given a theorem F
(e.g. a propositional tautology) and a proof system P (i.e., a formalism
usually comprised of axioms and rules), 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.
Invited Speakers
Albert Atserias (UPC Barcelona)
Jakob Nordstrom (KTH Royal Institute of Technology)
Pavel Pudlak (Czech Academy of Sciences)
Iddo Tzameret (Tsinghua University)
Program committee
Arnold Beckmann (Swansea University)
Eli Ben-Sasson (Technion, Haifa)
Olaf Beyersdorff (University of Leeds) - chair
Jan Johannsen (LMU Munich) - chair
Massimo Lauria (KTH Royal Institute of Technology, Stockholm)
Organizers
Olaf Beyersdorff (University of Leeds)
Jan Johannsen (LMU Munich)