QuantifierElimination[QuantifierTools]
ConvertToPrenexForm
convert a (quantified) Tarski formula to prenex form
Calling Sequence
Parameters
Returns
Description
Examples
Compatibility
ConvertToPrenexForm( expr )
expr
-
Rational Tarski formula, usually quantified
The prenex equivalent of expr, that is, a string of quantified variables (the "prefix"), followed by a boolean formula of true/false values and/or polynomial constraints where the only allowable boolean operators are And or Or.
Also alpha converts variables seen as conflicting in scope between quantified subformulae where appropriate, such that the output formula is correct and unambiguous as a quantified formula.
Uses equivalence of boolean operators, such as, e.g., Implies(A,B) = Or(Not(A),B).
Note the result does not contain any Not operators, which are eliminated by negating the corresponding relations.
with⁡QuantifierElimination:with⁡QuantifierTools:
ConvertToPrenexForm⁡And⁡Not⁡x=0,exists⁡y,x⁢y=0
∃⁡y,x≠0∧x⁢y=0
ConvertToPrenexForm⁡exists⁡y,And⁡y=0,forall⁡x,0<1x
∃⁡y,∀⁡x,y=0∧−x<0
The QuantifierElimination:-QuantifierTools:-ConvertToPrenexForm command was introduced in Maple 2023.
For more information on Maple 2023 changes, see Updates in Maple 2023.
See Also
AlphaConvert
QuantifierElimination
QuantifierTools
Download Help Document