A.19.CPM:3 - Forces
- Usability vs correctness: engineers want a “simple compare” function; correctness demands that admissibility, comparator choice, and handling of incomparability and unknown evidence be explicit.
- Total order convenience vs partial order truth: total orders simplify downstream selection; partial orders are often the faithful representation (especially in multi‑criteria settings).
- Evolvability vs stability: comparator methods evolve (SoTA churn); kernel semantics and slot field sets must remain stable and wiring‑friendly.
- Replayability vs speed of discussion: teams want fast decisions; replay requires the
CompareorCompareEligibilityapplication, its edition, policy and argument bindings, and its returned value or explicit absence. Recover dated comparisonU.Workand the A.10 evidence-provenance path when the account asserts them or the receiving use consumes them, under §4.1. - Cross-scheme reasoning vs Bridge and ReferencePlane discipline: a comparison that relies on a semantic relation between two F.17
SchemeSenseCellvalues requires an obtaining F.9Bridgeand a separate C.2.1 bounded-use claim; a plane-only crossing requires the ReferencePlane relation and policy. Neither branch supplies scope, predicate, plane, or time from an umbrella context label. - Semantic consistency vs duplicate definitions: suite references,
A.6.1archetypes and Part G wiring need one governing CPM definition.