Timeline for What do you call a lattice whose meet operation preserves disjointness of subsets?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 12, 2010 at 20:00 | comment | added | Amit Kumar Gupta | Yeah, that's what I meant; fixed it. | |
| Nov 12, 2010 at 19:59 | history | edited | Amit Kumar Gupta | CC BY-SA 2.5 |
edited body
|
| Nov 12, 2010 at 13:26 | comment | added | Joel David Hamkins | I think it is more relevant to calculate $(x_1\wedge x_2)\wedge(y_1\wedge y_2)=0$ in your proof, since it is $x_1\wedge x_2$ that is in $A_1\wedge A_2$, etc. (although I understand the expressions are equivalent). | |
| Nov 12, 2010 at 10:26 | history | answered | Amit Kumar Gupta | CC BY-SA 2.5 |