26 - 27 July 2017, Sixteenth International Workshop on Proof, Computation & Complexity (PCC 2017), Goettingen, Germany
The aim of PCC is to stimulate research in proof theory, computation, and complexity, focusing on issues which combine logical and computational aspects. Topics may include applications of formal inference systems in computer science, as well as new developments in proof theory motivated by computer science demands. PCC 2017 will include an unveiling ceremony of a commemorative plaque for Paul Bernays.
We solicit contributions in the fields of PCC. Specific areas of interest are (non-exhaustively listed) 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.
PCC is intended to be a lively forum for presenting and discussing recent work. Progress on a not yet satisfactorily solved problem may well be worth presenting - in particular if the discussions during the workshop might lead towards a solution.