Identity

The four sorts (G, T, R, C) classify all well-formed expressions without overlap or gap. Every well-formed expression belongs to exactly one sort.

The 11 Σ_UL operations are closed over the set of well-formed expressions. Applying any operation to well-formed inputs always yields a well-formed output.

Every well-formed expression uses finitely many applications of primitives and operations. No infinite construction is required to express any concept in UL.

Each operation signature specifies the sorts of its inputs and output. The sort of the result is fully determined by the operation and the sorts of its arguments.

The sort system and operation system are mutually consistent: no operation can produce a sort violation, and no sort restriction blocks a structurally valid operation.

The compose operation is associative: composing (f ∘ g) ∘ h yields the same result as f ∘ (g ∘ h) for all composable well-formed expressions.