Conference Programme

Monday, June 19

09:30–10:00: Registration
10:00–10:30: Opening Talk: D. Richard (University of Clermont 1)
10:30–11:00: COFFEE BREAK
11:00–12:00: Invited Talk: A. Grzegorczyk (Polish Academy of Sciences, Warsaw)
Théorie de textes comme une base adéquate de l'étude d'indécidabilité, sans usage de l'arithmétique. Slides(PDF) Slides(PPT)

12:00–12:35: A. Cordón-Franco (University of Seville)
On the Schemes of Induction and Collection up to Definable Elements (joint work with A. Fernández-Margarit and F.F. Lara-Martín). Abstract Slides(PDF)


12:45–14:30: LUNCH

14:30–15:30: Invited Talk: V. Dalmau (Pompeu Fabra University, Barcelona)
Constraint Satisfaction, Logic, and Dualities. Abstract Slides(PDF)
15:30–16:00: COFFEE BREAK
16:00–17:00: Invited Talk: A. Kisielewicz (University of Wroclaw)
First-Order Definability in Lattices. Abstract Slides(PDF)
17:00–17:35: S. Grigorieff (LIAFA, France)
De l'indécidable á l'aléatoire. Abstract

Tuesday, June 20

09:30–10:30: Invited Talk: P. D'Aquino (Seconda Università di Napoli, Naples)
Strong initial segments of models of I$\Delta_0$ (joint work with J. Knight) Slides(PDF)
10:30–11:00: COFFEE BREAK
11:00–11:35: K. Ojakian (Instituto Superior Técnico, Lisbon)
Bounded Arithmetic with Bounded Finite Types. Abstract
11:35–12:10: L.A. Kolodziejczyk (Institute of Mathematics, Warsaw University)
Some Results on Weak Consistency Statements in Weak Theories. Abstract Slides(PDF)
12:10–12:45: F.F. Lara-Martín (University of Seville)
Conservation Results for Induction and Collection Schemes in First-Order Arithmetic (joint work with A. Cordón-Franco and A. Fernández-Margarit). Abstract Slides(PDF)

12:45–14:30: LUNCH

14:30–15:30: Invited Talk: C. Dimitracopoulos (University of Athens)
$\Sigma_n$ Collection vs. $\Delta_n$ Induction. Abstract Slides(PDF)
15:30–16:00: COFFEE BREAK
16:00–17:00: Invited Talk: Z. Adamowicz (Polish Academy of Sciences, Warsaw)
Some Results in Bounded Arithmetic based on a technique derived from the Herbrand Theorem (a survey)
17:00–17:35: K. Zdanowski (Polish Academy of Sciences, Warsaw)
On provability of Herbrand Consistency in Weak Arithmetics (joint work with Z. Adamowicz). Abstract

19:30: CONFERENCE DINNER

09:30–10:30: Invited Talk: O. Bournez (INRIA/LORIA, France)
Modèles de calculs à temps continu
10:30–11:00: COFFEE BREAK
11:00–11:35: M. Piotrów (University of Wroclaw)
Faster Merging Networks with Constant Periods (joint work with M. Jaros). Abstract Slides(PDF)
11:35–12:10: E. Hainry (INPL/LORIA, France)
General Purpose Analog Computers are as powerful as Computable Analysis. Abstract


12:45–14:30: LUNCH

Wednesday Afternoon: SOCIAL EVENT (excursion)