\n

Proof com plexity is the study of the complexity of theorem proving procedures. The central question in proof complexity is: given a theorem F and a proof syste m P, what is the size of the smallest proof of F i n the system P? Moreover, how difficult is it to c onstruct a small proof? Many ingenious techniques have been developed to try to answer these questio ns, which bare tight relations to intricate theore tical open problems from computational complexity (such as the celebrated P vs. NP problem), mathema tical logic (e.g. separating theories of Bounded A rithmetic) as well as to practical problems in SAT /QBF solving.

\n\nThe workshop will be par t of FLoC and will be affiliated with the conferen ces SAT'18 and LICS'18.

\n\n

URL:http://easychair.org/smart-program/PC2018/
END:VEVENT
END:VCALENDAR
We welcome 1-2-page abstracts presenting (finished, o ngoing, or if clearly stated even recently publish ed) work on proof complexity. Particular topics of interest are Proof Complexity, Bounded Arithmetic , Relations to SAT/QBF solving, and Relations to C omputational Complexity. The abstracts will appear in electronic pre-proceedings that will be distri buted at the meeting. Accepted communications must be presented at the workshop by one of the author s.

\n