| |
| | Normal Forms and Skolem Functions (Site not responding. Last check: ) |
 | | Normal forms are based on the expressing formulas in terms of negation, conjunction, disjunction, and the quantifiers, {¬, /\, \/, /\x, \/x}. |
 | | The procedure to convert a formula to negation normal form is to recursively replace formulas appearing on the left with formulas appearing on the right. |
 | | A formula is placed in prenix normal form by recursively moving quantifiers outward so that all quantifiers appear at the beginning of the formula. |
| cs.wwc.edu /~aabyan/Logic/normal.html (671 words) |
|