Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
sav08:simple_qe_for_dense_linear_orders [2009/04/21 19:28] vkuncak |
sav08:simple_qe_for_dense_linear_orders [2009/04/21 19:32] vkuncak |
||
|---|---|---|---|
| Line 18: | Line 18: | ||
| Can we assume that literals are of a special form? | Can we assume that literals are of a special form? | ||
| - | **Example:** simplify the formula | + | **Example:** simplify these formulas: |
| - | \[ | + | * $x < y\ \land\ \lnot (y < z) \ \land\ (x \neq z)$ |
| - | x < y\ \land\ \lnot (y < z) \ \land\ (x \neq z) | + | * $x < y\ \land y < x$ |
| - | \] | + | |
| + | If we have three concrete values for $x,y,z$, what is the form of the strongest type of a formula that we could write about them in this language? //(atomic type formula)// | ||
| ===== Quantifier Elimination Step ===== | ===== Quantifier Elimination Step ===== | ||