The Deductive Foundations of Computer Programming
Home > Computing and Information Technology > Computer science > The Deductive Foundations of Computer Programming
The Deductive Foundations of Computer Programming

The Deductive Foundations of Computer Programming


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Table of Contents:
Propositional Logic. Foundations. Deductive Tableaux. Predicate Logic. Introduction. The Language. The Meaning of a Sentence. Semantic Rules. Validity. Universal and Existential Closure. Valid Sentence Schemata. Equivalence. Safe Substitution. Valid Schemata with Substitution. Polarity. Force of Quantifiers. Quantifier Removal: Intuitive Preview. Removing Both Forces. Removing Strict Universal Force. Removing Strict Existential Force. Summary of the Skolemization Process. Unification. 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. Quicksort. 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


Best Sellers


Product Details
  • ISBN-13: 9780201548860
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Addison Wesley
  • Height: 170 mm
  • No of Pages: 736
  • Weight: 1050 gr
  • ISBN-10: 0201548860
  • Publisher Date: 07 Apr 1993
  • Binding: Hardback
  • Language: English
  • Spine Width: 34 mm
  • Width: 243 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
The Deductive Foundations of Computer Programming
Pearson Education (US) -
The Deductive Foundations of Computer Programming
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

The Deductive Foundations of Computer Programming

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!