Help


from Wikipedia
« »  
A formula of first-order logic is in Skolem normal form ( named after Thoralf Skolem ) if it is in conjunctive prenex normal form with only universal first-order quantifiers.
Every first-order formula can 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.

1.869 seconds.