Question: Let L be a first-order language. Define what it means for an L-formula to be in prener normal form. Implement a program, as succinct as

Let L be a first-order language. Define what it means for an L-formula to be in prener normal form. Implement a program, as succinct as possible, in your programming language of choice that, given an L- formula A as input, returns an L-formula A' as output such that A is in prenex normal form and A- A' is valid. Haskell would be an excellent choice the programming language
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
