FPRD LabShare an approach

← Claims

Written-proof claim

FPRD-T20

Claim FPRD-T20

Exact statement

Every finite positive relational presentation has a finite conventional CFG word normal form whose translated equation operator agrees in every environment, hence whose finite stages, exact and bounded least suffix solutions, and complete-match language agree exactly; together with the M13 lift, the complete-match languages of finite positive relational presentations are exactly the context-free languages.

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 equality concerns set-valued suffix semantics and complete-match language observation. It does not preserve derivations or normalize preferential PEG choice, and it makes no CFG-to-PEG or C001 claim.

Open work

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

Notes

The equality concerns set-valued suffix semantics and complete-match language observation. It does not preserve derivations or normalize preferential PEG choice, and it makes no CFG-to-PEG or C001 claim.