<p><p><i>Mathematical Logic for Computer Science</i> 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
Mathematical Logic for Computer Science
โ Scribed by Mordechai Ben-Ari PhD (auth.)
- Publisher
- Springer London
- Year
- 2001
- Tongue
- English
- Leaves
- 310
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
Answers to exercises (for instructors only) as well as Prolog source code for algorithms may be found via the Springer London web site: http://www.springer.com/978-1-85233-319-5
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.
โฆ Table of Contents
Front Matter....Pages i-xiv
Introduction....Pages 1-7
Propositional Calculus: Formulas, Models, Tableaux....Pages 9-41
Propositional Calculus: Deductive Systems....Pages 43-65
Propositional Calculus: Resolution and BDDs....Pages 67-100
Predicate Calculus: Formulas, Models, Tableaux....Pages 101-126
Predicate Calculus: Deductive Systems....Pages 127-138
Predicate Calculus: Resolution....Pages 139-172
Logic Programming....Pages 173-200
Programs: Semantics and Verification....Pages 201-220
Programs: Formal specification with Z....Pages 221-234
Temporal Logic: Formulas, Models, Tableaux....Pages 235-256
Temporal Logic: Deduction and Applications....Pages 257-282
Back Matter....Pages 283-304
โฆ Subjects
Mathematical Logic and Formal Languages; Mathematical Logic and Foundations
๐ SIMILAR VOLUMES
<i>Mathematical Logic for Computer Science</i>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