A.19.CPM:5.1 - Tell
Think of CPM as a declaration for a replayable, relation-producing comparison operation:
- Input: “two admitted profiles + an explicit comparator spec + declared admissibility and evidence declarations”
- Output: “a set‑valued relation outcome that preserves incomparability and uncertainty”
The key didactic boundary is: CPM compares; it does not decide.