<P> In mathematical logic, a formula of first - order logic is in Skolem normal form if it is in prenex normal form with only universal first - order quantifiers . </P> <P> Every first - order formula may be converted into Skolem normal form while not changing its satisfiability via a process called Skolemization (sometimes spelled Skolemnization). The resulting formula is not necessarily equivalent to the original one, but is equisatisfiable with it: it is satisfiable if and only if the original one is satisfiable . </P> <P> Reduction to Skolem normal form is a method for removing existential quantifiers from formal logic statements, often performed as the first step in an automated theorem prover . </P>

How prenex normal form (pnf) contributes to the process of 10 skolomization