Record each partial explanation’s variables, symmetries, validity scale, measurement inputs and assumptions. Then provide a dictionary identifying shared quantities. Different notation or scales do not by themselves imply a contradiction.
Take binary variables A, B and C. Three partial models require A=B, B=C and A≠C, each with certainty. Each pair model is possible in isolation, even with identical uniform single-variable marginals. Together they are impossible: the first two imply A=C. Agreement on overlapping marginals alone is therefore insufficient.
The next question is which assumption fails: the equalities, their certainty, the variable identifications or their domain of application. A hidden variable cannot resolve this exact contradiction while all requirements remain in force.
Freeze the inputs, derive the joint constraints and keep the target outcome separate. Compare a full model with its effective description. Report agreement, information loss and counterexamples. The resulting retrodiction validates the bounded application, not automatically the philosophical whole.
Testing protocol → · Exact examples →v0.25 · 27 September 2026