Boolean Posets , Posets under Inclusion and Products of Relational Structures 1 Adam Grabowski

In this paper X will be a set. Let L be a lattice. Observe that Poset(L) has l.u.b.’s and g.l.b.’s. Let L be an upper-bounded lattice. Note that Poset(L) is upper-bounded. Let L be a lower-bounded lattice. One can check that Poset(L) is lowerbounded. Let L be a complete lattice. One can verify that Poset(L) is complete. Let X be a set. Then X is an order in… (More)