BOOK
Logic for Mathematics and Computer Science
Logic for Mathematics and Computer Science by Stanley N. Burris aims to offer a balanced, hands‑on introduction to mathematical logic tailored for students in mathematics and computer science. The text covers both traditional topics and algorithmic methods, making logic relevant and practical. It begins with Aristotle’s syllogisms and Boole’s algebra of logic, progresses through propositional and equational logics, and reaches predicate logic and Gödel’s completeness theorem. A notable feature is its emphasis on automated reasoning techniques—such as resolution theorem proving and the Knuth–Bendix procedure—alongside formal proofs of soundness and completeness. The book includes interactive logic programs, extensive examples, and exercises, serving as a bridge between theoretical foundations and computational applications.
No other version available