This introduction to mathematical logic explores philosophical issues and Gödel's Theorem. Its widespread influence extends to the author of Gödel, Escher, Bach, whose Pulitzer Prize–winning book was inspired by this work.
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.
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.
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.
"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.
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.
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.
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 classic introduction to the main areas of mathematical logic provides the basis for a first graduate course in the subject. It embodies the viewpoint that mathematical logic is not a collection of vaguely related results, but a coherent method of attacking some of the most interesting problems, which face the mathematician. The author presents the basic concepts in an unusually clear and accessible fashion, concentrating on what he views as the central topics of mathematical logic: proof theory, model theory, recursion theory, axiomatic number theory, and set theory. There are many exercises, and they provide the outline of what amounts to a second book that goes into all topics in more depth. This book has played a role in the education of many mature and accomplished researchers.