A minimal “Primer” that forces correct classification of our work on Runcible De

A minimal “Primer” that forces correct classification of our work on Runcible

Definitions + dependency graph
a) Terms: Paradigm, grammar-as-measurement, domain, claim(s), test(s), constraint(s), closure, decidability, ledger (record)
b) Diagram: Text → Claim Graph → Tests → Evidence Bindings → Verdicts → Output Artifact

Theorem statements (short, ruthless)
a) No closure without proof obligations.
b) No audit without provenance.
c) No liability assignment without typed verdicts + trace.
d) No high-liability deployment without admissible abstention.
e) No cross-domain decidability without a baseline measurement grammar (Natural Law invariants).