Proof Complexity Workshop

The workshop is devoted to topics in the complexity of proofs, including the complexity of propositional logic and extensions of propositional logic, the complexity of proof search, and connections with stronger logical systems.

It is organized as part of the Special Semester Program on Computational Complexity.

Workshop dates:

    Workshop dates: May 17-20, 2016.
    Pre-workshop tutorials: May 15-16, 2016.

Now available online:

Organizers: Sam Buss (University of California, San Diego) and Pavel Pudlák (Czech Academy of Sciences)

Local organizer: Edward Hirsch (Steklov Institute of Mathematics, St.Petersburg State University)

Associated Events:

The special semester and workshop are organized by St.Petersburg State University jointly with the Skolkovo Institute of Science and Technology and the Steklov Institute of Mathematics at St.Petersburg. Funding is provided by the Skolkovo Institute of Science and Technology, with additional funding from the US National Science Foundation for student support and from JSC Gazrom Neft for the Chebyshev Laboratory.