|
|
Sold Out
Book Categories |
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.
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Ronald Ricci
reviewed The Deductive Foundations of Computer Programming on December 18, 2014
The Deductive Foundations of Computer Programming
In comparison to "Introduction to Algorithms" (the other algorithm book I had significant exposure to) this one is faster to read, easier to digest and more tailored towards applications.
I found the "Hitchhiker's Guide to Algorithms" in the back to be extremely useful if you really find yourself tackling an algorithmic problem in practice.
The main part (maybe skipping/skimming down a few chapters) is a very good preparation for algorithm-heavy job interviews (e.g. Google, Facebook etc ...).
Very much recommended.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
The Deductive Foundations of Computer Programming
X
This Item is in Your Inventory
The Deductive Foundations of Computer Programming
X
You must be logged in to review the productsX
X
X
Add The Deductive Foundations of Computer Programming, , The Deductive Foundations of Computer Programming to the inventory that you are selling on WonderClubX
X
Add The Deductive Foundations of Computer Programming, , The Deductive Foundations of Computer Programming to your collection on WonderClub |
