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.
Author(s): Mordechai Ben-Ari (auth.)
Edition: 3
Publisher: Springer-Verlag London
Year: 2012
Language: English
Pages: 346
Tags: Mathematical Logic and Formal Languages; Mathematical Logic and Foundations
Front Matter....Pages I-XV
Introduction....Pages 1-6
Propositional Logic: Formulas, Models, Tableaux....Pages 7-47
Propositional Logic: Deductive Systems....Pages 49-73
Propositional Logic: Resolution....Pages 75-93
Propositional Logic: Binary Decision Diagrams....Pages 95-110
Propositional Logic: SAT Solvers....Pages 111-129
First-Order Logic: Formulas, Models, Tableaux....Pages 131-154
First-Order Logic: Deductive Systems....Pages 155-166
First-Order Logic: Terms and Normal Forms....Pages 167-183
First-Order Logic: Resolution....Pages 185-203
First-Order Logic: Logic Programming....Pages 205-222
First-Order Logic: Undecidability and Model Theory *....Pages 223-230
Temporal Logic: Formulas, Models, Tableaux....Pages 231-262
Temporal Logic: A Deductive System....Pages 263-272
Verification of Sequential Programs....Pages 273-295
Verification of Concurrent Programs....Pages 297-325
Back Matter....Pages 327-346
