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:analyses_based_on_formulas [2009/04/08 10:37] vkuncak |
sav08:analyses_based_on_formulas [2009/04/08 10:37] vkuncak |
||
|---|---|---|---|
| Line 14: | Line 14: | ||
| \] | \] | ||
| In general, a logic that can represent exact least upper bounds needs to express the conditions such as "there exists a sequence of statements that produces the given state". | In general, a logic that can represent exact least upper bounds needs to express the conditions such as "there exists a sequence of statements that produces the given state". | ||
| + | |||
| Line 36: | Line 37: | ||
| \begin{array}{l} | \begin{array}{l} | ||
| N\left( (C_1 \land \ldots \land C_n) \lor (D_1 \land \ldots \land D_m) \right) = \\ | N\left( (C_1 \land \ldots \land C_n) \lor (D_1 \land \ldots \land D_m) \right) = \\ | ||
| - | \bigwedge (\{C_1, \ldots, C_n \} \cap \{D_1, \ldots, D_m\}) | + | \ \ \ \bigwedge (\{C_1, \ldots, C_n \} \cap \{D_1, \ldots, D_m\}) |
| \end{array} | \end{array} | ||
| \] | \] | ||