Mathematical Logic for Computer Science

Mordechai Ben-Ari

304 pages, parution le 10/03/2003 (2^eme édition)

Ajouter à une liste

Indisponible

Résumé

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 as well as Prolog source code for algorithms may be found via the Springer London web site: http://www.springer.co.uk/com pubs/ct mlcs.htm
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.

L'auteur - Mordechai Ben-Ari

Mordechai Ben-Ari is Associate Professor at the Department of Science Teaching of the Weizmann Institute of Science. He has published textbooks on concurrent programming and programming languages.

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Mordechai Ben-Ari
Parution	10/03/2003
Édition	2^eme édition
Nb. de pages	304
Format	15,5 x 23,5
Couverture	Broché
Poids	370g
Intérieur	Noir et Blanc
EAN13	9781852333195
ISBN13	978-1-85233-319-5