Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
msol_over_strings [2007/05/06 19:04] vkuncak |
msol_over_strings [2007/05/08 20:32] vaibhav.rajan |
||
|---|---|---|---|
| Line 30: | Line 30: | ||
| **Set operations**. The ideas is that quantification over sets with $\subseteq$ gives us the full Boolean algebra of sets. | **Set operations**. The ideas is that quantification over sets with $\subseteq$ gives us the full Boolean algebra of sets. | ||
| - | * Two sets are equal: $(S_1 = S_2) = (S_1 \subeteq S_2) \land (S_2 \subseteq S_1)$ | + | * Two sets are equal: $(S_1 = S_2) = (S_1 \subseteq S_2) \land (S_2 \subseteq S_1)$ |
| * Strict subset: $(S_1 \subset S_2) = (S_1 \subseteq S_2) \land \lnot (S_2 \subseteq S_1)$ | * Strict subset: $(S_1 \subset S_2) = (S_1 \subseteq S_2) \land \lnot (S_2 \subseteq S_1)$ | ||
| * Set is empty: $(S=\emptyset) = \forall S_1. S \subseteq S_1$ | * Set is empty: $(S=\emptyset) = \forall S_1. S \subseteq S_1$ | ||