Studies in Logic and the Foundations of Mathematics: The Theory of Models covers the proceedings of the International Symposium on the Theory of Models, held at the University of California, Berkeley on June 25 to July 11, 1963. The book focuses on works devoted to the foundations of mathematics, generally known as "the theory of models." The selection first discusses the method of alternating chains, semantic construction of Lewis's systems S4 and S5, and continuous model theory. Concerns include ordered model theory, 2-valued model theory, semantics, sequents, axiomatization, formulas, axiomatic approach to hierarchies, alternating chains, and difference hierarchies. The text also ponders on Boolean notions extended to higher dimensions, elementary theories with models without automorphisms, and applications of the notions of forcing and generic sets. The manuscript takes a look at a hypothesis concerning the extension of finite relations and its verification for certain special cases, theories of functors and models, model-theoretic methods in the study of elementary logic, and extensions of relational structures. The text also reviews relatively categorical and normal theories, algebraic theories, categories, and functors, denumerable models of theories with extra predicates, and non-standard models for fragments of number theory. The selection is highly recommended for mathematicians and researchers interested in the theory of models.

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

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.

Löwenheim's theorem reflects a critical point in the history of mathematical logic, for it marks the birth of model theory--that is, the part of logic that concerns the relationship between formal theories and their models. However, while the original proofs of other, comparably significant theorems are well understood, this is not the case with Löwenheim's theorem. For example, the very result that scholars attribute to Löwenheim today is not the one that Skolem--a logician raised in the algebraic tradition, like Löwenheim--appears to have attributed to him. In The Birth of Model Theory, Calixto Badesa provides both the first sustained, book-length analysis of Löwenheim's proof and a detailed description of the theoretical framework--and, in particular, of the algebraic tradition--that made the theorem possible. Badesa's three main conclusions amount to a completely new interpretation of the proof, one that sharply contradicts the core of modern scholarship on the topic. First, Löwenheim did not use an infinitary language to prove his theorem; second, the functional interpretation of Löwenheim's normal form is anachronistic, and inappropriate for reconstructing the proof; and third, Löwenheim did not aim to prove the theorem's weakest version but the stronger version Skolem attributed to him. This book will be of considerable interest to historians of logic, logicians, philosophers of logic, and philosophers of mathematics.

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 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.

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

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.

Leading experts survey the connections between model theory and semialgebraic, subanalytic, p-adic, rigid and diophantine geometry.