Compute prenex normal form Let the quantifiers in a be ic ,nin be in the left-to-right order in which they occur in A The prenex normal form of a" is" Q1x1… Qnanb Where 1. B is the wff obtained from a by erasing all quantifiers of A 2.For1<2<m Logic in Computer Science-p. 7/9Compute prenex normal form Let the quantifiers in A be ∃∀1x1, · · · , ∃∀nxn be in the left-to-right order in which they occur in A. The prenex normal form of A“is” Q1x1 · · · QnxnB where 1. B is the wff obtained from A by erasing all quantifiers of A. 2. For 1 ≤ i ≤ n, Logic in Computer Science – p.7/9