skip to content
 

Timetable (LAAW01)

Finite and Algorithmic Model Theory

Monday 9th January 2006 to Friday 13th January 2006

Monday 9th January 2006
09:00 to 10:00 M Otto (Technische Universität Darmstadt)
Model theoretic methods for special classes of (finite) structures
10:00 to 11:00 B Kujipers ([Hasselt])
Topological queries - topological invariants and query languages
11:00 to 12:00 J Van de Bussche ([Hasselt])
Logical aspects of spatial databases
13:00 to 14:00 D Macpherson ([Leeds])
Asymptotics of definable sets in finite structres
14:00 to 15:00 T Wilke ([Christian-Albrechts])
Logics, automata, and finite semigroups
15:00 to 16:00 I Walukiewicz ([CNRS])
Towards understanding tree languages - part 1
16:00 to 17:00 M Djordjevic ([Uppsala])
Connections between finite and infinite model theory
17:00 to 18:00 K Etessami ([Edinburgh])
Analysis of recursive Markov chains, recursive Markov decision processes, and recursive stochastic games
Tuesday 10th January 2006
13:00 to 14:00 R Elwes ([Leeds])
Asymptotics of definable sets in finite structures
15:00 to 16:00 I Walukiewicz ([CNRS])
Towards understanding tree languages - part 2
Wednesday 11th January 2006
13:00 to 14:00 D Macpherson ([Leeds])
Asymptotics of definable sets in finite structures
Thursday 12th January 2006
11:00 to 12:00 S Rubin ([Auckland])
Classifying automatic structures
12:00 to 13:00 N Schweikardt ([Humboldt])
(Finite) model theory of tree and tree-like structures
13:00 to 14:00 S Kreutzer ([Humboldt])
(Finite) model of tree and tree-like structures
Friday 13th January 2006
17:00 to 18:00 M Bodirsky ([Humboldt])
The algebraic approach to infinite-valued constraint satisfaction
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons