Jump to text
On this page
Copy and source
Published source confirmed at last check

Source changed 2026-11-18 21:11:39 UTC · snapshot created 2026-11-18 21:12:35 UTC · last check 2026-11-18 22:10:10 UTC

A.5:4 - Solution

FPF pattern texts publish law-governed declarations—vocabulary, laws and applicability—that can be reused and specialized.

To keep the Kernel open‑ended, use the following boundary rules:

  1. Kernel minimality (C‑5). Domain knowledge stays outside the Kernel by default; it enters as extension vocabularies and laws.
  2. Boundary packaging via U.Signature (A.6.0). For reusable declaration bundles admitted as signatures under A.6.0, expose declaration dependencies in a SignatureManifest (imports, provides).
  3. Distinguish dependency from declaration comparison. imports forms a dependency DAG constrained by E.5.3. Compare declarations under the predicate for the claimed relation. For mechanism declarations, A.6.1:4.8 distinguishes refinement, conservative extension and equivalence by their preservation tests. Use C.29 when a mathematical morphism is claimed.
  4. Registry references stay references. Registry identifiers, such as Bridge ids, policy‑ids and edition‑ids in Part F, are cited or pinned where needed, not treated as exported symbols in provides.

For example, an extension describes a cooling Method under specified fluid and operating-range assumptions. Keep those assumptions and its heat-transfer law with the extension. If its declaration bundle is admitted as a U.Signature, its manifest identifies the scale declaration it imports and the declarations it provides. A changed scale declaration directs attention to the cooling claims that depend on it. A changed fluid assumption instead requires reconsidering uses that rely on that applicability condition; it does not make the assumption a Kernel law. This connects a local revision to its affected uses while preserving unrelated contributions.