FPRD LabShare an approach

← Claims

Written-proof claim

FPRD-T13

Claim FPRD-T13

Exact statement

Set-valued suffix relations form a finite-observation recognition doctrine under relational composition, commutative union, preferential nonempty choice, and antidomain; deterministic PEG behavior embeds under singleton outcomes and preferential choice, while a nonfunctional optional-prefix family shares M7's actions, compact coordinate space, finite shadows, growth, and complete-match acceptance but has different full remaining-suffix 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

  • Relational outcomes record possible suffixes, not derivations or parse multiplicity. M10 does not yet give arbitrary CFG equations, least-fixed-point recursion, CFL equivalence, or a semi-algebraic model.

Open work

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

Notes

Relational outcomes record possible suffixes, not derivations or parse multiplicity. M10 does not yet give arbitrary CFG equations, least-fixed-point recursion, CFL equivalence, or a semi-algebraic model.