In
predicate logic
First-order logic, also called predicate logic, predicate calculus, or quantificational logic, is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables ove ...
, generalization (also universal generalization, universal introduction,
[Moore and Parker] GEN, UG) is a
valid inference rule
Rules of inference are ways of deriving conclusions from premises. They are integral parts of formal logic, serving as norms of the logical structure of valid arguments. If an argument with true premises follows a rule of inference then the co ...
. It states that if
has been derived, then
can be derived.
Generalization with hypotheses
The full generalization rule allows for hypotheses to the left of the
turnstile, but with restrictions. Assume
is a set of formulas,
a formula, and
has been derived. The generalization rule states that
can be derived if
is not mentioned in
and
does not occur in
.
These restrictions are necessary for soundness. Without the first restriction, one could conclude
from the hypothesis
. Without the second restriction, one could make the following deduction:
#
(Hypothesis)
#
(Existential instantiation)
#
(Existential instantiation)
#
(Faulty universal generalization)
This purports to show that
which is an unsound deduction. Note that
is permissible if
is not mentioned in
(the second restriction need not apply, as the semantic structure of
is not being changed by the substitution of any variables).
Example of a proof
Prove:
is derivable from
and
.
Proof:
In this proof, universal generalization was used in step 8. The
deduction theorem
In mathematical logic, a deduction theorem is a metatheorem that justifies doing conditional proofs from a hypothesis in systems that do not explicitly axiomatize that hypothesis, i.e. to prove an implication A \to B, it is sufficient to assume A ...
was applicable in steps 10 and 11 because the formulas being moved have no free variables.
See also
*
First-order logic
First-order logic, also called predicate logic, predicate calculus, or quantificational logic, is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over ...
*
Hasty generalization
*
Universal instantiation
*
Existential generalization
References
{{DEFAULTSORT:Generalization (Logic)
Rules of inference
Predicate logic