FPRD LabShare an approach

← Claims

Written-proof claim

FPRD-T15

Claim FPRD-T15

Exact statement

For every finite positive relational presentation and input bound N, restriction of the exact least solution is the least solution of the finite bounded equation system, finite iteration stabilizes within the number of variable/input/suffix membership facts, and the coherent bounded solutions reconstruct the exact solution with uniform readout.

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

  • The claim is exact finite-input adequacy, not an error approximation. It does not yet extract relational continuation actions or prove a CFG or CFL equivalence.

Open work

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

Notes

The claim is exact finite-input adequacy, not an error approximation. It does not yet extract relational continuation actions or prove a CFG or CFL equivalence.