Model Theory

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. This book will benefit graduate students with an interest in model theory.

Model theory begins with an audacious idea: to consider statements about mathematical structures as mathematical objects of study in their own right. While inherently important as a tool of mathematical logic, it also enjoys connections to and applications in diverse branches of mathematics, including algebra, number theory and analysis. Despite this, traditional introductions to model theory assume a graduate-level background of the reader. In this innovative textbook, Jonathan Kirby brings model theory to an undergraduate audience. The highlights of basic model theory are illustrated through examples from specific structures familiar from undergraduate mathematics, paying particular attention to definable sets throughout. With numerous exercises of varying difficulty, this is an accessible introduction to model theory and its place in mathematics.

Assumes only a familiarity with algebra at the beginning graduate level; Stresses applications to algebra; Illustrates several of the ways Model Theory can be a useful tool in analyzing classical mathematical structures

Recounts the modern transformation of model theory and its effects on the philosophy of mathematics and mathematical practice.

Translated from the French, this book is an introduction to first-order model theory. Starting from scratch, it quickly reaches the essentials, namely, the back-and-forth method and compactness, which are illustrated with examples taken from algebra. It also introduces logic via the study of the models of arithmetic, and it gives complete but accessible exposition of stability theory.

Emphasizes the computer science aspects of the subject. Details applications in databases, complexity theory, and formal languages, as well as other branches of computer science.

Concise introduction to current topics in model theory, including simple and stable theories.

In this research monograph, the author's work on classification and related topics are presented. This revised edition brings the book up to date with the addition of four new chapters as well as various corrections to the 1978 text. The additional chapters X - XIII present the solution to countable first order T of what the author sees as the main test of the theory. In Chapter X the Dimensional Order Property is introduced and it is shown to be a meaningful dividing line for superstable theories. In Chapter XI there is a proof of the decomposition theorems. Chapter XII is the crux of the matter: there is proof that the negation of the assumption used in Chapter XI implies that in models of T a relation can be defined which orders a large subset of m

This is a thoroughly revised and enlarged second edition that presents the main results of descriptive complexity theory, that is, the connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. The logics that are important in this context include fixed-point logics, transitive closure logics, and also certain infinitary languages; their model theory is studied in full detail. The book is written in such a way that the respective parts on model theory and descriptive complexity theory may be read independently.