FPRD LabShare an approach

← Claims

Written-proof claim

FPRD-T05

Claim FPRD-T05

Exact statement

For the strongly input-guarded fragment, the unique denotational fixed point agrees with ordinary operational evaluation, and sufficiently deep finite unfoldings are exact on every bounded input domain.

Statusinformal proof
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 OPEN_PROBLEMS.md. The matrix has not yet rewritten that source into a self-contained public proof summary.

OPEN_PROBLEMS.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

  • Operational termination is proved from strict input decrease on every equation-call edge. The operational vector satisfies the equations and therefore equals the unique fixed point. Depth N+1 is exact through length N; a sharp depth-N counterexample is executable.

Open work

Audit the proof against its dependencies and publish a self-contained evidence summary before increasing maturity.

Notes

Operational termination is proved from strict input decrease on every equation-call edge. The operational vector satisfies the equations and therefore equals the unique fixed point. Depth N+1 is exact through length N; a sharp depth-N counterexample is executable.