Timeline for Semilattices in atomless boolean algebras
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 24 at 4:30 | history | edited | Jukka Kohonen |
tag fix (order lattices)
|
|
| Jun 27, 2012 at 11:25 | answer | added | Emil Jeřábek | timeline score: 2 | |
| Mar 1, 2010 at 9:34 | history | edited | Charles Stewart |
edited tags
|
|
| Dec 9, 2009 at 7:31 | vote | accept | Grue | ||
| Dec 8, 2009 at 23:28 | comment | added | Grue | Yeah, "meet" and "join" are rather confusing to me, and I already used one instead of another in the first draft of this question, so I'm sticking to the more... international terms from now on. I meant an infimum of a subset {x,y}, not the whole semilattice. | |
| Dec 8, 2009 at 23:15 | comment | added | Yemon Choi | Quibble: when you say every pair of elements has an "infimum", I think you mean "meet". The infimum would be something like the zero of the semilattice | |
| Dec 8, 2009 at 23:12 | history | edited | Grue | CC BY-SA 2.5 |
added 620 characters in body
|
| Dec 8, 2009 at 19:09 | answer | added | Joel David Hamkins | timeline score: 5 | |
| Dec 8, 2009 at 16:20 | history | asked | Grue | CC BY-SA 2.5 |