Library / First Principles Framework (FPF) - Core Conceptual Specification
Jump to passage
In this reading

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 08:25:59 UTC · snapshot created 2026-10-03 08:26:43 UTC · last check 2026-10-03 09:35:10 UTC

G.5:1 - Problem frame

The exact CG‑Frame card from G.1 and SoTA Synthesis Pack@CG‑Frame from G.2 name the frame, EntityOfConcernRef, ReferencePlane, source rows, and rival internally coherent method families (and sometimes generator families) that may address the same declared task. If their breadth is used as a premise, cite G.2’s pack CoverageJudgementRef and its HarvestPolicy basis. Registration does not recount cards as families; a combined method/generator coverage result does not establish method-only coverage for dispatch.

At the same time, the scale and coordinate definitions from G.3 and the typed operator-argument and result declarations from G.4 make admissible calculi and acceptance clauses explicit - enough to formulate eligibility, assurance, and admissibility constraints, but not enough to pick “the method” without collapsing plurality.

You need a notation‑independent way to:

  1. register method families and generator families as auditable, versioned entries,
  2. select, compose, or fall back among them at run time for a concrete task instance,
  3. declare stable selected-set results, including retained-alternative and all-member results, and publish stable identities to UTS when required, and
  4. emit RSCR‑relevant triggers and pins without inventing new “shadow specs”.