Mathematical Logic for Computer ScienceMathematical 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 The third edition has been entirely rewritten and includes new chapters on central topics of modern computer science: SAT solvers and model checking. |
Contents
| 1 | |
| 7 | |
Propositional Logic Deductive Systems | 49 |
Propositional Logic Resolution | 74 |
Propositional Logic Binary Decision Diagrams | 95 |
Propositional Logic SAT Solvers | 111 |
FirstOrder Logic Formulas Models Tableaux | 130 |
FirstOrder Logic Deductive Systems | 155 |
FirstOrder Logic Undecidability and Model Theory | 223 |
Temporal Logic Formulas Models Tableaux | 231 |
Temporal Logic A Deductive System | 263 |
Verification of Sequential Programs | 273 |
Verification of Concurrent Programs | 297 |
Set Theory | 326 |
| 337 | |
| 339 | |
FirstOrder Logic Terms and Normal Forms | 167 |
FirstOrder Logic Resolution | 185 |
FirstOrder Logic Logic Programming | 204 |