Chapter 1 Review
95
algorithm (p. 12)
antecedent (p. 3)
assertion (p. 86)
assignment rule (p. 87)
binary connective (p. 3)
binary predicate (p. 40)
complete formal logic system
(p. 27)
conclusion (p. 25)
conditional rule of inference
(p. 90)
conditional statement (p. 90)
conjunct (p. 2)
conjunction (p. 2)
consequent (p. 3)
contradiction (p. 8)
correct formal logic system
(p. 27)
correct program (p. 85)
De Morgan’s laws (p. 10)
declarative language (p. 73)
depth-first search (p. 81)
derivation rule (p. 27)
descriptive language (p. 73)
disjunct (p. 3)
disjunction (p. 3)
domain (p. 41)
dual of an equivalence (p. 9)
equivalence (p. 3)
equivalence rule (p. 28)
equivalent wffs (p. 8)
existential generalization (p. 62)
existential instantiation (p. 60)
existential quantifier (p. 40)
expert system (p. 81)
free variable (p. 42)
Hoare triple (p. 86)
Horn clause (p. 76)
hypothesis (p. 25)
implication (p. 3)
inference rule (p. 29)
interpretation (p. 41)
knowledge-based system (p. 81)
logical connective (p. 2)
main connective (p. 6)
n-ary predicate (p. 40)
negation (p. 4)
postcondition (p. 86)
precondition (p. 86)
predicate (p. 39)
predicate logic (p. 58)
predicate wff (p. 41)
procedural language (p. 73)
program testing (p. 85)
program validation (p. 85)
program verification (p. 84)
Prolog database (p. 73)
Prolog fact (p. 73)
Prolog rule (p. 75)
proof of correctness (p. 85)
proof sequence (p. 27)
proposition (p. 2)
propositional calculus (p. 25)
propositional logic (p. 25)
propositional wff (p. 25)
pseudocode (p. 12)
recursive definition (p. 79)
resolution (p. 76)
rule-based system (p. 81)
scope (p. 41)
statement (p. 2)
statement letter (p. 2)
statement logic (p. 25)
tautology (p. 8)
ternary predicate (p. 40)
unary connective (p. 3)
unary predicate (p. 40)
universal generalization (p. 61)
universal instantiation (p. 59)
universal quantifier (p. 39)
valid argument (p. 26, 58)
valid predicate wff (p. 48)
well-formed formula (wff) (p. 6)
c H A P t e R 1 Review
teRMInoLogy
SeLf teSt
Answer the following true–false questions without looking back in the chapter.
section 1.1
1. A contradiction is any propositional wff that is not
a tautology.
2. The disjunction of any propositional wff with a tautology has the truth value true.
3. Algorithm TautologyTest determines whether any
propositional wff is a tautology.
4. Equivalent propositional wffs have the same truth
values for every truth value assignment to the
components.
5. One of De Morgan’s laws states that the negation of
a disjunction is the disjunction of the negations (of
the disjuncts).
section 1.2
1. An equivalence rule allows one wff to be substituted for another in a proof sequence.
2. If a propositional wff can be derived using modus
ponens, then its negation can be derived using modus tollens.
3. Propositional logic is complete because every tautology is provable.
4. A valid argument is one in which the conclusion is
always true.
5. The deduction method applies when the conclusion
is an implication.
95
algorithm (p. 12)
antecedent (p. 3)
assertion (p. 86)
assignment rule (p. 87)
binary connective (p. 3)
binary predicate (p. 40)
complete formal logic system
(p. 27)
conclusion (p. 25)
conditional rule of inference
(p. 90)
conditional statement (p. 90)
conjunct (p. 2)
conjunction (p. 2)
consequent (p. 3)
contradiction (p. 8)
correct formal logic system
(p. 27)
correct program (p. 85)
De Morgan’s laws (p. 10)
declarative language (p. 73)
depth-first search (p. 81)
derivation rule (p. 27)
descriptive language (p. 73)
disjunct (p. 3)
disjunction (p. 3)
domain (p. 41)
dual of an equivalence (p. 9)
equivalence (p. 3)
equivalence rule (p. 28)
equivalent wffs (p. 8)
existential generalization (p. 62)
existential instantiation (p. 60)
existential quantifier (p. 40)
expert system (p. 81)
free variable (p. 42)
Hoare triple (p. 86)
Horn clause (p. 76)
hypothesis (p. 25)
implication (p. 3)
inference rule (p. 29)
interpretation (p. 41)
knowledge-based system (p. 81)
logical connective (p. 2)
main connective (p. 6)
n-ary predicate (p. 40)
negation (p. 4)
postcondition (p. 86)
precondition (p. 86)
predicate (p. 39)
predicate logic (p. 58)
predicate wff (p. 41)
procedural language (p. 73)
program testing (p. 85)
program validation (p. 85)
program verification (p. 84)
Prolog database (p. 73)
Prolog fact (p. 73)
Prolog rule (p. 75)
proof of correctness (p. 85)
proof sequence (p. 27)
proposition (p. 2)
propositional calculus (p. 25)
propositional logic (p. 25)
propositional wff (p. 25)
pseudocode (p. 12)
recursive definition (p. 79)
resolution (p. 76)
rule-based system (p. 81)
scope (p. 41)
statement (p. 2)
statement letter (p. 2)
statement logic (p. 25)
tautology (p. 8)
ternary predicate (p. 40)
unary connective (p. 3)
unary predicate (p. 40)
universal generalization (p. 61)
universal instantiation (p. 59)
universal quantifier (p. 39)
valid argument (p. 26, 58)
valid predicate wff (p. 48)
well-formed formula (wff) (p. 6)
c H A P t e R 1 Review
teRMInoLogy
SeLf teSt
Answer the following true–false questions without looking back in the chapter.
section 1.1
1. A contradiction is any propositional wff that is not
a tautology.
2. The disjunction of any propositional wff with a tautology has the truth value true.
3. Algorithm TautologyTest determines whether any
propositional wff is a tautology.
4. Equivalent propositional wffs have the same truth
values for every truth value assignment to the
components.
5. One of De Morgan’s laws states that the negation of
a disjunction is the disjunction of the negations (of
the disjuncts).
section 1.2
1. An equivalence rule allows one wff to be substituted for another in a proof sequence.
2. If a propositional wff can be derived using modus
ponens, then its negation can be derived using modus tollens.
3. Propositional logic is complete because every tautology is provable.
4. A valid argument is one in which the conclusion is
always true.
5. The deduction method applies when the conclusion
is an implication.