Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur GraphSearch.
Concept
Universal generalization
Résumé
In predicate logic, generalization (also universal generalization or universal introduction, GEN) is a valid inference rule. It states that if has been derived, then can be derived.
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).
Prove: is derivable from and .
Proof:
In this proof, universal generalization was used in step 8. The deduction theorem was applicable in steps 10 and 11 because the formulas being moved have no free variables.
Source officielle
À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.