Prenex Normal Form
المؤلف:
Chang, C.-L. and Lee, R. C.-T.
المصدر:
Symbolic Logic and Mechanical Theorem Proving. New York: Academic Press, 1997.
الجزء والصفحة:
...
8-2-2022
1093
Prenex Normal Form
A formula of first-order logic is in prenex normal form if it is of the form
 |
(1)
|
where each 
is a quantifier 
("for all") or 
("exists") and 
is quantifier-free.
For example, the formula
 |
(2)
|
is in prenex normal form, whereas formula
 |
(3)
|
is not, where 
denotes OR.
Every formula of first-order logic can be converted to an equivalent formula in prenex normal form.
REFERENCES
Chang, C.-L. and Lee, R. C.-T. Symbolic Logic and Mechanical Theorem Proving. New York: Academic Press, 1997.
Kleene, S. C. Mathematical Logic. New York: Dover, 2002.
الاكثر قراءة في المنطق
اخر الاخبار
اخبار العتبة العباسية المقدسة
