Finite and algorithmic model theory
LAAW01
9 January 2006 to 13 January 2006
We have been made aware of a convincing email scam that is focusing on our Programme and Workshop participants. Participants may receive an email from a firm called Expo Hotel Services (ehotelservices.org) to arrange accommodation for workshops and/or programmes. This might include a request to provide them with credit card information.
Please note, INI will never ask for your card details. We take all payments via the University of Cambridge Online store https://onlinesales.admin.cam.ac.uk/.
If you have been contacted by this company please contact us as soon as possible.
Workshop theme
Satellite Workshop helt at University of Durham
The study of the model-theoretic properties of finite structures emerged initially as a branch of classical model theory. However, in the late 1980s research concerning logics on finite structures diverged from work in classical model theory. The consideration of finite structures became intimately related with, for example, computational and descriptive complexity, model checking, database theory, verification, etc., so much so that the boundaries between these subjects are often hard to distinguish.
The methods employed in classical model theory (with its focus on infinite structures) and finite model theory also grew apart during this period. Probabilistic techniques, as well as machine simulations and reductions, play a prominent role in the study of finite structures, and stand in contrast to the geometric, algebraic, and analytic methods that pervade classical (infinite) model theory. Although both classical and finite model theory deal with restricted classes of structures, the conditions by which such classes are delimited also have been quite different. Finite model theory typically concentrates on classes for which particular computing formalisms, e.g., finite state automata or other restricted models of computation, can be used to normalize formulas, or for which decomposition methods from finite graph theory can be applied. In contrast, infinitary model theory usually places restrictions on combinatorial or geometric properties of the definable sets of a structure.
Yet, during the last five years or so there have been indications of a re-convergence of classical model theory and logical, finite aspects of computer science. This has resulted both from the interest of computer scientists in new computing and specification models that make use of infinitary structures, and from the development of powerful model-theoretic techniques that can provide insight into finite structures. Although many common themes have emerged and begun to gain attention, there is significant potential for wider interaction.
The goal of the workshop on finite and algorithmic model theory is to explore both emerging and potential connections between these two areas in greater depth. The workshop will consist of several 3-4-hour tutorials, as well as 2-hour and 1-hour research expositions. This format is designed to introduce researchers and graduate students in the two areas to those topics that are of fundamental interest and importance, to survey current research, and to discuss major unsolved problems and directions for future research.
Timetable
| Monday 9th January 2006 | |||
|---|---|---|---|
| 09:00 to 10:00 |
Martin Otto |
Meeting Room | |
| 10:00 to 11:00 |
Topological queries - topological invariants and query languages |
Meeting Room | |
| 11:00 to 12:00 | Meeting Room | ||
| 13:00 to 14:00 |
Dugald Macpherson University of Leeds |
Meeting Room | |
| 14:00 to 15:00 |
Thomas Wilke |
Meeting Room | |
| 15:00 to 16:00 |
Igor Walukiewicz |
Meeting Room | |
| 16:00 to 17:00 |
Marko Djordjevic |
Meeting Room | |
| 17:00 to 18:00 |
Kousha Etessami University of Edinburgh |
Meeting Room | |
| Tuesday 10th January 2006 | |||
|---|---|---|---|
| 13:00 to 14:00 |
Elwes University of Leeds |
Meeting Room | |
| 15:00 to 16:00 |
Igor Walukiewicz |
Meeting Room | |
| Wednesday 11th January 2006 | |||
|---|---|---|---|
| 13:00 to 14:00 |
Dugald Macpherson University of Leeds |
Meeting Room | |
| Thursday 12th January 2006 | |||
|---|---|---|---|
| 11:00 to 12:00 |
Sasha Rubin University of Auckland |
Meeting Room | |
| 12:00 to 13:00 | Meeting Room | ||
| 13:00 to 14:00 | Meeting Room | ||
| Friday 13th January 2006 | |||
|---|---|---|---|
| 17:00 to 18:00 |
Manuel Bodirsky Humboldt-Universität zu Berlin |
Meeting Room | |
Speakers
- Manuel Bodirsky Humboldt-Universität zu Berlin
- Marko Djordjevic
- Elwes University of Leeds
- Kousha Etessami University of Edinburgh
- Dugald Macpherson University of Leeds
- Martin Otto
- Sasha Rubin University of Auckland
- Igor Walukiewicz
- Thomas Wilke
Supported By
Register for updates
Subscribe for the latest updates on events and news
Isaac Newton Institute for Mathematical Sciences, 20 Clarkson Road, Cambridge CB3 0EH United Kingdom
Tel: +44 1223 335999 Email: reception@newton.ac.uk
© 2023 Isaac Newton Institute for Mathematical Sciences. All Rights Reserved. Privacy Policy
