Infinite lexicographic products (Q2238126)

The current text continues the author's study of generalised lexicographic products of relational first-order structures and their properties (e.g., in [\textit{N. Meir}, J. Symb. Log. 81, No. 3, 951--971 (2016; Zbl 1436.03182)]). For binary relations the lexicographic product of two structures is the obvious generalisation of the lexicographic order, and the general notion is its natural extension (Definition 1.1). In his earlier work, the author shows that the lexicographic product has quantifier elimination (in a natural language) and applies this result to show show that certain Ramsey theoretic properties are preserved under this notion. These properties are, therefore, preserved under any finite number of iteration of this lexicographic product. In the present work, the authors pushes this construction by introducing a construction that can be viewed as an infinite iteration of lexicographic product. First (Section 3), the notion of a finite tree product is introduced (Definition 3.1) and then the process of finitely iterating the lexicographic product is cast into this new framework. The next -- natural -- step (Section 4) is the generalisation of the finite tree product to infinite trees (Definition 4.5). The basic (combinatorial) structure of this process is given in Lemma 4.15, and its basic model theoretic properties are given in Lemma 4.16. A significant drawback of the infinite tree product is that even if all the structures in the tree are countable, their product will have size at least continuum. To circumvent this problem (and allow for a Ramsey theoretic study of the infinite product without getting into set theoretic phenomena), the author shows that under natural assumptions (Definition 5.12) there is a unique, up to isomorphism, countable dense substructure of the tree product and that it is a transitive and homogeneous elementary substructure (Theorem 5.14, Lemma 5.17). Section 6 of the paper exploits the above result to study some Ramsey theoretic proeprties of the tree product (Theorem 6.1) and construct some new examples related to those properties, answering a question from [\textit{A. Hasson} et al., Contemp. Math. 558, 417--452 (2011; Zbl 1267.03045)].