Synopsis
This book provides an elementary "hands-on" presentation of important mathematical logic topics.
Explores topics that are at the cutting edge of developments in computer science, while preserving the integrity of traditional logic. Stresses several self-contained proof systems of interest to mathematical logic, some more suitable than others for particular kinds of questions.
For anyone interested in Computer Science or Mathematics.
Booknews
Elementary logic is presented alongside its algorithmic aspects, i.e., the syntax and semantics of first-order logic up to completeness and compactness, and developments in theorem proving that were inspired by the possibilities of using computers. Topics include Aristotle's syllogisms; Boole's work on the algebra of logic; propositional logic; PC, a Frege-Hilbert style proof system; a resolution version of propositional logic; equational logic; resolution theorem proving for predicate clause logic; traditional first-order logic; G<:o>del's completeness theorem. No background in abstract algebra or analysis is assumed. Annotation c. by Book News, Inc., Portland, Or.