The deductive foundations of computer programming : a one-volume version of The logical basis for computer programming
著者
書誌事項
The deductive foundations of computer programming : a one-volume version of The logical basis for computer programming
Addison-Wesley Pub. Co., c1993
大学図書館所蔵 件 / 全9件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Condensed and simplified version of the original work
Includes bibliographical references (p. [673]-677) and indexes
内容説明・目次
目次
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
「Nielsen BookData」 より