Model theory is the meta-mathematical study of the concept of mathematical truth. After Afred Tarski coined the term Theory of Models in the early 1950’s, it rapidly became one of the central most active branches of mathematical logic. In the last few decades, ideas that originated within model theory have provided powerful tools to solve problems in a variety of areas of classical mathematics, including algebra, combinatorics, geometry, number theory, and Banach space theory and operator theory. The two volumes of Beyond First Order Model Theory present the reader with a fairly comprehensive vista, rich in width and depth, of some of the most active areas of contemporary research in model theory beyond the realm of the classical first-order viewpoint. Each chapter is intended to serve both as an introduction to a current direction in model theory and as a presentation of results that are not available elsewhere. All the articles are written so that they can be studied independently of one another. This second volume contains introductions to real-valued logic and applications, abstract elementary classes and applications, interconnections between model theory and function spaces, nonstucture theory, and model theory of second-order logic. Features A coherent introduction to current trends in model theory. Contains articles by some of the most influential logicians of the last hundred years. No other publication brings these distinguished authors together. Suitable as a reference for advanced undergraduate, postgraduates, and researchers. Material presented in the book (e.g, abstract elementary classes, first-order logics with dependent sorts, and applications of infinitary logics in set theory) is not easily accessible in the current literature. The various chapters in the book can be studied independently.

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.

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.

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.

This book presents an introduction to model theory in 15 lectures. It concentrates on several key concepts: first-order definability, classification of complete types, elementary extensions, categoricity, automorphisms, and saturation; all illustrated with examples that require neither advanced alegbra nor set theory. A full proof of the compactness theorem for countable languages and its applications are given, followed by a discussion of the Ehrefeucht-Mostowski technique for constructing models admitting automorphisms. Additional topics include recursive saturation, nonstandard models of arithmetic, Abraham Robinson's model-theoretic proof of Tarski's theorem on undefinability of truth, and the proof of the Infinite Ramsey Theorem using an elementary extension of the standard model of arithmetic.

Model theory investigates mathematical structures by means of formal languages. So-called first-order languages have proved particularly useful in this respect. This text introduces the model theory of first-order logic, avoiding syntactical issues not too relevant to model theory. In this spirit, the compactness theorem is proved via the algebraically useful ultrsproduct technique (rather than via the completeness theorem of first-order logic). This leads fairly quickly to algebraic applications, like Malcev's local theorems of group theory and, after a little more preparation, to Hilbert's Nullstellensatz of field theory. Steinitz dimension theory for field extensions is obtained as a special case of a much more general model-theoretic treatment of strongly minimal theories. There is a final chapter on the models of the first-order theory of the integers as an abelian group. Both these topics appear here for the first time in a textbook at the introductory level, and are used to give hints to further reading and to recent developments in the field, such as stability (or classification) theory.

This is part one of a two-volume book on real analysis and is intended for senior undergraduate students of mathematics who have already been exposed to calculus. The emphasis is on rigour and foundations of analysis. Beginning with the construction of the number systems and set theory, the book discusses the basics of analysis (limits, series, continuity, differentiation, Riemann integration), through to power series, several variable calculus and Fourier analysis, and then finally the Lebesgue integral. These are almost entirely set in the concrete setting of the real line and Euclidean spaces, although there is some material on abstract metric and topological spaces. The book also has appendices on mathematical logic and the decimal system. The entire text (omitting some less central topics) can be taught in two quarters of 25–30 lectures each. The course material is deeply intertwined with the exercises, as it is intended that the student actively learn the material (and practice thinking and writing rigorously) by proving several of the key results in the theory.