Clear, comprehensive, and rigorous treatment develops the subject from elementary concepts to the construction and analysis of relatively complex logical languages. Hundreds of problems, examples, and exercises. 1958 edition.

Famous classic has introduced countless readers to symbolic logic with its thorough and precise exposition. Starts with simple symbols and conventions and concludes with the Boole-Schroeder and Russell-Whitehead systems. No special knowledge of mathematics necessary. "One of the clearest and simplest introductions to a subject which is very much alive." — Mathematics Gazette.

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.

The Logic of Our Language teaches the practical and everyday application of formal logic. Rather than overwhelming the reader with abstract theory, Jackson and McLeod show how the skills developed through the practice of logic can help us to better understand our own language and reasoning processes. The authors’ goal is to draw attention to the patterns and logical structures inherent in our spoken and written language by teaching the reader how to translate English sentences into formal symbols. Other logical tools, including truth tables, truth trees, and natural deduction, are then introduced as techniques for examining the properties of symbolized sentences and assessing the validity of arguments. A substantial number of practice questions are offered both within the book itself and as interactive activities on a companion website.

This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.