Back-and-forth for systems of antichains (Q1904385): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Lex-subgroups of lattice-ordered groups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Hahn Embedding Theorem for Abelian Lattice-Ordered Groups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3220545 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Théories d'arbres / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ordering the set of antichains of an ordered set / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Arborescent Structures. II: Interpretability in the Theory of Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Classification theory and the number of non-isomorphic models / rank | |||
Normal rank | |||
Latest revision as of 07:57, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Back-and-forth for systems of antichains |
scientific article |
Statements
Back-and-forth for systems of antichains (English)
0 references
20 December 1995
0 references
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.
0 references
elementary equivalence
0 references
root systems
0 references
distributive lattice
0 references
antichains
0 references
first-order theory
0 references
back-and-forth system
0 references
