The early days of finite model theory saw a variety of results establishing that the model theory of the class of finite structures is not well-behaved. Recent work has shown that considering subclasses of the class of finite structures allows us to recover some good model-theoretic behaviour. This appears to be especially true of some classes that are known to be algorithmically well-behaved. We review some results in this area and explore the connection between logic and algorithms. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Dawar, A. (2007). Finite model theory on tame classes of structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 2–12). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_2
Mendeley helps you to discover research relevant for your work.