Prenex and Skolem normal forms
January 20th, 2004
View as: 
Two standard forms for first order predicate logic- Prenex normal form requires all the quantifiers to be at the front, whilst Skolem form further demands that only universal (forall) quantifiers are used . Gives an algorithm for finding prenex form with worked example; consideration of Skolem functions; Skolem normal form algorithm; a consideration of logical equivalence and the merits of these normal forms.