The join of $a$ and $b$ in $P$, if it exists, is the unique least element greater than both $a$ and $b$.
i1 : B = booleanLattice 3; |
i2 : posetJoin(B, "001", "100") o2 = {101} o2 : List |
The object posetJoin is a method function.