Claim FPRD-D14

Exact statement

The delay profile of a finite positive relational recognition presentation assigns each variable occurrence its guaranteed consumed prefix length, collects the minima in a min-plus dependency matrix, and calls the presentation cycle-guarded when its zero-delay dependency graph is acyclic, equivalently when every dependency cycle has positive total delay.

Statusdefinition

External reviewNo documented external or specialist review of this FPRD result is recorded.

Context

This row is imported exactly from the governed FPRD claims ledger. The matrix assignment records normalized inventory coverage; it is not a new proof or a promotion of the ledger status.

Proof or evidence

The ledger points to docs/specs/m17-delay-graph-guardedness.md. The matrix has not yet rewritten that source into a self-contained public proof summary.

docs/specs/m17-delay-graph-guardedness.md →

Verification notes

Reviewed on 2026-08-25 for identifier, status, provenance, evidence-link presence, and dependency import only. Mathematical proof audit remains the next action unless separately documented.

Limitations

The profile is a sufficient static certificate. Semantic annihilation or constants may make a rejected presentation uniquely solvable.

Open work

Add a self-contained definition page with examples, nonexamples, and dependency boundaries.

Notes

The profile is a sufficient static certificate. Semantic annihilation or constants may make a rejected presentation uniquely solvable.