\n

\n Proof complexity is the study of the complexi ty of theorem\n proving procedures. The cen tral question in proof complexity\n is: giv en a theorem F and a proof system P, what is the s ize\n of the smallest proof of F in the sys tem P? Moreover, how\n difficult is it to construct a small proof?\n Many ingenious t echniques have been developed to try to answer\n these questions; and they bare tight relatio ns to intricate\n theoretical questions fro m computational complexity (such as\n the c elebrated P vs. NP problem), mathematical logic\n (e.g. separating theories of Bounded Arithm etic) as well as to\n practical problems in SAT solving.\n

\nThe workshop w ill be part of the Vienna Summer of Logic and will be \n affiliated with the conferences SAT' 14 and CSL/LICS'14.\n

\n \n \nFor more information, see\n http://vsl2014.at/pages/PC-index.html\n

\n\n

URL:/NewsandEvents/Archives/2014/newsitem/5643/12-
13-July-2014-FLoC-workshop-on-proof-complexity-Vie
nna-Austria
END:VEVENT
END:VCALENDAR
\n We w elcome 1-2-page abstracts presenting (finished, on going, or if clearly stated even recently publishe d) work on proof complexity.\n Submission d eadline is 16 May 2014.\n

\n