Skip to content

Workshop Programme

for period 9 - 13 January 2006

Finite and Algorithmic Model Theory

9 - 13 January 2006

Timetable

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

Back to top ∧