Programme

The programme is still preliminary and may be subject to change. 

Please, check the website regularly to stay up to date!

 [ download the programme booklet pdf ]

Wednesday 14th of May

11:00  - welcome 

11:30  - Vito Michele Abrusci: Logic and Arithmetic, Dedekind and Gödel. 

12:00  - Gabriele Buriola:  Defeasible arithmetic: Non-monotonic reasoning with constraints and assignments of numeric variables.

12:30  - lunch 

14:45  - Davide Catta:  Between Dialogues and Games: Bridging Dialogical Logic and Game Semantics.

15:30  - Fabio Aurelio D’Asaro:  A Unifying Framework for Learning Argumentation Semantics.

16:00  - coffee 

16:30  - Kees van Berkel:  Reasoning with and about normative conflicts: a logical argumentation approach.

17:15  - Carlo Proietti: Argument and Belief.

18:00  - closure 

Thursday 15th of May

    9:00  -  Adrien Ragot: Specification of Linear Logic Principles.

   9:45  -  Matteo Acclavio: Linear Logic Programming for Distributed Systems.

10:30   -  coffee 

11:00   -  Federico Olimpieri: Linearization by structural rule elimination.

11:30   -  Raffaele Di Donna: On the role of connectivity in Linear Logic proofs.

12:00   -  Cheng-Syuan Wan:  Proof Theory of Semi-Substructural Logics.

12:30   -  lunch 

14:45  -  Matteo Tesi: Axioms and rules in intuitionistic logic.

15:30  -  Silvio Ghilardi: The bounded proof property via step algebras and step frames.

16:00  -  coffee 

16:30  -  Cosimo Perini Brogi: A proof theoretic framework for process verification.

17:00  -  Marianna Girlando: Investigating cyclic labelled proofs.

17:30  -  Eugenio Orlandelli: G3-style Sequent Calculi and Craig Interpolation Property for Logics with Russellian Definite Descriptions.

18:00  -  closure 

19:00  -  social dinner 

Friday 16th of May

  9:00  -  Stefano Guerrini: Dissecting the PAM. With an extension to lambda-mu-calculus.

  9:45  -  Lionel Vaux Auclair: Extensional Taylor expansion.

10:30  -  coffee 

11:00  -  Hugo Herbelin: Investigations into non-extensional elementary toposes and their relation to Girard’s System Fω.

11:30  -  Matteo Palazzo: Reversibility, Garbage and Complexity.

12:00  -  Rémi Di Guardia: Identity of formulas and proofs.

12:30  -  lunch 

14:45  -  Robin Adams: Quantum Logics.

15:30  -  Benoît Valiron: On typed quantum programming languages.

16:15  -  coffee 

16:45  -  Marco Pedicini. Proof Theory, and Cryptography: Reasoning About the Uncomputable.

17:30  - Franziskus Wiesnet: Verified Program Extraction in Elementary Arithmetic.

18:00  -  farewell