The Setting
A basic structure is handled in normal form: an index set, a base order and an array of bits, from which its points and its relations are built. Definition 3.3, in the section on the abstract elementary class , is the basic inclusion , which says when one basic structure sits inside another. The library gives it as a map from the normal form of the smaller structure to that of the larger.
Normal Forms
A tuple from a set is an injective map from into for some , said to have length ; along an injection of into a set it becomes the tuple from .✦
A normal form consists of a nonempty index set ; a nonempty dense linear order without endpoints in which every closed interval is countable, the base order; and a bit for each tuple from , each and each .✦ The points of a normal form are the index points , the base points , the finite subsets of , the finite subsets of , the rows and the columns , with a tuple from .✦ The bit of the row and the column is (1)✦
The language of normal forms is relational, and interprets it on its points. The unary symbols of the language of normal forms pick out the index points, the base points, the finite subsets of and those of ; the rows with of length , one symbol for each and ; the columns with of length , one for each ; and, for each finite , the point alone. The binary ones are the order of base points, the incidence , and the bit relation, which holds of a row and a column when (1) is . Of arity three come the graphs of symmetric difference on the finite subsets of and on those of , and the translations, holding of for rows and of for columns. Last, for of length , a row projection of arity , one for each and , holds of , and a column projection of arity , one for each , holds of .
A relational structure in this language is a set, its universe, with an interpretation of each -ary symbol as a set of -tuples from the universe.✦ A presentation of is a normal form with an isomorphism of its points, under the relations above, onto .✦
The Claim
Definition 1 (Basic inclusion). Let and be normal forms. A map of normal forms consists of an injection , an order embedding , and finite sets and , the row and column translations, for each tuple from , each and each , such that for all such , and (2)✦ The map it induces on points is (3)✦ and it preserves and reflects every relation: for each -ary symbol and points of , (4)✦ If presents and presents , the map is an inclusion of in when is the identity on elements: (5)✦
In the paper, the definition reads: for basic structures and , when is an induced substructure of with the same group of finite subsets of , the base order is convex in , and the finite-set codes of keep their supports in .
What Is Checked
The definition is stated over normal forms with their index sets, base orders and bits, over tuples and their images along injections, over the points of a normal form with the relations of the language, and over relational structures whose universe is a set, together with their presentations by normal forms.