Programme

Wednesday, June 17th, 2009

09:30-10:00 Registration

10:00-11:00 Patrick Cégielski (Paris 12) Normal form for extended Abstract State Machines slides - video1 - video2

11:00-11:30 Coffee/tea break

11:30-12:30 Andrés Cordón-Franco (Seville) Parameter free $\Pi_1$-induction and restricted exponentiation slides - video - abstract

12:30-14:00 Lunch break on location

14:00-15:00 Anuj Dawar (Cambridge) Logics for Polynomial Time I slides - video (introduction by Jean-Pierre Ressayre)

15:00-16:00 Costas Dimitracopoulos (Athens) On a problem of Jeff Paris slides - video

16:00-16:30 Coffee/tea break

16:30-17:30 Olivier Finkel (Paris 7) Decision Problems for Recognizable Languages of Infinite Pictures slides - video - abstract

9:30-10:30 Francisco-Félix Lara-Martín (Seville) A model-theoretic approach to parameter free $\Pi_2$-induction slides - video - abstract

10:30-11:30 Konrad Zdanowski (Paris and Warsaw) A Tight Lower Bound for Determinization of Transition Labeled Buchi Automata slides - video

11:30-12:00 Coffee/tea break

12:00-13:00 Alla Sirokofskich (Crete) Decidability of theories of polynomials slides - video

13:00-14:30 Lunch break on location

14:30-15:30 Anuj Dawar (Cambridge) Logics for Polynomial Time II slides - video

15:30-16:30 Alex Esbelin (Clermont-Ferrand) Open Problems in Real Numbers Complexity slides - video

16:30-17:00 Coffee/tea break

17:00-18:00 Round table on publication at CSLI

19:00-22:00 Special Dinner
Photo 1 - Photo 2 - Photo 3 - Photo 4 - Photo 5 (Thanks to Alla)

10:00-11:00 Anuj Dawar (Cambridge) Logics for Polynomial Time III slides

11:00-11:30 Coffee/tea break

11:30-12h30 Pierre Valarcher 5Paris 12) A theorem of representation for primitive recursive algorithms slides - video

12:00-13h30 Final lunch (bag to take away)

Last modified: June 27, 2009