Semantic tableaux are used because they are theoretically sound and easy to understand
The Third Edition has new chapters on SAT solvers and model checking
Supplementary materials: Prolog source code for the algorithms and answers to the exercises (available to qualified instructors)
Semantic tableaux are used because they are theoretically sound and easy to understand
The Third Edition has new chapters on SAT solvers and model checking
Supplementary materials: Prolog source code for the algorithms and answers to the exercises (available to qualified instructors)
Includes supplementary material: sn.pub/extras
Includes supplementary material: sn.pub/extras
Request lecturer material: sn.pub/lecturer-material
Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of students of computer science. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and easy to understand. The uniform use of tableaux-based techniques facilitates learning advanced logical systems based on what the student has learned from elementary systems.
The logical systems presented are: propositional logic, first-order logic, resolution and its application to logic programming, Hoare logic for the verification of sequential programs, and linear temporal logic
for the verification of concurrent programs.
The third edition has been entirely rewritten and includes new chapters on central topics of modern computer science: SAT solvers and model checking.
Preface.- Introduction.- Propositional Logic: Formulas, Models, Tableaux.- Propositional Logic: Deductive Systems.- Propositional Logic: Resolution.- Propositional Logic: Binary Decision Diagrams.- Propositional Logic: SAT Solvers.- First-Order Logic: Formulas, Models, Tableaux.- First-Order Logic: Deductive Systems.- First-Order Logic: Terms and Normal Forms.- First-Order Logic: Resolution.- First-Order Logic: Logic Programming.- First-Order Logic: Undecidability and Model Theory.- Temporal Logic: Formulas, Models, Tableaux.- Temporal Logic: A Deductive System.- Verification of Sequential Programs.- Verification of Concurrent Programs.- Set Theory.- Index of Symbols.- Index of Names.- Subject Index.
Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of students of computer science. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and easy to understand. The uniform use of tableaux-based techniques facilitates learning advanced logical systems based on what the student has learned from elementary systems.
The logical systems presented are: propositional logic, first-order logic, resolution and its application to logic programming, Hoare logic for the verification of sequential programs, and linear temporal logic for the verification of concurrent programs.
The third edition has been entirely rewritten and includes new chapters on central topics of modern computer science: SAT solvers and model checking.
There are 150 exercises with answers available to qualified instructors.
Documented, open-source, Prolog source code for the algorithms is available at http://code.google.com/p/mlcs/
Mordechai (Moti) Ben-Ari is with the Department of Science Teaching at the Weizmann Institute of Science. He is a Distinguished Educator of the ACM and has received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education. His other textbooks published by Springer are: Ada for Software Engineers (Second Edition) and Principles of the Spin Model Checker.
Asst. Prof. Manoj Raut, Dhirubhai Ambani Institute of Information and Communication Technology, India
Excerpts from full review posted Jan 15 2013 to Computing Reviews [Review #: CR140831]
I have used the second edition of this book for my class. I find this new third edition more interesting and more elaborately written; I like it very much, and applaud the author for his work.
This book approaches mathematics based on the needs of computer science students, teaching logic by means of the method of semantic tableaux. The third edition is entirely rewritten, and includes new chapters on SAT solvers and model checking.
Mordechai (Moti) Ben-Ari is with the Department of Science Teaching at the Weizmann Institute of Science. He is a Distinguished Educator of the ACM and has received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education.
Über den Autor
Mordechai (Moti) Ben-Ari is with the Department of Science Teaching at the Weizmann Institute of Science. He is a Distinguished Educator of the ACM and has received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education.
Inhaltsverzeichnis
Preface.- Introduction.- Propositional Logic: Formulas, Models, Tableaux.- Propositional Logic: Deductive Systems.- Propositional Logic: Resolution.- Propositional Logic: Binary Decision Diagrams.- Propositional Logic: SAT Solvers.- First-Order Logic: Formulas, Models, Tableaux.- First-Order Logic: Deductive Systems.- First-Order Logic: Terms and Normal Forms.- First-Order Logic: Resolution.- First-Order Logic: Logic Programming.- First-Order Logic: Undecidability and Model Theory.- Temporal Logic: Formulas, Models, Tableaux.- Temporal Logic: A Deductive System.- Verification of Sequential Programs.- Verification of Concurrent Programs.- Set Theory.- Index of Symbols.- Index of Names.- Subject Index.
Klappentext
Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of students of computer science. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and easy to understand. The uniform use of tableaux-based techniques facilitates learning advanced logical systems based on what the student has learned from elementary systems.nThe logical systems presented are: propositional logic, first-order logic, resolution and its application to logic programming, Hoare logic for the verification of sequential programs, and linear temporal logicnfor the verification of concurrent programs.nThe third edition has been entirely rewritten and includes new chapters on central topics of modern computer science: SAT solvers and model checking.
Semantic tableaux are used because they are theoretically sound and easy to understand
The Third Edition has new chapters on SAT solvers and model checking
Supplementary materials: Prolog source code for the algorithms and answers to the exercises (available to qualified instructors)
Includes supplementary material: sn.pub/extras
Includes supplementary material: sn.pub/extras
Request lecturer material: sn.pub/lecturer-material
