The Setting
Over a finite set of positions, a diagram presents a countable structure by naming its elements with labels and saying which labels name the same element, how the named elements are related and which countable ordinal each one carries. The definition says when such a presentation is valid and what structure a valid one presents.
Labels and Diagrams
A label on a set of positions is a pair with a nonempty finite subset of and a natural number; is the set of labels on : (1)✦ The root of a position is the label (2)✦
A tag is a countable ordinal, an element of (3)✦ A diagram on is a triple of binary relations and on and a map giving each label a tag: (4)✦
The Definition
Definition 1. Let be a diagram on a set of positions. Then is valid when is an equivalence relation on that is a congruence for and , that is, -equivalent labels are related by in the same way and carry the same tag, and, for all labels and all positions , the remaining conditions hold: raises tags, is extensional (labels with the same -predecessors are -equivalent), and distinct roots are -inequivalent: (5)✦ For a valid diagram , writing for the -class of a label , the quotient of is the set (6)✦ with the relation induced by , (7)✦ and the tag induced by , (8)✦
In the paper, the definition reads: for the set of positions, with labels , an arity- diagram is a triple of binary relations and on and a map , and it is valid if is an equivalence relation respected by and , if on the quotient by the relation implies and is extensional, and if the labels for lie in distinct -classes.
What Is Checked
The definition is stated over an arbitrary set of positions: the labels (1) with the roots (2), the tags in (3), the diagrams (4), the conditions for validity (5), and, for a valid diagram, the quotient (6) with the induced relation (7) and the induced tag (8).