This document defines the admissibility conditions for Matrix runs.
A run is any structured instantiation of the Matrix/MMS framework that attempts to produce, relate, or evaluate artifacts (claims, problems, relations, sources, etc.).
No run is valid by default. Admissibility must be explicitly established.
A run is an ordered, finite process that:
- declares a purpose
- specifies admissible artifact types
- assigns roles
- operates under explicit constraints
- produces traceable artifacts
- terminates under defined stop conditions
Any process lacking one of these properties is not a run.
A run is admissible only if all of the following are satisfied:
The run MUST declare:
- its intended function (e.g. comparison, construction, exploration)
- its scope boundaries
- what it explicitly does not attempt to do
Implicit purposes are invalid.
All roles involved in the run MUST be declared explicitly, including:
- authoring roles
- evaluation roles
- arbitration or governance roles (if any)
Undeclared roles invalidate the run.
The run MUST specify:
- which artifact types may be produced
- which relations are admissible
- which schemas are binding
Producing undeclared artifact types is invalid.
The run MUST acknowledge:
- applicable admissibility rules
- applicable stop rules
- applicable contracts
A run that does not explicitly bind itself to constraints is inadmissible.
A run MUST NOT:
- assert truth, correctness, or validity beyond its declared scope
- transfer structural properties into claims about the world
- imply epistemic authority
Violations trigger immediate stop conditions.
Every admissible run MUST define:
- normal termination conditions
- explicit stop triggers
- rejection criteria
Runs that cannot terminate are invalid.
Admissibility evaluation is binary:
- admissible
- inadmissible
There is no partial admissibility.
Admissibility does not imply usefulness, correctness, or relevance.
Public runs MUST satisfy additional constraints:
- minimality
- schematic character
- absence of empirical claims
- absence of domain authority
Private runs MAY relax these constraints but remain bound by all stop rules.
If a run is inadmissible:
- its artifacts are non-binding
- its results must not be cited
- it may not be extended
- it must not be retroactively justified
Inadmissibility is a valid and expected outcome.
A run is not a result.
A run is a test of admissibility under constraint.
Only runs that survive constraint checking are allowed to exist within the Matrix system.