Mathematical Logic for Computer Science

Beschreibung

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.

Gives a rigorous grounding in mathematical logic, using techniques that are appropriate for computer science students and less abstract than books for mathematics students

Content includes topics that are rarely used except in computer science (temporal logic, resolution) 

Applications for computer science are extensively discussed after the theory is presented

Autor*in

Mordechai Ben-Ari

Themen in »Mathematical Logic for Computer Science«

Boolean operator Resolution algorithms complexity formal specification logic mathematical logic set theory theorem proving

Stimmen zu »Mathematical Logic for Computer Science«

Details

Link teilen