quality:corruption, structural:summarization
Algorithms and decidability

If a theory has quantifier elimination, then a specific question can be addressed: Is there a method of determining α Q F {\displaystyle \alpha _{QF}} for each α {\displaystyle \alpha } ? If there is such a method we call it a quantifier elimination algorithm. If there is such an algorithm, then decidability for the theory reduces to deciding the truth of the quantifier-free sentences. Quantifier-free sentences have no variables, so their validity in a given theory can often be computed, which enables the use of quantifier elimination algorithms to decide validity of sentences.