Apress

Mathematical Logic for Computer Science

3rd Edition

By Mordechai Ben-Ari

Mathematical Logic for Computer Science Cover Image

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.

Full Description

  • ISBN13: 978-1-4471-4128-0
  • 361 Pages
  • User Level: Students
  • Publication Date: June 16, 2012
  • Available eBook Formats: PDF
  • eBook Price: $59.95
Buy eBook Buy Print Book Add to Wishlist
Full Description
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.
Table of Contents

Table of Contents

  1. Preface.
  2. Introduction.
  3. Propositional Logic: Formulas, Models, Tableaux.
  4. Propositional Logic: Deductive Systems.
  5. Propositional Logic: Resolution.
  6. Propositional Logic: Binary Decision Diagrams.
  7. Propositional Logic: SAT Solvers.
  8. First
  9. Order Logic: Formulas, Models, Tableaux.
  10. First
  11. Order Logic: Deductive Systems.
  12. First
  13. Order Logic: Terms and Normal Forms.
  14. First
  15. Order Logic: Resolution.
  16. First
  17. Order Logic: Logic Programming.
  18. First
  19. Order Logic: Undecidability and Model Theory.
  20. Temporal Logic: Formulas, Models, Tableaux.
  21. Temporal Logic: A Deductive System.
  22. Verification of Sequential Programs.
  23. Verification of Concurrent Programs.
  24. Set Theory.
  25. Index of Symbols.
  26. Index of Names.
  27. Subject Index.
Errata

If you think that you've found an error in this book, please let us know about it. You will find any confirmed erratum below, so you can check if your concern has already been addressed.

* Required Fields

No errata are currently published