- Ali Enayat (University of Gothenburg - Sweden): Playing with Fire: Interpreting PA with a full satisfaction predicate within PA. slides 

- David Fernández-Duque (Centre International de Mathématiques et d’Informatique de Toulouse - France): From weak to strong arithmetic via reflection. slides

- Emil Jerabek (Institute of Mathematics of the Czech Academy of Sciences - Czech Republic): Diophantine formulas. slides

- Isabel Oitavem (Universidade Nova de Lisboa - Portugal): Applicative theories for the polynomial hierarchy of time and its levels. slides

- Neil Thapen (Institute of Mathematics of the Czech Academy of Sciences - Czech Republic): A feasible set theory

- Tin Lok Wong (Kurt Gӧdel Research Center for Mathematical Logic – University of Vienna - Austria): Upgrading the arithmetized completeness theorem. slides 



- Rasmus Blanck  (University of Gothenburg - Sweden): A characterisation of Pi_1-conservativity over I\Sigma_1

- Henri-Alex Esbelin (Clermont Université - France): Word problem vs modular counting in \Delta_0. slides

- Michal Garlík (University of Warsaw - Poland): Bounded arithmetic and a restricted reduced product construction

- Michał Godziszewski (University of Warsaw - Poland): Short elementary cuts in recursively saturated models of arithmetic

- Daniel Graça (Universidade do Algarve - Portugal): Computability of the Lorenz attractor

- Saeideh HajiBahrami (Tarbiat Modares University - Iran): The germomorphism group of a model of arithmetic  

- Joost Joosten (Universitat de Barcelona - Spain): Characterizations of interpretability in bounded arithmetic. slides

- Manuel Loureiro (Universidade Lusófona de Humanidades e Tecnologias - Portugal): On the reverse mathematics of Lipschitz and Wadge determinacy. slides

- Arthur Milchior (Université Paris 7 - IRIF - France): Undecidability of satisfiability of expansions of FO[<] over words with a FO[+]-definable set. slides


The abstract booklet is available here.