QSA exact typed strict-order algebra

[Inserian]

Adds a bounded exact strict partial-order algebra as the next typed QSA mathematical-language primitive above accepted PR76.

The child consumes only caller-admitted opaque symbol identities and typed before edges. It does not parse language or choose semantic truth. It provides:

• exact acyclic relation admission with cycle rejection before mutation;
• exact transitive closure over bounded bitset rows;
• explicit Same, Before, After, and Unresolved relation states;
• exact unique-minimum/maximum queries while preserving ambiguity when extrema are not unique;
• redundant transitive-edge suppression without changing accepted state;
• insertion-order-independent canonical identity over the complete closure;
• explicit symbol/relation/closure-workspace caps and fail-closed behavior;
• QMath language route StrictOrder carrying ExactStructural evidence rather than falsely claiming algebraic coefficient exactness.

The existing QMath carrier gates a diamond DAG with an inferred relation, reverse/unresolved/self queries, extrema, exact receipt counts, redundant-edge suppression, insertion-order-independent identity, cycle nonmutation, ambiguous disconnected order, resource caps, and QMath receipt/dependency preservation.

Brain integration boundary is deliberate: Brain language/semantic admission identifies an accepted ordering/temporal procedure and supplies typed opaque event identities plus admitted relations. QSA performs exact closure/ordering computation and returns structural receipts. QSA never parses the raw prompt, owns the procedure identity, decides truth, writes memory, or selects the final answer.

Research-only stacked successor to accepted PR76; no merge or production promotion is authorized.