Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
sav08:extending_languages_of_decidable_theories [2008/04/15 14:27] vkuncak |
sav08:extending_languages_of_decidable_theories [2008/04/15 14:27] vkuncak |
||
|---|---|---|---|
| Line 37: | Line 37: | ||
| T' = \{ F \mid rf(F) \in Conseq(T) \} | T' = \{ F \mid rf(F) \in Conseq(T) \} | ||
| \] | \] | ||
| + | ++++ | ||
| How to do quantifier elimination in $T'$? | How to do quantifier elimination in $T'$? | ||
| ++++| | ++++| | ||
| The quantifier-free version of $F$ is then simply $R_{rf(F)}(x_1,\ldots,x_n)$ where $fv(rf(F)) = x_1,\ldots,x_n$. This quantifier elimination is easy and effective (and trivial). | The quantifier-free version of $F$ is then simply $R_{rf(F)}(x_1,\ldots,x_n)$ where $fv(rf(F)) = x_1,\ldots,x_n$. This quantifier elimination is easy and effective (and trivial). | ||
| - | ++++ | ||
| - | |||
| ++++ | ++++ | ||