Back-and-forth for systems of antichains
From MaRDI portal
Publication:1904385
The author deals with root systems, that means with partially ordered sets such that the final section of any element is totally ordered. He considers the distributive lattice of all antichains. It is shown that the first-order theory of this distributive lattice is completely determined by the first-order theory of the root system. This is shown by describing a suitable back-and-forth system.
Recommendations
- scientific article; zbMATH DE number 2172912
- scientific article; zbMATH DE number 458919
- Partially ordered sets with nondistributive lattices of maximal antichains
- Avoidable structures. II: Finite distributive lattices and nicely structured ordered sets
- The lattice of antichain cutsets of a partially ordered set
Cites work
- Arborescent Structures. II: Interpretability in the Theory of Trees
- Classification theory and the number of non-isomorphic models
- scientific article; zbMATH DE number 3885853 (Why is no real title available?)
- Lex-subgroups of lattice-ordered groups
- Ordering the set of antichains of an ordered set
- The Hahn Embedding Theorem for Abelian Lattice-Ordered Groups
- Théories d'arbres
Cited in
(5)- First-order theories of subgroups of divisible Hahn products
- The order structure of the real spectrum of commutative rings
- Partially ordered sets with nondistributive lattices of maximal antichains
- scientific article; zbMATH DE number 2172912 (Why is no real title available?)
- Antichains and counterpoint dichotomies
This page was built for publication: Back-and-forth for systems of antichains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904385)