FPRD LabShare an approach

← Claims

Definition

FPRD-D07

Claim FPRD-D07

Exact statement

A finite positive relational recognition presentation has a finite alphabet, finitely many variables with one equation each, a distinguished start variable, and terms generated by relational failure, identity, terminals, variables, commutative union, and relational sequence, with recursion interpreted by a selected least solution.

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

  • The syntax excludes preferential choice and antidomain because M11 uses monotonicity under pointwise inclusion. Existence, derivation adequacy, and bounded exactness remain separate theorem obligations.

Open work

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

Notes

The syntax excludes preferential choice and antidomain because M11 uses monotonicity under pointwise inclusion. Existence, derivation adequacy, and bounded exactness remain separate theorem obligations.