The Nile on eBay FREE SHIPPING UK WIDE Mathematical Logic for Computer Science by Mordechai Ben-Ari
This book approaches mathematics based on the needs of computer science students, teaching logic by means of the method of semantic tableaux. The third edition is entirely rewritten, and includes new chapters on SAT solvers and model checking.
FORMATPaperback LANGUAGEEnglish CONDITIONBrand New Publisher Description
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 logicfor 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.
Notes
Semantic tableaux are used because they are theoretically sound and easy to understand The Third Edition has new chapters on SAT solvers and model checking Supplementary materials: Prolog source code for the algorithms and answers to the exercises (available to qualified instructors)
Back Cover
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. There are 150 exercises with answers available to qualified instructors. Documented, open-source, Prolog source code for the algorithms is available at Mordechai (Moti) Ben-Ari is with the Department of Science Teaching at the Weizmann Institute of Science. He is a Distinguished Educator of the ACM and has received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education. His other textbooks published by Springer are: Ada for Software Engineers (Second Edition) and Principles of the Spin Model Checker.
Author Biography
Mordechai (Moti) Ben-Ari is with the Department of Science Teaching at the Weizmann Institute of Science. He is a Distinguished Educator of the ACM and has received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education.
Table of Contents
Preface.- Introduction.- Propositional Logic: Formulas, Models, Tableaux.- Propositional Logic: Deductive Systems.- Propositional Logic: Resolution.- Propositional Logic: Binary Decision Diagrams.- Propositional Logic: SAT Solvers.- First-Order Logic: Formulas, Models, Tableaux.- First-Order Logic: Deductive Systems.- First-Order Logic: Terms and Normal Forms.- First-Order Logic: Resolution.- First-Order Logic: Logic Programming.- First-Order Logic: Undecidability and Model Theory.- Temporal Logic: Formulas, Models, Tableaux.- Temporal Logic: A Deductive System.- Verification of Sequential Programs.- Verification of Concurrent Programs.- Set Theory.- Index of Symbols.- Index of Names.- Subject Index.
Review
Asst. Prof. Manoj Raut, Dhirubhai Ambani Institute of Information and Communication Technology, IndiaExcerpts from full review posted Jan 15 2013 to Computing Reviews [Review #: CR140831]I have used the second edition of this book for my class. I find this new third edition more interesting and more elaborately written; I like it very much, and applaud the author for his work.
Review Quote
Asst. Prof. Manoj Raut, Dhirubhai Ambani Institute of Information and Communication Technology, IndiaExcerpts from full review posted Jan 15 2013 to Computing Reviews [Review #: CR140831]I have used the second edition of this book for my class. I find this new third edition more interesting and more elaborately written; I like it very much, and applaud the author for his work.
Feature
Semantic tableaux are used because they are theoretically sound and easy to understand The Third Edition has new chapters on SAT solvers and model checking Supplementary materials: Prolog source code for the algorithms and answers to the exercises (available to qualified instructors)
Details ISBN1447141288 Year 2012 ISBN-10 1447141288 ISBN-13 9781447141280 Media Book Short Title MATHEMATICAL LOGIC FOR COMPUTE Language English Edition 3rd Imprint Springer London Ltd Place of Publication England Country of Publication United Kingdom DEWEY 004.015113 Replaces 9781852333195 Pages 346 Illustrations 79 Illustrations, black and white; XV, 346 p. 79 illus. Format Paperback DOI 10.1007/978-1-4471-4129-7 UK Release Date 2012-06-17 AU Release Date 2012-06-17 NZ Release Date 2012-06-17 Publication Date 2012-06-17 Author Mordechai Ben-Ari Publisher Springer London Ltd Edition Description 3rd ed. 2012 Audience Postgraduate, Research & Scholarly We've got this
At The Nile, if you're looking for it, we've got it.With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love!
30 DAY RETURN POLICY
No questions asked, 30 day returns!
FREE DELIVERY
No matter where you are in the UK, delivery is free.
SECURE PAYMENT
Peace of mind by paying through PayPal and eBay Buyer Protection TheNile_Item_ID:137844740;