The Deductive Foundations of Computer Programming / Edition 1

Paperback (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 96%)
Other sellers (Paperback)
  • All (11) from $1.99   
  • New (6) from $34.95   
  • Used (5) from $1.99   


Logic plays a fundamental role in computer science analogous to that played by calculus in physics and traditional engineering. In software engineering, systems with the ability to perform logical deduction are being applied to the synthesis, verification and transformation of computer programs. In artificial intelligence, such systems are applied to the understanding of natural language and the formation of commonsense and robotic plans. Expert systems, deductive databases, and logic-programming systems may be regarded as rudimentary applications of this new deductive technology.

This book provides a carefully paced introduction to the logical underpinnings of these applications. Exceptionally clear and laced with examples, this book requires no prior knowledge of logic or programming. It interleaves a basic treatment of logic with a discussion of its application in automated deduction. This work provides most readable introduction to the logical concepts and techniques underlying computer programming.


Read More Show Less

Editorial Reviews

In software engineering, systems with the ability to perform logical deduction are being applied to the synthesis, verification, and transformation of computer programs. In artificial intelligence, such systems are applied to the understanding of natural language and the formation of commonsense and robotic plans. The authors provide an introduction the logical underpinnings of these applications. Requires no prior knowledge of logic or programming and contains many examples and problems. Annotation c. Book News, Inc., Portland, OR (
Read More Show Less

Product Details

  • ISBN-13: 9780201548860
  • Publisher: Addison-Wesley
  • Publication date: 3/28/1993
  • Series: Computer Science Series
  • Edition description: ABR
  • Edition number: 1
  • Pages: 736
  • Product dimensions: 6.22 (w) x 9.05 (h) x 1.57 (d)

Table of Contents

Propositional Logic.


Deductive Tableaux.

Predicate Logic.


The Language.

The Meaning of a Sentence.

Semantic Rules.


Universal and Existential Closure.

Valid Sentence Schemata.


Safe Substitution.

Valid Schemata with Substitution.


Force of Quantifiers.

Quantifier Removal: Intuitive Preview.

Removing Both Forces.

Removing Strict Universal Force.

Removing Strict Existential Force.

Summary of the Skolemization Process.


Deductive Tableaux: Notification and Meaning.

Basic Properties.

The Deductive Process.

Rewriting Rule.

Splitting Rules.

Resolution Rule.

Equivalence Rule.

Quantifier-Elimination Rules.

Examples of Complete Proofs.

Special Theories.

Definition of a Theory.

Augmenting Theories.

Theory of Strict Partial Orderings.

Theory of Equivalence Relations.

Theory of Equality.

Theory of Weak Partial Orderings.

Theory of Groups.

Theory of Pairs.

Relativized Quantifiers.

Finite Theories.

Equality Rule.

Finite Theories with Equality.

Theories With Induction.

Basic Properties.

The Addition Function.

Multiplication and Exponentiation.

Predecessor and Subtraction.

The Less-than Relation.

The Complete Induction Principle.

Quotient and Remainder.

Proof of Complete Induction.

The Divides Relation.

The Least-Number Principle.

The Theory.

Basic Functions and Relations.

The Decomposition Induction Principle.

The Reverse Function.

The Subtuple Relation.

The Complete Induction Principle.

Nonnegative Integers and Tuples.

The Permutation Relation.

The Ordered Relation.

The Sorting Function.


Basic Properties.

The Left and Right Function.

The Subtree Relation.

Tuples and Trees.

The Nonnegative Integers.

The Tuples.

The Trees.

Well-Founded Induction.

Well-Founded Relations.

The Well-Founded Induction Principle.

Use of a Well-Founded Induction.

Lexicographic Relations.

Use of Lexicographic Induction.

The Well-Founded Induction Rule.

Well-Founded Induction Over Pairs.

Deduction Procedures.

Proposition Logic.

Predicate Logic.

Special Theories. 0201548860T04062001

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)