The Setting
The class is a class of structures in a countable relational language , each presented by a normal form, also called a basic structure. A normal form has an index set and a base order , and at every base point it gives each tuple from , an injective finite sequence of elements of , a color in a palette of binary sequences modulo finite differences. Assuming the continuum hypothesis (CH), , a test is defined for each tuple at each base point, as a condition on the colors there of its subtuples.
Definition 3.7 decides, by where these tests fail, which structures are the objects of and when one is a strong substructure of another. The definition goes through a presentation of each structure, and the question is whether a different presentation would change the answer.
Normal Forms and Their Presentations
A tuple from a set is an injective map from into , for some ; its length is .✦ The subtuple of a tuple from along an order embedding is the tuple .✦ The image of under an injection of into a set is the tuple from .✦
A binary sequence is a map .✦ Two binary sequences and are equal outside a finite set, written , when they differ at only finitely many places.✦ The palette is the set of classes of binary sequences under ✦, and the class of a binary sequence is its color.✦
A normal form consists of a nonempty index set ; a nonempty base set with a dense linear order without least or greatest element, in which every closed interval is countable; and a bit for every tuple from , every and every .✦ The color of at is .✦ The points of are of six kinds: an index point for each , a base point for each , a group point for each finite subset of , a star point for each finite subset of , a row for each tuple from , each and each finite , and a column for each tuple from , each and each finite .✦
A normal form is a structure in whose universe is the set of its points. The unary symbols of are four sort symbols, each true exactly of the points of one of the first four kinds; for , a row symbol true of the rows with of length , and a column symbol true of the columns whose tuple has length ; and, for each finite , a label symbol true of the star point alone. The row projection for and , of arity , holds of such a row followed by the index points , and the column projection for , of arity , holds of such a column followed by the base point and the same index points. The binary symbols are the order on base points, incidence, true of and when , and the bit, true of a row and a column when (1) The ternary symbols are the group and star additions, true of the triples of group points and of star points, and the row and column actions, true of for a group point and of for a star point . Every symbol is false of every tuple of points not of these shapes.
A relational structure in has a set as its universe and interprets each -ary symbol as a set of -tuples from it.✦ A presentation of is a normal form together with a bijection from the points of onto the universe of that is an isomorphism: for every -ary symbol and every -tuple of points, satisfies the symbol at exactly when does at .✦
Maps and the Test
For normal forms and , a map consists of an injection of into , an order embedding of into , a finite row shift and a finite column shift for each tuple from , each and each , such that the bits agree: (2)✦ A map acts on points: it sends index, base and group points to their images under and , fixes star points, and sends a row to and a column to .✦ For a tuple from and a base point of , the color of at along is (3)✦
For presentations of and of , a map is an inclusion of into when and are the same set for every point of .✦
A diagram on a set of positions has binary relations and on the labels on , with a nonempty finite subset of and , and a tag for each label .✦ A diagram is valid when is an equivalence relation, and are invariant under , whenever , labels with the same -predecessors are -equivalent, and positions whose roots are -equivalent are equal.✦ The restriction of a diagram on along an injection of a set into is the diagram on in which each label on is related and tagged as its image is in .✦ Under CH, the code of diagrams by colors is an injection of the disjoint union over of the sets of diagrams on into .✦
For a coloring of the tuples from by colors in , the test of a tuple of length passes for when there is a diagram on such that, for every order embedding , the restriction is valid and (4)✦
Objects and Strong Maps
A normal form is an object when, for every tuple from , the bad set (5)✦ is countable.
A map of normal forms is strong when its base image is convex in and (6)✦
The Claim
Definition 1. Assume CH. The class consists of the structures in given by the first line below, its objects, with the strong substructure relation given by the second: for relational structures and in , (7)✦ If is an object of , then for every presentation of , (8)✦ If , then for any presentations of and of there is (9)✦
In the paper, the result reads: an object is a basic structure whose bad set is countable for every tuple , and for basic structures and , when , the basic inclusion, and at every new base point the full test for every old tuple passes with old row representatives.
What Is Checked
The definition of and its two consequences are stated, under CH, over relational structures in whose universes are sets, their presentations by normal forms, the test of a tuple through the code of diagrams by colors, and the maps of normal forms, with their colors along a map and their inclusions of presentations.