This comprehensive overview ofmathematical logic is designedprimarily for advanced undergraduatesand graduate studentsof mathematics. The treatmentalso contains much of interest toadvanced students in computerscience and philosophy. Topics include propositional logic;first-order languages and logic; incompleteness, undecidability,and indefinability; recursive functions; computability;and Hilbert’s Tenth Problem.Reprint of the PWS Publishing Company, Boston, 1995edition.

In case you are considering to adopt this book for courses with over 50 students, please contact ties.nijssen@springer.com for more information. This introduction to mathematical logic starts with propositional calculus and first-order logic. Topics covered include syntax, semantics, soundness, completeness, independence, normal forms, vertical paths through negation normal formulas, compactness, Smullyan's Unifying Principle, natural deduction, cut-elimination, semantic tableaux, Skolemization, Herbrand's Theorem, unification, duality, interpolation, and definability. The last three chapters of the book provide an introduction to type theory (higher-order logic). It is shown how various mathematical concepts can be formalized in this very expressive formal language. This expressive notation facilitates proofs of the classical incompleteness and undecidability theorems which are very elegant and easy to understand. The discussion of semantics makes clear the important distinction between standard and nonstandard models which is so important in understanding puzzling phenomena such as the incompleteness theorems and Skolem's Paradox about countable models of set theory. Some of the numerous exercises require giving formal proofs. A computer program called ETPS which is available from the web facilitates doing and checking such exercises. Audience: This volume will be of interest to mathematicians, computer scientists, and philosophers in universities, as well as to computer scientists in industry who wish to use higher-order logic for hardware and software specification and verification.

The new edition of this classic textbook, Introduction to Mathematical Logic, Sixth Edition explores the principal topics of mathematical logic. It covers propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability. The text also discusses the major results of Godel, Church, Kleene, Rosse

This book grew out of lectures. It is intended as an introduction to classical two-valued predicate logic. The restriction to classical logic is not meant to imply that this logic is intrinsically better than other, non-classical logics; however, classical logic is a good introduction to logic because of its simplicity, and a good basis for applications because it is the foundation of classical mathematics, and thus of the exact sciences which are based on it. The book is meant primarily for mathematics students who are already acquainted with some of the fundamental concepts of mathematics, such as that of a group. It should help the reader to see for himself the advantages of a formalisation. The step from the everyday language to a formalised language, which usually creates difficulties, is dis cussed and practised thoroughly. The analysis of the way in which basic mathematical structures are approached in mathematics leads in a natural way to the semantic notion of consequence. One of the substantial achievements of modern logic has been to show that the notion of consequence can be replaced by a provably equivalent notion of derivability which is defined by means of a calculus. Today we know of many calculi which have this property.

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.

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 book provides an introduction to mathematical logic and the foundations of mathematics. It will help prepare students for advanced study in set theory and mathematical logic as well as other areas of mathematics, such as analysis, topology, and algebra. The presentation of finite state and Turing machines leads to the Halting Problem and Gödel's Incompleteness Theorem, which have broad academic interest, particularly in computer science and philosophy.

A comprehensive and user-friendly guide to the use of logic in mathematical reasoning Mathematical Logic presents a comprehensive introduction to formal methods of logic and their use as a reliable tool for deductive reasoning. With its user-friendly approach, this book successfully equips readers with the key concepts and methods for formulating valid mathematical arguments that can be used to uncover truths across diverse areas of study such as mathematics, computer science, and philosophy. The book develops the logical tools for writing proofs by guiding readers through both the established "Hilbert" style of proof writing, as well as the "equational" style that is emerging in computer science and engineering applications. Chapters have been organized into the two topical areas of Boolean logic and predicate logic. Techniques situated outside formal logic are applied to illustrate and demonstrate significant facts regarding the power and limitations of logic, such as: Logic can certify truths and only truths. Logic can certify all absolute truths (completeness theorems of Post and Gödel). Logic cannot certify all "conditional" truths, such as those that are specific to the Peano arithmetic. Therefore, logic has some serious limitations, as shown through Gödel's incompleteness theorem. Numerous examples and problem sets are provided throughout the text, further facilitating readers' understanding of the capabilities of logic to discover mathematical truths. In addition, an extensive appendix introduces Tarski semantics and proceeds with detailed proofs of completeness and first incompleteness theorems, while also providing a self-contained introduction to the theory of computability. With its thorough scope of coverage and accessible style, Mathematical Logic is an ideal book for courses in mathematics, computer science, and philosophy at the upper-undergraduate and graduate levels. It is also a valuable reference for researchers and practitioners who wish to learn how to use logic in their everyday work.

This lucid, non-intimidating presentation by a Russian scholar explores propositional logic, propositional calculus, and predicate logic. Topics include computer science and systems analysis, linguistics, and problems in the foundations of mathematics. Accessible to high school students, it also constitutes a valuable review of fundamentals for professionals. 1970 edition.

This book provides a distinctive, well-motivated introduction to mathematical logic. It starts with the definition of first order languages, proceeds through propositional logic, completeness theorems, and finally the two Incompleteness Theorems of Godel.