This book is intended for mathematicians. Its origins lie in a course of lectures given by an algebraist to a class which had just completed a substantial course on abstract algebra. Consequently, our treatment of the subject is algebraic. Although we assume a reasonable level of sophistication in algebra, the text requires little more than the basic notions of group, ring, module, etc. A more detailed knowledge of algebra is required for some of the exercises. We also assume a familiarity with the main ideas of set theory, including cardinal numbers and Zorn's Lemma. In this book, we carry out a mathematical study of the logic used in mathematics. We do this by constructing a mathematical model of logic and applying mathematics to analyse the properties of the model. We therefore regard all our existing knowledge of mathematics as being applicable to the analysis of the model, and in particular we accept set theory as part of the meta-Ianguage. We are not attempting to construct a foundation on which all mathematics is to be based--rather, any conclusions to be drawn about the foundations of mathematics come only by analogy with the model, and are to be regarded in much the same way as the conclusions drawn from any scientific theory.

This introduction to first-order logic clearly works out the role of first-order logic in the foundations of mathematics, particularly the two basic questions of the range of the axiomatic method and of theorem-proving by machines. It covers several advanced topics not commonly treated in introductory texts, such as Fraïssé's characterization of elementary equivalence, Lindström's theorem on the maximality of first-order logic, and the fundamentals of logic programming.

Mathematical Logic and Model Theory: A Brief Introduction offers a streamlined yet easy-to-read introduction to mathematical logic and basic model theory. It presents, in a self-contained manner, the essential aspects of model theory needed to understand model theoretic algebra. As a profound application of model theory in algebra, the last part of this book develops a complete proof of Ax and Kochen's work on Artin's conjecture about Diophantine properties of p-adic number fields. The character of model theoretic constructions and results differ quite significantly from that commonly found in algebra, by the treatment of formulae as mathematical objects. It is therefore indispensable to first become familiar with the problems and methods of mathematical logic. Therefore, the text is divided into three parts: an introduction into mathematical logic (Chapter 1), model theory (Chapters 2 and 3), and the model theoretic treatment of several algebraic theories (Chapter 4). This book will be of interest to both advanced undergraduate and graduate students studying model theory and its applications to algebra. It may also be used for self-study.

Here is an introduction to modern logic that differs from others by treating logic from an algebraic perspective. What this means is that notions and results from logic become much easier to understand when seen from a familiar standpoint of algebra. The presentation, written in the engaging and provocative style that is the hallmark of Paul Halmos, from whose course the book is taken, is aimed at a broad audience, students, teachers and amateurs in mathematics, philosophy, computer science, linguistics and engineering; they all have to get to grips with logic at some stage. All that is needed.

This self-contained text covers sets and numbers, elements of set theory, real numbers, the theory of groups, group isomorphism and homomorphism, theory of rings, and polynomial rings. 1969 edition.

This is a compact mtroduction to some of the pnncipal tOpICS of mathematical logic . In the belief that beginners should be exposed to the most natural and easiest proofs, I have used free-swinging set-theoretic methods. The significance of a demand for constructive proofs can be evaluated only after a certain amount of experience with mathematical logic has been obtained. If we are to be expelled from "Cantor's paradise" (as nonconstructive set theory was called by Hilbert), at least we should know what we are missing. The major changes in this new edition are the following. (1) In Chapter 5, Effective Computability, Turing-computabIlity IS now the central notion, and diagrams (flow-charts) are used to construct Turing machines. There are also treatments of Markov algorithms, Herbrand-Godel-computability, register machines, and random access machines. Recursion theory is gone into a little more deeply, including the s-m-n theorem, the recursion theorem, and Rice's Theorem. (2) The proofs of the Incompleteness Theorems are now based upon the Diagonalization Lemma. Lob's Theorem and its connection with Godel's Second Theorem are also studied. (3) In Chapter 2, Quantification Theory, Henkin's proof of the completeness theorem has been postponed until the reader has gained more experience in proof techniques. The exposition of the proof itself has been improved by breaking it down into smaller pieces and using the notion of a scapegoat theory. There is also an entirely new section on semantic trees.

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.

Beginning with an introduction to the concepts of algebraic logic, this concise volume features ten articles by a prominent mathematician that originally appeared in journals from 1954 to 1959. Covering monadic and polyadic algebras, these articles are essentially self-contained and accessible to a general mathematical audience, requiring no specialized knowledge of algebra or logic. Part One addresses monadic algebras, with articles on general theory, representation, and freedom. Part Two explores polyadic algebras, progressing from general theory and terms to equality. Part Three offers three items on polyadic Boolean algebras, including a survey of predicates, terms, operations, and equality. The book concludes with an additional bibliography and index.

Written by a pioneer of mathematical logic, this comprehensive graduate-level text explores the constructive theory of first-order predicate calculus. It covers formal methods — including algorithms and epitheory — and offers a brief treatment of Markov's approach to algorithms. It also explains elementary facts about lattices and similar algebraic systems. 1963 edition.

Mathematical logic developed into a broad discipline with many applications in mathematics, informatics, linguistics and philosophy. This text introduces the fundamentals of this field, and this new edition has been thoroughly expanded and revised.