Library of Math
New and Used Math Books at Great Low Prices
Subscribe to the Library of Math Feed

The Deductive Foundations of Computer Programming

The Deductive Foundations of Computer Programming

enlarge enlarge 
Authors: Zohar Manna, Richard Waldinger
Publisher: Addison-Wesley Professional
Category: Book

List Price: $59.99
Buy Used: $13.45
You Save: $46.54 (78%)



New (11) Used (21) from $13.45

Rating: 5.0 out of 5 stars 2 reviews
Sales Rank: 844866

Media: Paperback
Pages: 736
Number Of Items: 1
Shipping Weight (lbs): 2.4
Dimensions (in): 9.3 x 6 x 1.6

ISBN: 0201548860
Dewey Decimal Number: 519.7
UPC: 785342548860
EAN: 9780201548860

Publication Date: March 10, 1993
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Shipping: International shipping available
Condition: Standard used condition.

Similar Items:

  • The Design and Implementation of the FreeBSD Operating System
  • Introduction to Algorithms
  • The C++ Programming Language: Special Edition (3rd Edition)
  • Embedded System Design: A Unified Hardware/Software Introduction
  • Pro C# 2008 and the .NET 3.5 Platform, Fourth Edition (Windows.Net)

Customer Reviews:

5 out of 5 stars Excellent Textbook for a First Logic Course in CS   May 5, 2000
6 out of 6 found this review helpful

I really liked this book. It is full of examples, and the explanations are clear and concise. The book guides you through predicate logic and first order logic and procedures for automated deductive systems for them. No previous knowledge is assumed. The book is also full of exercises and problems.

I do recommend this book for students of Computer Science and Mathematics who want to start learning about automated deductive systems and axiomatic theories.


5 out of 5 stars A Good Start Toward Automated Reasoning   July 8, 2000
S. Wuest (Tucson, AZ United States)
6 out of 6 found this review helpful

This book is a good introductory catalog of automated reasoning concepts and methods. But I believe that programmers who are going to write automated reasoning systems should augment their computer knowledge (of logic) by learning a full- blown (serial, not tree) logical notation for both 1st and 2nd order predicate calculus.

Solving the inference problem is NP-Complete, and computational cycles explode as the number of premisses increase. Automated methods of solving the inference problem are often O(n^2) and often infeasible, for "real-world" problems. Most programmers don't have a broad enough horizon in formal logic to quickly recognize WHEN a certain automated technique will be useful.

I suggest a symbolic logic text such as Copi's Symbolic Logic, 5th ed., and then aggressively read about optimizing methods which are currently being developed (ex. Optimization Methods for Logical Inference, Chandru et alia).

However, as an introduction, the reviewed book is excellent.

 
about us contact us privacy policy terms of use mision statement lom help
The Library of Math - Online Math Organized by Subject Into Topics. © 2005 - 2008 www.LibraryOfMath.com All rights reserved. math rss