Normal view

# Mathematical logic for computer science [ Livre] / Mordechai, Ben-Ari

Langue: Anglais ; de l'oeuvre originale, Anglais.Mention d'édition: 3 éditionPublication : Paris : Springer, 2012Description : 1 vol. (XV-346 p.) ; 24 cmISBN: 9781447141280.Classification: 004.16 Logique mathématiqueRé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 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..Sujet - Nom commun:
Current location Call number Status Notes Date due Barcode
ENS Rennes - Bibliothèque
Informatique
004.16 BEN (Browse shelf) Available 004.16 Logique mathématique 026505
ENS Rennes - Bibliothèque
Informatique
004.16 BEN (Browse shelf) Available 004.16 Logique mathématique 026506

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.