This is an up-to-date textbook of model theory taking the reader from first definitions to Morley's theorem and the elementary parts of stability theory. Besides standard results such as the compactness and omitting types theorems, it also describes various links with algebra, including the Skolem-Tarski method of quantifier elimination, model completeness, automorphism groups and omega-categoricity, ultraproducts, O-minimality and structures of finite Morley rank. The material on back-and-forth equivalences, interpretations and zero-one laws can serve as an introduction to applications of model theory in computer science. Each chapter finishes with a brief commentary on the literature and suggestions for further reading.
1. Naming of parts; 2. Classifying structures; 3. Structures that look alike; 4. Interpretations; 5. The first order case: compactness; 6. The countable case; 7. The existential case; 8. Saturation; 9. Structure and categoricity.