"This book is intended for readers who, while mature mathematically, have no knowledge of mathematical logic. We attempt to introduce the reader to the most important approaches to the subject, and, wherever possible within the limitations of space which we have set for ourselves, to give at least a few nontrivial results illustrating each of the important methods for attacking logical problems"--Preface.

An exciting look at the world of elementary mathematics Elements of Mathematics takes readers on a fascinating tour that begins in elementary mathematics--but, as John Stillwell shows, this subject is not as elementary or straightforward as one might think. Not all topics that are part of today's elementary mathematics were always considered as such, and great mathematical advances and discoveries had to occur in order for certain subjects to become "elementary." Stillwell examines elementary mathematics from a distinctive twenty-first-century viewpoint and describes not only the beauty and scope of the discipline, but also its limits. From Gaussian integers to propositional logic, Stillwell delves into arithmetic, computation, algebra, geometry, calculus, combinatorics, probability, and logic. He discusses how each area ties into more advanced topics to build mathematics as a whole. Through a rich collection of basic principles, vivid examples, and interesting problems, Stillwell demonstrates that elementary mathematics becomes advanced with the intervention of infinity. Infinity has been observed throughout mathematical history, but the recent development of "reverse mathematics" confirms that infinity is essential for proving well-known theorems, and helps to determine the nature, contours, and borders of elementary mathematics. Elements of Mathematics gives readers, from high school students to professional mathematicians, the highlights of elementary mathematics and glimpses of the parts of math beyond its boundaries.

In mathematics we are interested in why a particular formula is true. Intuition and statistical evidence are insufficient, so we need to construct a formal logical proof. The purpose of this book is to describe why such proofs are important, what they are made of, how to recognize valid ones, how to distinguish different kinds, and how to construct them. This book is written for 1st year students with no previous experience of formulating proofs. Dave Johnson has drawn from his considerable experience to provide a text that concentrates on the most important elements of the subject using clear, simple explanations that require no background knowledge of logic. It gives many useful examples and problems, many with fully-worked solutions at the end of the book. In addition to a comprehensive index, there is also a useful `Dramatis Personae` an index to the many symbols introduced in the text, most of which will be new to students and which will be used throughout their degree programme.

This book, presented in two parts, offers a slow introduction to mathematical logic, and several basic concepts of model theory, such as first-order definability, types, symmetries, and elementary extensions. Its first part, Logic Sets, and Numbers, shows how mathematical logic is used to develop the number structures of classical mathematics. The exposition does not assume any prerequisites; it is rigorous, but as informal as possible. All necessary concepts are introduced exactly as they would be in a course in mathematical logic; but are accompanied by more extensive introductory remarks and examples to motivate formal developments. The second part, Relations, Structures, Geometry, introduces several basic concepts of model theory, such as first-order definability, types, symmetries, and elementary extensions, and shows how they are used to study and classify mathematical structures. Although more advanced, this second part is accessible to the reader who is either already familiar with basic mathematical logic, or has carefully read the first part of the book. Classical developments in model theory, including the Compactness Theorem and its uses, are discussed. Other topics include tameness, minimality, and order minimality of structures. The book can be used as an introduction to model theory, but unlike standard texts, it does not require familiarity with abstract algebra. This book will also be of interest to mathematicians who know the technical aspects of the subject, but are not familiar with its history and philosophical background.

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.

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.

This introductory graduate text covers modern mathematical logic from propositional, first-order and infinitary logic and Gödel's Incompleteness Theorems to extensive introductions to set theory, model theory and recursion (computability) theory. Based on the author's more than 35 years of teaching experience, the book develops students' intuition by presenting complex ideas in the simplest context for which they make sense. The book is appropriate for use as a classroom text, for self-study, and as a reference on the state of modern logic.

At the intersection of mathematics, computer science, and philosophy, mathematical logic examines the power and limitations of formal mathematical thinking. In this expansion of Leary's user-friendly 1st edition, readers with no previous study in the field are introduced to the basics of model theory, proof theory, and computability theory. The text is designed to be used either in an upper division undergraduate classroom, or for self study. Updating the 1st Edition's treatment of languages, structures, and deductions, leading to rigorous proofs of Gödel's First and Second Incompleteness Theorems, the expanded 2nd Edition includes a new introduction to incompleteness through computability as well as solutions to selected exercises.