Universiteit van Amsterdam


Institute for Logic, Language and Computation

Please note that this newsitem has been archived, and may contain outdated information or links.

20 - 21 March 2020, Workshop "Proofs, Computation, & Meaning", cancelled

Date: 20 - 21 March 2020
Location: Tuebingen, Germany
Deadline: Wednesday 15 January 2020

Due to the Coronavirus outbreak, the workhop is cancelled!

Around thirty years after the fall of Hilbert's program, the proofs-as-programs paradigm established the view that proofs should consist in computational or epistemic objects conveying evidence to mathematical propositions. The relationship between formal derivations and proofs should then be analogous to the one between words and their meanings. This view naturally gives rise to questions such as 'which conditions should a formal arrangement of symbols satisfy to represent a proof?' or 'when do two formal derivations represent the same proof?'. These questions underlie past and current research in proof theory both in the theoretical computer science community (e.g. categorical logic, domain theory, linear logic) and in the philosophy community (e.g. proof-theoretic semantics).

In spite of these common motivations and historical roots, it seems that today proof theorists in philosophy and in computer science are losing sight of each other. This workshop aims at contributing to a renaissance of the interaction between researchers with different backgrounds by establishing a constructive environment for exchanging views, problems and results.

In addition to regular invited talks, the workshop includes two tutorials, aimed at introducing recent ideas on the correspondence between proofs, programs and categories as well as to the historical and philosophical aspects of the notions of infinity and predicativity.

We invite submissions for contributed talks on topics related to the themes of the meeting. These include, but are not restricted to:
 - Identity of proofs
  - Graphical/diagrammatic representations of proofs
 - Typed vs untyped proof theory
 - Paradoxes and circular reasoning
 - Constructivism and (im)predicativity
 - Duality proofs/refutations
 - Computational interpretations of classical and non-classical logics
 - Non-deterministic/probabilistic aspects of computation
 - Inductive/co-inductive constructions in proof theory and type theory
 - (Higher-)categorical proof theory
 - Substructural aspects of logic
 - Philosophical and historical reflections on any of the above

For more information, see http://ls.informatik.uni-tuebingen.de/PCM/ or contact Luca Tranchini at , or Paolo Pistone at .

Please note that this newsitem has been archived, and may contain outdated information or links.