[FOM] PCC'11

Michiel De Smet mmdesmet at cage.ugent.be
Thu May 12 10:59:08 EDT 2011


PCC 2011
10th Proof, Computation and Complexity
6-7 June 2011

Ghent University, Belgium


Aim and scope
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

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.
Participants who want to contribute a talk are asked to submit an abstract (by sending an e-mail to pelupessy at cage.ugent.be).

The workshop is held in "Priorzaal, Het Pand", Onderbergen 1, 9000 Gent.
This venue is a former Dominican monastery in the middle of the beautiful old city of Ghent.

- Michiel De Smet, Ghent
- Reinhard Kahle, Lisbon
- Florian Pelupessy, Ghent
- Andreas Weiermann, Ghent

Registration and fees
The workshop fee is 25 euro, payable in cash at the beginning of the workshop. This fee includes all coffee breaks and a business lunch on the first day.
If you would like to register please send an e-mail to pelupessy at cage.ugent.be

Past events 
- 2010 in Bern
- 2009 in Nancy
- 2008 in Oslo
- 2007 in Swansea, colocated with the British Mathematical Colloquium 2007,
- 2006 in Ilmenau,
- 2005 in Lisbon, as affiliated Workshop to ICALP '05,
- 2004 in Dresden, in conjunction with the Summer School on Proof Theory and Automated Theorem Proving,
- 2003 in Dresden, in conjunction with the Summer School on Proof Theory, Computation, and Complexity, and
- 2002 in Tübingen.


More information about the FOM mailing list