Avoidable structures. I: Finite ordered sets, semilattices and lattices

DOI10.1007/S00012-009-2097-1MaRDI QIDQ1047090zbMATH OpenOpenAlexFDO

Authors Ralph McKenzie, W. Dziobiak, Jaroslav Ježek

Publication date 4 January 2010

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00012-009-2097-1

zbMATH Keywords

avoidable structuresincomparable structureslatticesordered setssemilattices

Mathematics Subject Classification ID

Partial orders, general (06A06) Semilattices (06A12) Structure theory of lattices (06B05) Structure theory of algebraic structures (08A05)

Review text

If \textbf{A} and \textbf{B} are structures, then \textbf{B} avoids \textbf{A} if \textbf{A} cannot be embedded into \textbf{B}. Two structures are said to be incomparable if each of them avoids the other. Let \(K\) be a class of structures of a given signature and \({\mathbf A}\in K\). Then \textbf{A} is said to be avoidable in \(K\) if there exists an infinite set \(S\) of pairwise incomparable finite structures from \(K\) such that every structure from \(S\) avoids \textbf{A}. In the paper, the authors find all finite unavoidable ordered sets, semilattices and lattices.

Recommendations

• Avoidable structures. II: Finite distributive lattices and nicely structured ordered sets
• Definability in substructure orderings. I: Finite semilattices
• Avoidable Sets in The Bicyclic Inverse Semigroup
• scientific article; zbMATH DE number 2188479
• Incomparably continuable sets of semilattices

Cited in

(2)

• Avoidable structures. II: Finite distributive lattices and nicely structured ordered sets
• Definability in substructure orderings. II: Finite ordered sets

This page was built for publication: Avoidable structures. I: Finite ordered sets, semilattices and lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1047090)