\n

**Due to the Coronavi
rus outbreak, the workhop is cancelled!**

Around thirty years after the fa ll of Hilbert's program, the proofs-as-programs pa radigm established the view that proofs should con sist in computational or epistemic objects conveyi ng evidence to mathematical propositions. The rela tionship between formal derivations and proofs sho uld then be analogous to the one between words and their meanings. This view naturally gives rise to questions such as 'which conditions should a form al arrangement of symbols satisfy to represent a p roof?' or 'when do two formal derivations represen t the same proof?'. These questions underlie past and current research in proof theory both in the t heoretical computer science community (e.g. catego rical logic, domain theory, linear logic) and in t he philosophy community (e.g. proof-theoretic sema ntics).

\n\nIn spite of these common motiv ations and historical roots, it seems that today p roof theorists in philosophy and in computer scien ce are losing sight of each other. This workshop a ims at contributing to a renaissance of the intera ction between researchers with different backgroun ds by establishing a constructive environment for exchanging views, problems and results.

\n\n < p>In addition to regular invited talks, the worksh op includes two tutorials, aimed at introducing re cent ideas on the correspondence between proofs, p rograms and categories as well as to the historica l and philosophical aspects of the notions of infi nity and predicativity.\n\n **\n**

We
invite submissions for contributed talks on topics
related to the themes of the meeting. These inclu
de, but are not restricted to:

\n - Iden
tity of proofs

\n - Graphical/diagramma
tic representations of proofs

\n - Typed
vs untyped proof theory

\n - Paradoxes
and circular reasoning

\n - Constructivi
sm and (im)predicativity

\n - Duality pr
oofs/refutations

\n - Computational inte
rpretations of classical and non-classical logics<
br>\n - Non-deterministic/probabilistic asp
ects of computation

\n - Inductive/co-in
ductive constructions in proof theory and type the
ory

\n - (Higher-)categorical proof theo
ry

\n - Substructural aspects of logic**\n - Philosophical and historical reflect
ions on any of the above**