The Abstract Structure of a Binary Relational Model

Generalizing the previous M-Phi post on the abstract structure of an ω-sequence, suppose that A=(A,R) is any (set-sized) binary relational model (i.e., A is the domain/carrier set and RA2). Let κ=|A|. Let L be a second-order, possibly infinitary, language, with = (but no non-logical primitive symbols), which allows compounds over κ-many formulas and allows quantifier prefixes to be a set V of variables of cardinality κ. For each aA, let xa be a unique variable that "labels" a. Let the second-order unary variable X label the domain A and let the second-order binary variable Y label the relation R.

The (possibly infinitary) diagram formula ΦA(X,Y) is then:
V[a,bA;ab(xaxb)aAXxax(XxaA(x=xa)) a,bA(±abYxaxb)]
where V={xaaA} and ±abYxaxb is Yxaxb if (a,b)R and ¬Yxaxb otherwise.

On the Diagram Conception of Abstract Structure,
The abstract structure of A is the proposition Φ^A expressed by the formula ΦA(X,Y)
Categoricity ensures that, for any B=(B,S) (a relational model, with a single binary relation SB2), we have:
BΦA(X,Y) if and only if BA.

Comments