Source changed 2026-10-03 08:25:59 UTC · snapshot created 2026-10-03 08:26:43 UTC · last check 2026-10-03 09:55:09 UTC
A.19.CPM:3 - Forces
Usability vs correctness: engineers want a “simple compare” function; correctness demands explicit admissibility, explicit comparator choice, and explicit handling of incomparability and unknown evidence.
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 dated comparison U.Work, the actual Compare operation application with exact edition, policy, argument, and result bindings, and an A.10 evidence-provenance path.
Cross-scheme reasoning vs Bridge and ReferencePlane discipline: a comparison that relies on a semantic relation between two exact F.17 SchemeSenseCell values requires an obtaining F.9 Bridge and a separate C.2.1 bounded-use claim; a plane-only crossing requires the applicable ReferencePlane relation and policy. Neither branch supplies scope, predicate, plane, or time from an umbrella context label.
Avoiding “second centers of gravity”: mechanism semantics must have a governing pattern; otherwise the suite, A.6.1 archetypes, and Part‑G wiring drift apart.