quantifier free
Let be a first order language. A formula is quantifier free iff it contains no quantifiers.
Let be a complete -theory. Let . Then is an elimination set for iff for every there is some so that .
In particular, has quantifier elimination iff the set of quantifier free formulas is an elimination set for . In other has quantifier elimination iff for every there is some quantifier free so that .
Title | quantifier free |
Canonical name | QuantifierFree |
Date of creation | 2013-03-22 13:27:49 |
Last modified on | 2013-03-22 13:27:49 |
Owner | mathcam (2727) |
Last modified by | mathcam (2727) |
Numerical id | 7 |
Author | mathcam (2727) |
Entry type | Definition |
Classification | msc 03C10 |
Classification | msc 03C07 |
Classification | msc 03B10 |
Related topic | Quantifier |
Related topic | LogicalLanguage |
Defines | quantifier free formula |
Defines | quantifier elimination |
Defines | elimination set |