Monday 29 April 
09:00

10:00  Angus
Macintyre, Comparing Zilber's exponential fields with the complex exponential field, with special reference to zero sets. 
10:30

11:30  Andy Lewis: Typicality and the Turing degrees 
11:30

12:30  Contributed papers 
16:30

17:30  Arnaud
Durand: Descriptive complexity of logical counting problem 
17:30

18:30  Contributed papers 
18:30

19:30  Poster session and reception 

Tuesday 30 April 
09:00

10:00  Pavel
Pudlak: Estimating the complexity of games using proof complexity 
10:30

11:30  Jeffrey
Paris: Pure Inductive Logic 
11:30

12:30  Contributed papers 
16:30

17:30  Peter Schuster: A Universal KrullLindenbaum Theorem 
17:30

19:30  Contributed papers 
21:00

22:30  Complementary training  careers after a PhD 

Wednesday 1 May 
09:00

10:00  Jouko
Väänänen: The model theory of second order logic 
10:30

11:30  Sam Buss: Limits on AlternationTrading Proofs for TimeSpace Lower Bounds 
11:30

12:30  Contributed papers 
 Free afternoon 

Thursday 2 May 
09:00

10:00  Ulrich
Berger: Program Extraction in Church's Theory of Simple Types 
10:30

11:30  Deirdre
Haskell: Dependent formulas: counting types and VC density 
11:30

12:30  Contributed papers 
16:30

17:30  Romain
Kervarc: Logical description for behaviour analysis in aerospace systems 
17:30

19:30  Contributed papers 
19:30   Banquet 

Friday 3 May 
09:00

10:00  Michael
Laskowski: Dependent formulas: Probability, machine learning, compression schemes, and combinatorics 
10:30

11:30  Heike
Mildenberger: Diagonalising centered families 
11:30

12:30  Contributed papers 
14:00

15:00  Todor
Tsankov: Representations of oligomorphic groups and generalizations of de Finetti's theorem 
15:00

16:00  David Evans: Geometric properties of forking in stable theories 