Claim FPRD-T14

Exact statement

Every finite positive relational recognition presentation induces a monotone operator preserving joins of increasing omega-chains on the complete lattice of relational suffix-behavior vectors; its least fixed point is the union of finite unfoldings and agrees exactly with finite derivation suffix semantics.

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

Tarski supplies the standard complete-lattice fixed-point backbone. M11 must prove chain continuity and derivation adequacy for this specific suffix-recognition syntax. Least does not mean unique.

Open work

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

Notes

Tarski supplies the standard complete-lattice fixed-point backbone. M11 must prove chain continuity and derivation adequacy for this specific suffix-recognition syntax. Least does not mean unique.