We study the preservation of certain properties under products of classes of finite structures. In particular, we examine age indivisibility, indivisibility, definable self-similarity, the amalgamation property, and the disjoint n-amalgamation property. We explore how each of these properties interact with the wreath product, direct product, and free superposition of classes of structures. Additionally, we consider the classes of theories which admit configurations indexed by these products.Comment: 33 page
Let F be a set of relational trees and let Forbh(F) be the class of allstructures that admit no homo...
AbstractIn this paper, we introduce a measure of the extent to which a finite combinatorial structur...
We characterize the big Ramsey degrees of free amalgamation classes in finite binary languages defin...
The age of each countable homogeneous permutation forms a Ramsey class. Thus, there are five countab...
We consider the preservation of properties of being finitely generated, being finitely presented and...
AbstractLet L be a relational language and U be a set of L-structures. U is indivisible if for each ...
The age of each countable homogeneous permutation forms a Ramsey class. Thus, there are five counta...
We consider the preservation of properties of being finitely generated, being finitely presented and...
We generalize the lexicographic product of first-order structures by presenting a framework for cons...
AbstractLet L be a relational language and U be a set of L-structures. U is indivisible if for each ...
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permu...
Under a completion assumption, we show that the superamalgamation property for some class of ordered...
AbstractA relational first order structure is homogeneous if it is countable (possibly finite) and e...
AbstractA relational first order structure is homogeneous if it is countable (possibly finite) and e...
An L-structure M is said to be invisible if for any partition M = X ∨ Y, X or Y contains a copy of M...
Let F be a set of relational trees and let Forbh(F) be the class of allstructures that admit no homo...
AbstractIn this paper, we introduce a measure of the extent to which a finite combinatorial structur...
We characterize the big Ramsey degrees of free amalgamation classes in finite binary languages defin...
The age of each countable homogeneous permutation forms a Ramsey class. Thus, there are five countab...
We consider the preservation of properties of being finitely generated, being finitely presented and...
AbstractLet L be a relational language and U be a set of L-structures. U is indivisible if for each ...
The age of each countable homogeneous permutation forms a Ramsey class. Thus, there are five counta...
We consider the preservation of properties of being finitely generated, being finitely presented and...
We generalize the lexicographic product of first-order structures by presenting a framework for cons...
AbstractLet L be a relational language and U be a set of L-structures. U is indivisible if for each ...
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permu...
Under a completion assumption, we show that the superamalgamation property for some class of ordered...
AbstractA relational first order structure is homogeneous if it is countable (possibly finite) and e...
AbstractA relational first order structure is homogeneous if it is countable (possibly finite) and e...
An L-structure M is said to be invisible if for any partition M = X ∨ Y, X or Y contains a copy of M...
Let F be a set of relational trees and let Forbh(F) be the class of allstructures that admit no homo...
AbstractIn this paper, we introduce a measure of the extent to which a finite combinatorial structur...
We characterize the big Ramsey degrees of free amalgamation classes in finite binary languages defin...