The Deductive Foundations of Computer Programming
Published on 7. April 1993
Book
Hardback
736 pages
978-0-201-54886-0 (ISBN)
More details
Language
English
Place of publication
Boston
United States
Publishing group
Pearson Education (US)
Target group
Professional and scholarly
Dimensions
Height: 170 mm
Width: 243 mm
Thickness: 34 mm
Weight
1050 gr
ISBN-13
978-0-201-54886-0 (9780201548860)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Content
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
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