The Setting
Section 3 builds its abstract elementary class on basic structures, and Definition 3.2 says what a basic structure is. It starts from a family of matrices with entries in : an index set , a dense linear order , and for each tuple of distinct elements of a matrix with rows , columns and entries .
The entries are not elements of the structure. Each row and each column of each matrix is spread into a fiber of points, the finite subsets of acting on the row fibers and those of on the column fibers by symmetric difference, and a bit relation between a row fiber and a column fiber shows the entry up to the flips these translations make. A structure of this kind is handled through a normal form, the data , , with an isomorphism from the structure they build onto it, and each normal form is coded as a structure whose universe is an ordinal.
Tuples and Relational Structures
A tuple from a set is an injective map for some , of length .✦ The set of tuples from is .
A vocabulary gives for each a set of -ary relation symbols. A relational structure in consists of a set , its universe, and for each and each an interpretation .✦
The Definition
Definition 1 (Basic structures in normal form). A normal form consists of a nonempty set , the 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 , each and each : (1)✦ For sets and , the set of points is (2)✦ the points of are , with rows and columns .
The relation symbols form a countable set ; by their arity they are (3)✦ and the language of arity is (4)✦
For a matrix , the bit at a row index , a finite , a column index and a finite is (5)✦
The raw relation of , between a symbol and a finite sequence of points of any length, holds exactly in the cases below, written , where , , , , , has length , and is the matrix of : (6)✦ For , the relation of is (7)✦
A presentation of a relational structure in is a normal form with a bijection such that for all , and (8)✦
For a normal form , a set and a bijection , the structure of on is the relational structure in with universe and relations .✦ Let be the initial ordinal of cardinality , as a von Neumann ordinal, and a fixed bijection.✦ The coded structure of is the structure of on : (9)✦
In the paper, the result reads: a basic structure has sorts and , with a nonempty dense linear order without endpoints whose bounded intervals are countable, groups and under symmetric difference, for every tuple row fibers that are -torsors and column fibers that are -torsors, and a bit relation with for and , in the countable relational language listed after the definition, its fibers and standing for the rows and the columns here.
What Is Checked
Definition 3.2 is stated over the tuples from the index set and over the relational structures in whose universe is a set.