Jump to text
On this page
Copy and source
Published source confirmed at last check

Source changed 2026-11-18 22:51:26 UTC · snapshot created 2026-11-18 22:54:45 UTC · last check 2026-11-18 22:54:38 UTC

A.19.CPM:3 - Forces

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