PCC - Proof, Computation, Complexity

International workshop

18 - 19 June 2010, Bern, Switzerland

General Information    Talks    Preliminary Program    Accommodation    Past workshops   

General Information

Aims 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 demands. 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.


The workshop is held in room B78 of the ExWi-building of the University of Bern, Switzerland. Here is a map.


Registration & fees

The workshop fee is 25 CHF, payable in cash at the beginning of the workshop.

If you are not a speaker and want to register, then please send an email to the organisers.

Contact: pcc2010.workshop -AT- gmail.com


Invited Talks

Contributed Talks

Preliminary Program

Friday, June 18th

9:00 Registration
9:30Lev Beklemishev: Provability algebras and scattered topology
11:00Evgenij Dashkov: On positive fragments of polymodal provability logic
11:30Lars Kristiansen: Subrecursive Degrees and Statements Independent of PA
12:00Isabel Oitavem: Monotone schemes within FPSPACE
14:30Agata Ciabattoni: Systematic (and algebraic) proof theory for substructural logics
16:00Roy Dyckhoff: Cut elimination, substitution and normalisation
16:30Richard McKinley: A framework for expressing sequent proofs
17:00Lutz Straßburger: On the p-equivalence of extension and substitution in deep inference
19:00 Dinner at Altes Tramdepot

Saturday, June 19th

10:00 Rosalie Iemhoff: Unification in nonclassical theories
11:30 Roman Kuznets: A Note on the Abnormality of Realizations of S4LP
12:00 Daniyar Shamkanov: Strong normalization and confluence for reflexive combinatory logic
12:30 Lunch
14:30 Nicolas Guenot: Normalisation by Interaction and Computational Interpretations
15:00 Tom Gundersen: Breaking Paths in Atomic Flows for Classical Logic
15:30 Coffee
16:00Thomas Piecha: Inversion of Logical Rules by Definitional Reflection
16:30Willem Heijltjes: Proof Nets for Free Sum-Product Categories

Sunday, June 20th

If people are interested and the weather permits, there will be a hike up some mountain.


We'd ask you to take care of your hotel reservations yourselves -- but don't hesitate to contact us if you have questions.

Our standard recommendation is Hotel Metropol for about CHF 125. An alternative is Hotel Arabelle for about CHF 115. If you're on a budget and willing to share a shower then try Hotel National for about CHF 60. All these prices are for single rooms. All these hotels are in less than 15min walking distance to the institute.

Here is a map (with phone numbers).

If you're not happy with the above choices: Bern Tourismus provides a list of hotels and backpackers in Bern.

Past PCC workshops