Claim FPRD-T11

Exact statement

Every finite uniquely labeled positive strongly input-guarded recognition presentation has a graph-directed exact continuation dynamic whose orbit closure is compact and canonically homeomorphic and edge-conjugate to the inverse limit of its finite bounded M3 orbits, with exact location, continuation, and call behavior recovered by uniform thread readouts.

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

This is a lift only for M3's positive strongly guarded right-success continuation dynamics. It does not cover calls beneath predicates, failure or commitment continuations, all ordinary PEGs, runtime activation, finite-dimensional coordinates, or semi-algebraic geometry.

Open work

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

Notes

This is a lift only for M3's positive strongly guarded right-success continuation dynamics. It does not cover calls beneath predicates, failure or commitment continuations, all ordinary PEGs, runtime activation, finite-dimensional coordinates, or semi-algebraic geometry.