Some aspects of model theory and finite structures

Bulletin of Symbolic Logic 8 (3):380-403 (2002)
  Copy   BIBTEX

Abstract

Model theory is concerned mainly, although not exclusively, with infinite structures. In recent years, finite structures have risen to greater prominence, both within the context of mainstream model theory, e.g., in work of Lachlan, Cherlin, Hrushovski, and others, and with the advent of finite model theory, which incorporates elements of classical model theory, combinatorics, and complexity theory. The purpose of this survey is to provide an overview of what might be called the model theory of finite structures. Some topics in finite model theory have strong connections to theoretical computer science, especially descriptive complexity theory. In fact, it has been suggested that finite model theory really is, or should be, logic for computer science. These connections with computer science will, however, not be treated here.It is well-known that many classical results of ‘infinite model theory’ fail over the class of finite structures, including the compactness and completeness theorems, as well as many preservation and interpolation theorems. The failure of compactness in the finite, in particular, means that the standard proofs of many theorems are no longer valid in this context. At present, there is no known example of a classical theorem that remains true over finite structures, yet must be proved by substantially different methods. It is generally concluded that first-order logic is ‘badly behaved’ over finite structures.From the perspective of expressive power, first-order logic also behaves badly: it is both too weak and too strong. Too weak because many natural properties, such as the size of a structure being even or a graph being connected, cannot be defined by a single sentence. Too strong, because every class of finite structures with a finite signature can be defined by an infinite set of sentences. Even worse, every finite structure is defined up to isomorphism by a single sentence. In fact, it is perhaps because of this last point more than anything else that model theorists have not been very interested in finite structures. Modern model theory is concerned largely with complete first-order theories, which are completely trivial here.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Finite variable logics in descriptive complexity theory.Martin Grohe - 1998 - Bulletin of Symbolic Logic 4 (4):345-398.
Modal logic over finite structures.Eric Rosen - 1997 - Journal of Logic, Language and Information 6 (4):427-439.
Finite Model Theory and Finite Variable Logics.Eric Barry Rosen - 1995 - Dissertation, University of Pennsylvania
Computational model theory: an overview.M. Vardi - 1998 - Logic Journal of the IGPL 6 (4):601-624.
Modal and guarded characterisation theorems over finite transition systems.Martin Otto - 2004 - Annals of Pure and Applied Logic 130 (1-3):173-205.
Forbidden Induced Subgraphs and the Łoś–Tarski Theorem.Yijia Chen & Jörg Flum - 2024 - Journal of Symbolic Logic 89 (2):516-548.

Analytics

Added to PP
2009-01-28

Downloads
62 (#90,018)

6 months
14 (#987,135)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Cham, Switzerland: Springer International Publishing. pp. 289-337.
Johan van Benthem on Logic and Information Dynamics.Alexandru Baltag & Sonja Smets (eds.) - 2014 - Cham, Switzerland: Springer International Publishing.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Finite partially-ordered quantification.Wilbur John Walkoe Jr - 1970 - Journal of Symbolic Logic 35 (4):535-555.
ℵ0-Categorical, ℵ0-stable structures.G. Cherlin, L. Harrington & A. H. Lachlan - 1985 - Annals of Pure and Applied Logic 28 (2):103-135.
Modal Logic and Classical Logic.R. A. Bull - 1987 - Journal of Symbolic Logic 52 (2):557-558.

View all 26 references / Add more references