Items related to Mathematical Logic for Computer Scienceience
Synopsis
About the Book :- 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 computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. To provide a balanced treatment of logic, tableaux are related to deductive proof systems. The logical systems presented are: - Propositional calculus (including binary decision diagrams); - Predicate calculus; - Resolution; - Hoare logic; - Z; - Temporal logic. Contents :- Preface. - Introduction.- Propositional Calculus: Formulas, Models, Tableaux.- Propositional Calculus: Deductive Systems.- Propositional Calculus: Resolution and BDDs.- Predicate Calculus: Formulas, Models, Tableau.- Predicate Calculus: Deductive Systems.- Predicate Calculus: Resolution.- Logic Programming.- Programs: Semantics and Verification.- Programs: Formal Specification with Z.- Temporal Logic: Formulas, Models, Tableaux.- Temporal Logic: Deduction and Applications.- Appendix: Set Theory; Further Reading; Bibliography; Index of Symbols; Index. About the Author :- Mordechai Ben-Ari is an associate professor in the Department of Science Teaching of the Weizmann Institute of Science. He is the author of numerous textbooks on concurrency, programming languages and logic, and has developed software tools for teaching concurrency. In 2004, Ben-Ari received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education.
"synopsis" may belong to another edition of this title.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want
