About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Ježek, Jaroslav ; Slavík, Václav
Incomparably continuable sets of semilattices. (English). Mathematica Bohemica, vol. 125 (2000), issue 2, pp. 135-137
MSC: 06A12 | MR 1768801 | Zbl 0966.06005 | DOI: 10.21136/MB.2000.125962
Keywords:
semilattice; embedding
Summary:
A finite set of finite semilattices is said to be incomparably continuable if it can be extended to an infinite set of pairwise incomparable (with respect to embeddability) finite semilattices. After giving some simple examples we show that the set consisting of the four-element Boolean algebra and the four-element fork is incomparably continuable.
References:
[1] R. McKenzie G. McNulty W. Taylor: Algebras, Lattices, Varieties, Vol. I. Wadsworth & Brooks/Cole, Monterey, CA, 1987. MR 0883644
Partner of
EuDML logo