Ramsey-type theorems
Algorithms for generating random posets, random lattices and random lattice terms are given.
In the paper, the notion of relative polarity in ordered sets is introduced and the lattices of -polars are studied. Connections between -polars and prime ideals, especially in distributive sets, are found.
We investigate conditions for the existence of relative complements in ordered sets. For relatively complemented ordered sets with 0 we show that each element b ≠ 0 is the least one of the set of all upper bounds of all atoms contained in b.
We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets. We show some properties of the binary operation of relative pseudocomplementation and provide some corresponding characterizations. We show that relatively pseudocomplemented posets satisfying a certain simple identity in two variables are join-semilattices. Finally, we show that every relatively pseudocomplemented poset is distributive and that the converse holds for posets satisfying the ascending chain...