fpf.tools
Library / First Principles Framework (FPF) - Core Conceptual Specification
Jump to passage
In this reading
Source · lines 38968–38979

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 11:52:20 UTC · snapshot created 2026-10-03 11:53:41 UTC · last check 2026-10-03 13:30:20 UTC

B.1.1:4.4 - Graph Checks Are Conditional

Acyclicity, topological order, cutset, reachability, and flow checks are useful only after the graph is selected as a lens over a selected relation structure.

Do not infer:

  • parthood from graph adjacency;
  • independence from graph separation without a rule that makes the selected relation support that inference;
  • performed work from a planned step graph;
  • whole reidentification from a graph property without B.2;
  • architecture from a graph without an exact described holon, selected structure, and architecture relation or claim.