Workshop: Proof, Computation, Complexity

Dates: July 19-20, 2018
Venue: HIM lecture hall, Poppelsdorfer Allee 45, Bonn
Organizers: Reinhard Kahle, Ralph Matthes

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.

PCC official website


Recorded Talks:

Josef Berger and Gregor Svindland: Convexity and continuity

David Cerna: Proof Schema and the Refutational Complexity of their Cut Structure

Hannes Diener and Robert Lubarsky: Notions of Cauchyness and Metastability

Hajime Ishihara: Constructive reverse mathematics an introduction and recent results

Tatsuji Kawai: On the existance of general bar recursors

Lars Kristiansen: On b-adic Representation of Irrational Numbers

David Natingga: Towards Embedding Theorem: Aut(Dαe) embeds into Aut(Dα)
Updated Slides

Iosif Petrakis: Constructive families of sets and subsets

Michael Rathjen: The Ubiquity of Schütte's Search Trees

Giuseppe Rosolini: Quotient completions and applications

Amirhossein Akbar Tabatabai: Proof Mining in Bounded Arithmetic

Takako Nemoto: Bounded comprehension and monotone convergence theorem

Hugo Herbelin: Computing with Gödel's Completeness Theorem