Previous |  Up |  Next

Article

Title: Incomparably continuable sets of semilattices (English)
Author: Ježek, Jaroslav
Author: Slavík, Václav
Language: English
Journal: Mathematica Bohemica
ISSN: 0862-7959 (print)
ISSN: 2464-7136 (online)
Volume: 125
Issue: 2
Year: 2000
Pages: 135-137
Summary lang: English
.
Category: math
.
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. (English)
Keyword: semilattice
Keyword: embedding
MSC: 06A12
idZBL: Zbl 0966.06005
idMR: MR1768801
DOI: 10.21136/MB.2000.125962
.
Date available: 2009-09-24T21:41:22Z
Last updated: 2020-07-29
Stable URL: http://hdl.handle.net/10338.dmlcz/125962
.
Reference: [1] R. McKenzie G. McNulty W. Taylor: Algebras, Lattices, Varieties, Vol. I.Wadsworth & Brooks/Cole, Monterey, CA, 1987. MR 0883644
.

Files

Files Size Format View
MathBohem_125-2000-2_2.pdf 583.4Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo