Introduction to Mathematical Logic, Fourth Edition

Rating:
Summary: Outstanding Organization and Clear Style
Review: I was sufficiently fortunate to have taken Professor Emeritus Mendelson's famous logic course at Queens College, the City University of New York, just two semesters before his retirement. I was, and continue to be, astonished by Dr. Mendelson's precise yet easy style, and the beautifully efficient organization of the subjects. Everything from the expository prose to the system of notational conventions has been carefully thought through so as to make the book both very substantive and very readable. In my opinion, it's the best introduction to serious mathematical logic currently on the market, and thanks to the genius of its author, it is likely to remain so for a long time. The buyer will not be disappointed.

Rating:
Summary: My first reference in logic
Review: In my work as a math teacher, researcher, author and journal editor, I often encounter problems with a logical component. When that need arises, my first choice of reference is always this book. It is the most concise and readable introductory text I have ever encountered and it is a rare occasion when I fail to find the background material needed to solve the problem. It is also an excellent source of problems and I have pulled the ideas for many test questions from it over the years. Those problems have appeared on tests in both mathematics and computer science.
The topics are fairly standard, starting with the propositional calculus and covering quantification theory, formal number theory, axiomatic set theory and computability. What differentiates this book is the clarity of the description, making it ideal for an introductory course for undergraduates. Solutions to some of the problems are given in an appendix.
Logic is a fundamental component of mathematics and all mathematicians need some exposure to it. It is also a critical part of computer programming, as many sections of programs can be directly deconstructed into logical statements. Workers in both areas will find this book of enormous value.

Rating:
Summary: A Classic Textbook Now In Its Fourth Edition
Review: Nearly forty years after it was published (1964), Elliot Mendelson's Introduction To Mathematical Logic still remains the best textbook on the principal topics of this subject. Although the book does not presuppose any background in the subject or in any particular branch of mathematics, the reader should have some degree of "mathematical sophistication."

The first chapter starts with truth tables and ends with a completeness proof of a given formal system for propositional logic and an independence proof of the axioms of this system. Chapter Two is the study of quantification theory. Topics include quantificational completeness, Hilbert's Second Epsilon-Theorem, various topics from model theory, such as compactness and Lowenheim-Skolem Theorems, theorems on submodels and ultrafilters and non-standard analysis. The new fourth edition adds a very nice section on interpretations of quantification theory that allow the empty domain. Chapter Three presents an axiom system for number theory, recursive functions and proves (among other theorems) the famous Godel Incompleteness theorems, Tarski's indefinability of Truth Theorem and Church's Undecidability Theorem. Chapter Four is devoted to elementary set theory. Topics include an axiom system for set theory, ordinal and cardinal numbers, the axiom of choice and regularity, and alternative axiom systems of set theory. The new fourth edition includes an axiom system with urelements, something rarely presented, and an interesting note on the historical application of such a system in the construction of the first independence proof of the axiom of choice. The fifth chapter is the study of computability. The chapter begins with the notion of an algorithm and Turing Machines and builds up to the Kleene-Mostowski Hierarchy. The new fourth edition concludes with an excellent appendix on second-order logic.

I have used Mendelson's book to teach a one-semester course to advanced undergraduate and graduate students with great success. Such a course is centered on the first three chapters, omitting from Chapter Two anything beyond quantificational completeness. If time permits, I recommend either the rest of Chapter Two, the beginning of Chapter Five, or the appendix on second-order logic. Set theory, the content of Chapter Three, is usually offered as a separate course.

Rating:
Summary: A Classic Textbook Now In Its Fourth Edition
Review: Nearly forty years after it was published (1964), Elliot Mendelson's Introduction To Mathematical Logic still remains the best textbook on the principal topics of this subject. Although the book does not presuppose any background in the subject or in any particular branch of mathematics, the reader should have some degree of "mathematical sophistication."

The first chapter starts with truth tables and ends with a completeness proof of a given formal system for propositional logic and an independence proof of the axioms of this system. Chapter Two is the study of quantification theory. Topics include quantificational completeness, Hilbert's Second Epsilon-Theorem, various topics from model theory, such as compactness and Lowenheim-Skolem Theorems, theorems on submodels and ultrafilters and non-standard analysis. The new fourth edition adds a very nice section on interpretations of quantification theory that allow the empty domain. Chapter Three presents an axiom system for number theory, recursive functions and proves (among other theorems) the famous Godel Incompleteness theorems, Tarski's indefinability of Truth Theorem and Church's Undecidability Theorem. Chapter Four is devoted to elementary set theory. Topics include an axiom system for set theory, ordinal and cardinal numbers, the axiom of choice and regularity, and alternative axiom systems of set theory. The new fourth edition includes an axiom system with urelements, something rarely presented, and an interesting note on the historical application of such a system in the construction of the first independence proof of the axiom of choice. The fifth chapter is the study of computability. The chapter begins with the notion of an algorithm and Turing Machines and builds up to the Kleene-Mostowski Hierarchy. The new fourth edition concludes with an excellent appendix on second-order logic.

I have used Mendelson's book to teach a one-semester course to advanced undergraduate and graduate students with great success. Such a course is centered on the first three chapters, omitting from Chapter Two anything beyond quantificational completeness. If time permits, I recommend either the rest of Chapter Two, the beginning of Chapter Five, or the appendix on second-order logic. Set theory, the content of Chapter Three, is usually offered as a separate course.

Rating:
Summary: Great Book on Logic and Meta-theory
Review: This book has come in handy. Although it is a bit difficult, it is, relative to other books on mathematical logic, very accessible. (The learning of logic always takes dedicated time!). The introduction has a summary of certain set-theoretic notions, etc., and the book covers First-Order propositional calculus and Quantifier-predicate calculus, as well as Second-Order logic, and a good deal of Meta-theory to show completeness and soundness, etc. I used this book as a side-reference studies and it helped significantly.

Rating:
Summary: A classic of math logic, sans philosophy
Review: This book is a bit of an elegy to a dying world: the math logic of the 20th century.
It does not cover any nonclassical or philosophical logic, directions heavily researched in recent decades. Algebraic logic is slighted, even though Mendelson was an authority on Boolean algebra. Nor does he do justice to the model theoretic perspective, although the treatment of the Tarski semantics for first order logic in chpt. 2 is a bit of a classic. The treatment of recursion in chpts. 3 and 5 are thorough. The set theory of chpt. 4 is a bit unconventional (NBG rather than ZF) but is well exposited. My overall complaint is the crabbed notation, altho he's come a long way since the first edition. The book also cries out for a more graceful English style and page layout. Here Machover (1996) stands out.
Mendelson's bibliography is wonderfully long and rich. Finally, this text contains perhaps the gentlest extant introduction to second order logic.