Timeline for What do you call a lattice whose meet operation preserves disjointness of subsets?
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 12, 2010 at 19:58 | comment | added | Amit Kumar Gupta | Oh sorry, I missed the $\wedge$ in "0, 1, $\wedge$ have the usual meaning." Never mind anything in my previous comment. | |
| Nov 12, 2010 at 10:03 | comment | added | Amit Kumar Gupta | How are all elements incomparable? $s_1 \wedge t_1$ and $s_1$ are comparable. In your example, $S \wedge T$ consists of those three joins, and 0, and this set is certainly mutually disjoint. | |
| Oct 29, 2010 at 8:21 | history | answered | Bjørn Kjos-Hanssen | CC BY-SA 2.5 |