FPRD LabShare an approach

← Claims

Written-proof claim

FPRD-T97

Claim FPRD-T97

Exact statement

Let a deterministic visible-stack language have a complete family of a fixed positive finite number of causal resolvers. If the input, visible control, stack alphabet, resolver control, and family are finite, and X is the resulting forgotten-action projection, then X reversed belongs to PEL.

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 docs/notes/finite-causal-resolver-cover-proof.md. The matrix has not yet rewritten that source into a self-contained public proof summary.

docs/notes/finite-causal-resolver-cover-proof.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

  • FPRD-T96 supplies a degree-n scaffold for X. Positivity of n matches the LMR scaffolding definition, while finite carriers make the tuple control and working alphabet finite. Substituting K=X reversed in the sufficient direction of LMR Theorem 16 yields an ordinary complete-match PEG for K. The positive-degree and finiteness specialization, reversal, and LMR application are ordinary mathematics outside Lean. Bounded-delay and unbounded resolver families are not included.

Open work

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

Notes

FPRD-T96 supplies a degree-n scaffold for X. Positivity of n matches the LMR scaffolding definition, while finite carriers make the tuple control and working alphabet finite. Substituting K=X reversed in the sufficient direction of LMR Theorem 16 yields an ordinary complete-match PEG for K. The positive-degree and finiteness specialization, reversal, and LMR application are ordinary mathematics outside Lean. Bounded-delay and unbounded resolver families are not included.