Avoidable structures. II: Finite distributive lattices and nicely structured ordered sets
From MaRDI portal
Let \(\mathcal{D}\) be the set of isomorphism types of finite distributive lattices. Suppose that \(\mathcal{D}\) is ordered by embeddability. The authors characterize the order ideals in \(\mathcal{D}\) that are well-quasi-ordered by embeddability and characterize the members of \(\mathcal{D}\) that are elements of infinite anti-chains in \(\mathcal{D}\). For Part I see [Algebra Univers. 60, No.~3, 247--258 (2009; Zbl 1208.08001)].
Recommendations
Cited in
(6)- Avoidable structures. I: Finite ordered sets, semilattices and lattices
- Definability in substructure orderings. III: Finite distributive lattices
- Forbidden configurations for distributive and modular ordered sets
- Back-and-forth for systems of antichains
- scientific article; zbMATH DE number 63715 (Why is no real title available?)
- Definability in substructure orderings. II: Finite ordered sets
This page was built for publication: Avoidable structures. II: Finite distributive lattices and nicely structured ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1047091)