FPRD LabShare an approach

← Claims

Definition

FPRD-D05

Claim FPRD-D05

Exact statement

A finite polynomial recognition-action presentation consists of a finite PEG behavior as distinguished state and finitely many named unary polynomial actions built from the deterministic recognition-algebra constructors; its dynamic is the closure of their generated orbit with exact and bounded word observations.

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

docs/design/foundation.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

  • Direct polynomial actions are a finite presentation shape, not presumed to have been extracted from an ordinary grammar. Action provenance stays visible.

Open work

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

Notes

Direct polynomial actions are a finite presentation shape, not presumed to have been extracted from an ordinary grammar. Action provenance stays visible.