Part B - Trans-disciplinary Reasoning Cluster
B.1 - Holon Aggregation and Part-Whole Construction
Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative
B.1:0 - Use This When
Use this pattern when a project needs to say how several admitted objects are considered as a whole, or when a whole-level claim depends on parts, collection belonging under the collection’s own rule, component structure, constructional grounding, or a selected aggregation rule.
Typical moments:
- a product, plant, dataset, paper, model family, organization, fleet, batch, or research program is discussed as a whole;
- a dashboard rolls part measurements into a whole-level characteristic;
- a team says that a method, role, graph, or algebra “decomposes” something and may be smuggling part-whole claims;
- a collection needs whole-level characteristics without becoming an acting collective system;
- an aggregation claim is being used for architecture, assurance, evidence, or MHT reasoning.
First useful move. Recover the claim kind before choosing notation: part-whole construction, collection belonging under the collection’s own rule, collection-as-whole grounding, a relation among local system-role kinds, a direct participation or assignment relation, method relation structure, work occurrence holarchy, selected architecture structure, or mathematical description. If claim-bearing source wording still says only “role,” use E.10.ROLE before choosing one of these branches.
What goes wrong if missed. Γ, graph, algebra, decomposition, factor, component, step, phase, and collection wording become one universal composition language. Roles and methods become parts; work occurrence evidence is inferred from method structure; a graph is mistaken for the structure; a collection becomes an acting whole by label.
What this buys. B.1 gives one doorway into part-whole construction while keeping its neighbors clean: A.14 is the pattern for relation vocabulary, C.13 is the pattern for constructional grounding, B.3.5 is the pattern for Working-Model assurance grounding, A.15.1 is the pattern for work-occurrence holarchy, and C.29 is the pattern for mathematical-lens use.
Not this pattern when.
- If the question is the local relation word, use
A.14. - If the question is constructive part-whole grounding, use
C.13. - If the question is assurance grounding for a working model, use
B.3.5. - If the question is an exact relation among local system-role kinds, use
A.2.7; if it is classification, assignment, or a direct participation relation, state that fact through its own pattern and predicate. Send unresolved claim-bearing “role” wording throughE.10.ROLE. Use the Method patterns for method relation structure andC.29when a mathematical lens is relied on for the current claim. - If the question is performed-work occurrence parts, use
A.15.1. - If the question is whole reidentification or emergence-family wording, use
B.2orB.2.P.
B.1:1 - Problem Frame
B.1 is not a universal algebra pattern. It is the holonic construction doorway for part-whole and collection-as-whole claims.
The older Γ material remains useful only after the ontology-side claim has been recovered. Γ, graph, algebra, tuple, matrix, embedding, and neural representation can express or check a selected structure; they do not decide by spelling that the current object is a holon, that the relation is parthood, or that a role, method, step, or work occurrence is a part of a holon.
B.1:2 - Problem
Without B.1:
- Mereology and notation collapse. A graph or algebra is treated as the part-whole structure itself.
- Roles and methods become parts. Role factors, method parameters, guards, steps, and compositions are read as holonic parts because the same word “decomposition” appears.
- Work occurrence is inferred from plan. A method decomposition or schedule is treated as evidence that performed work had those parts.
- Collections become acting systems. A set, list, batch, fleet, or community is treated as an admitted acting System or responsibility bearer from plural naming, a system-role kind or assignment, a Method, or Work. Admission of the acting collective remains an A.1 question; responsibility also needs the predicate, participants, and pattern or rule that defines it.
- Emergence becomes rhetoric. A whole-level gain is explained by “synergy” or “more than the sum” without checking existing-whole explanations or B.2 whole reidentification.
B.1:3 - Forces
| Force | Tension |
|---|---|
| Part-whole usefulness vs ontology explosion | FPF needs whole-level reasoning without minting a U-kind for every composed expression. |
| Constructional grounding vs math convenience | Algebra and graphs can make checks precise, but only after the ontology-side object and relation are selected. |
| Collection value vs false collective agency | Collections can have useful whole-level characteristics without becoming acting systems. |
| Method planning vs performed work | A method can guide expected decomposition; work occurrence parts require actual occurrence identity, timing, and evidence. |
| Emergence recognition vs ordinary repair | Some whole-level gains require B.2; many are explained inside the existing whole by ordinary part, method, measurement, or architecture repair. |
B.1:4 - Solution
Use B.1 as a discriminator and construction frame.
B.1:4.1 - Holon Aggregation Claim Frame
When part-whole construction is current, recover:
HolonAggregationClaim@Context:
candidateWholeRef: U.Holon
candidatePartRefs:
aggregationPolicyRef?
claimScopeRef?: U.ClaimScope
qualificationWindowRef?
identityOrRecognitionRule:
partRelationRefs:
constructionBasisRef?
selectedStructureRef?
wholeLevelCharacteristicRefs?
assuranceGroundingRef?
neighboringNonPartRelationRefs?
mathLensOrRepresentationRef?
This is a claim frame, not a U-kind and not an acting record. It says what must be named before the aggregation claim is relied on.
Use:
A.14forComponentOf,ConstituentOf,PortionOf,PhaseOf, collection belonging under the collection’s own rule, aspect, and related vocabulary;C.13for constructional grounding such as sum, set, slice, or another accepted construction;B.3.5when a working model relies on the part-whole claim for assurance or evidence;C.16when the current output is a whole-level characteristic;A.1andA.15when the whole is claimed to be an acting collective system.
B.1:4.2 - Didactic Firewall
| Source claim | Ontology-side recovery | Subject pattern |
|---|---|---|
| “This object is made of these parts.” | Part-whole construction over admitted holons. | A.1, A.14, C.13, B.3.5 when assurance is current. |
| “These items belong to this collection.” | The collection’s own belongs-to rule or collection-as-whole grounding; no ComponentOf inference. | A.14, C.13, C.16 for a collection-level or whole-level characteristic. |
| “This role is combined from role factors.” | Unresolved source wording. It may mean an exact relation among local system-role kinds, a classification or assignment, a direct participation relation, a naming question, or ordinary prose; none is holonic parthood by default. | E.10.ROLE first; then A.2.7 only for the exact relation among local system-role kinds, or the direct pattern for the recovered classification, assignment, participation, or naming claim; use C.29 only if a mathematical lens is selected. |
| “This method has steps, parameters, guards, or variants.” | Method relation structure, method family, method description, or work plan; not performed work by default. | A.15, Method patterns, C.29 if mathematical lens is selected. |
| “This run contained episodes or concurrent sub-runs.” | Work occurrence holarchy with timing, evidence, occurrence identity, and work-part relation. | A.15.1, temporal pattern, evidence-use pattern. |
| “This graph or algebraic notation represents the structure.” | Mathematical or representation description of a selected structure. | C.29, A.22, architecture or description pattern. |
| “The whole shows emergence.” | Existing-whole explanation first; B.2 only when the whole itself must be reidentified. | B.2, B.2.P, or the direct characteristic, measurement, architecture, capability, or Work pattern. |
B.1:4.3 - Work Occurrence Holarchy
Performed work is different from structural composition.
A dated Work may have independently admitted temporal or operational parts under A.15.1. C.27 governs temporal claims, and B.1.4 aggregates recovered order or temporal relations when that is the question. Resource roll-ups use B.1.6; composing effects needs the direct relation and composition rule for those effects. Neither kind of calculation establishes Work parthood or makes a Method or role expression a holonic part.
Use A.15.1 when the claim needs occurrence identity, temporal coverage, Gamma_time, Gamma_work, episode policy, overlap policy, resource aggregation, or performed-work evidence.
B.1:4.4 - Mathematical And Representation Apparatus
Use Γ, graph, algebra, tuple, matrix, embedding, or neural representation only after the object under concern and selected relation are named.
Acceptable uses:
- a mathematical lens for a selected structure;
- a constructional expression for a part-whole claim already admitted by A.14 and C.13;
- a representation of dependency relations;
- a checking apparatus for invariants or conservative bounds.
Blocked uses:
- graph wording as parthood admission;
- algebraic factorization as role, method, or work parthood admission;
- source notation as a new U-kind;
- one fold rule as a universal replacement for the subject pattern.
B.1:4.5 - Existing-Whole Before MHT
Before declaring B.2 whole reidentification, ask whether the whole-level gain can be explained inside the existing whole:
- better parts;
- corrected part relation;
- improved measurement;
- role or method relation repair;
- work occurrence evidence repair;
- functional or architecture selected-structure repair;
- source, publication, or representation correction.
Use B.2 only when the whole itself must be reidentified.
B.1:5 - Archetypal Grounding (Worked Cases)
B.1:5.1 - Pump Skid
A pump skid can be a U.System holon whose parts include pumps, valves, controller, frame, and connectors.
B.1 recovers the holon aggregation claim. A.14 names component or portion relations. C.13 gives constructional grounding. C.16 carries whole-level characteristics such as maximum flow or pressure envelope. If a graph is drawn, it represents a selected dependency or structure; the graph is not the skid.
B.1:5.2 - Evidence Corpus
A corpus can be a collection under its own inclusion rule and a C.13 set account. This alone does not make it a holon. Treat an integrated claim-bearing corpus as a whole only after all six A.1 matters pass, including constructive part relations, assembly, a composition-grounded whole characteristic, and possible participation in a larger assembly. Coverage, source freshness, bias exposure, or evidential diversity may be collection-level characteristics without settling that stronger question.
The corpus does not become an acting system. A review board, script, or research team may instead be admitted as a System. If the current claim says only that it takes part in ordinary review or analysis, state the direct participation relation and stop there. If it says that the System performed admitted U.Work, recover that performer’s A.13 core and independently admit the Work under A.15.1. Add F.6 afterward only when the B.1 claim also needs precise assignment-bound attribution. A short B.1 sentence may omit an unused assignment identifier only when every relation it consumes remains recoverable. A local kind and a separate System-classification judgment remain independently optional. The corpus may be an episteme or publication-side object under its subject patterns.
B.1:5.3 - Method With Steps
A machining method has ordered steps and parameters. Those steps are method relation or method-description material. They do not prove that a performed machining run occurred, nor that the run had the same parts.
If the current claim is the method structure, use Method patterns and C.29 when algebra is selected. If the current claim is the actual run, use A.15.1.
B.1:6 - Bias-Annotation
| Bias risk | Failure | Mitigation |
|---|---|---|
| Apparatus as ontology | Graph, algebra, tuple, matrix, embedding, or Gamma notation decides the object kind by spelling. | Recover the holon, relation, selected structure, and mathematical-lens use separately. |
| Decomposition as parthood | Source “role” factors, method steps, phases, or work episodes are treated as holonic parts by label. | Use E.10.ROLE when the role wording is unresolved, then the direct pattern for the recovered relation; use the Method, temporal, Work, or part-whole pattern for the other claims. |
| Collection as acting whole | A set, list, batch, fleet, or community receives agency or responsibility by plural naming. | Recover who or what belongs under the collection’s own rule and the collection account, or admit the actual collective System under A.1. State responsibility separately by naming its predicate, participants, applicability, and occurrence identity; if no pattern or rule defines the needed claim, return that gap. |
| Emergence rhetoric | “More than the sum” replaces existing-whole explanation. | Test measurement, architecture, role, method, work, and evidence explanations before B.2 whole reidentification. |
B.1:7 - Conformance Checklist
| Check | Requirement |
|---|---|
CC-B1-1 | The current claim identifies whether it is part-whole, collection belonging under the collection’s own rule, collection-as-whole, a relation among local system-role kinds, classification, assignment, direct participation, method relation, work occurrence holarchy, selected structure, or mathematical description; unresolved claim-bearing “role” wording is sent through E.10.ROLE. |
CC-B1-2 | Part-whole claims name the exact whole and part participants, identity or recognition rule, part relation, constructional predicate and its defining pattern, plus any aggregation policy, selected structure, ClaimScope, or qualification window that changes the claim. |
CC-B1-3 | A.14 defines the relation vocabulary used here; C.13 defines the construction accounts. |
CC-B1-4 | Relations among local system-role kinds, classifications, assignments, direct participation relations, and Method relation structures are not treated as holonic parts merely because a label, graph, algebra, or naming convention composes them. A.2.7 is used only for the first of those branches. |
CC-B1-5 | Performed work occurrence parts require A.15.1. |
CC-B1-6 | Mathematical and representation apparatus is named as lens or expression, not as ontology by spelling. |
CC-B1-7 | B.2 is used only when the whole itself must be reidentified after existing-whole explanations fail. |
CC-B1-8 | No generic U.Boundary, U.Interaction, U.Level, U.Emergence, or U.Frustration is introduced by aggregation wording. |
B.1:8 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Symptom | Repair |
|---|---|---|
| Gamma as head ontology | Γ is treated as the thing that makes all wholes. | Recover the ontology-side claim first; use Γ only as constructional or mathematical apparatus when selected. |
| Graph as structure | A diagram or graph is treated as the part-whole structure. | Name the selected structure and relation pattern; keep the graph as representation or math lens. |
| Method as work | A method decomposition is used as evidence that work occurred. | Use A.15.1 for performed-work occurrence and evidence. |
| Collection as acting whole | A list or pool decides, acts, or bears responsibility. | Recover who or what belongs under the collection’s own rule or its collection-as-whole account, or admit the actual collective System under A.1. A system-role kind, assignment, Method, or Work does not establish responsibility; name the predicate and the pattern or rule that defines it, or state that this is missing. |
| Emergence by narrative | “More than the sum” replaces existing-whole analysis. | Check existing-whole explanations before B.2. |
B.1:9 - Consequences
Positive consequences:
- B.1 can still use useful aggregation apparatus without letting apparatus choose the ontology.
- Holonic part-whole claims become reviewable.
- Role, method, work, math-lens, and publication descriptions stop leaking into mereology.
- B.2 has a cleaner entry condition: whole reidentification, not ordinary improvement rhetoric.
Costs:
- Users must identify the claim kind before choosing a notation.
- Some Gamma-heavy examples require a subject pattern before the notation is used: work occurrence evidence uses
A.15.1, work-resource aggregation usesB.1.6, mathematical-lens reliance usesC.29, and whole reidentification first usesB.2.Pand thenB.2when the problem remains current. - Work occurrence analysis requires evidence and timing, not just a method plan.
B.1:10 - Rationale
The practical force of B.1 is conservative. Whole-level reasoning is useful, but it must be grounded in accepted part-whole relations, constructional discipline, and use of the applicable direct patterns. This lets FPF speak across physical systems, epistemes, work occurrences, bounded contexts, disciplines, and collections without growing a new type for every composed expression.
Mathematical apparatus remains available. It becomes more useful after the governed object is known: graph for dependency representation, algebra for selected composition rules, tuple for slot relation expression, matrix or embedding for analysis, and C.29 when a mathematical lens is relied on for the current claim.
B.1:11 - SoTA-Echoing
| Source family | Current lesson for B.1 | FPF decision |
|---|---|---|
| Constructional ontology and applied ontology practice | Whole identity, dependency, and construction need explicit grounding rather than unrestricted composition. | B.1 requires A.14 relation vocabulary and C.13 constructional grounding before part-whole claims are relied on. |
| Systems engineering and digital engineering practice | Whole-level characteristics and architecture views need traceable part relations and selected structures. | B.1 separates part-whole construction from selected-structure descriptions, dashboards, and mathematical representations. |
| Method and process-modeling traditions | Plans, procedures, and performed occurrences are often conflated. | Method relation structure remains with Method patterns; performed-work holarchy remains with A.15.1. |
| Emergence and holonic systems practice | Genuine whole-level novelty must be distinguished from measurement, architecture, role, method, or work repair. | B.2 is the pattern for whole reidentification after existing-whole explanations are tested. |
B.1:12 - Relations
- Builds on:
A.1for holon admission,A.14for relation vocabulary,C.13for constructional grounding, andB.3.5for Working-Model assurance grounding. - Coordinates with:
A.15andA.15.1for method and work,A.22andC.30for selected structure and architecture,C.16for whole-level characteristics,C.29for mathematical lenses, andB.2for whole reidentification. - Refined by:
B.1.1,B.1.2,B.1.4, andB.1.6for selected dependency, system aggregation, contextual-temporal aggregation, and work-resource aggregation cases.
B.1:End
B.1.1 - Dependency Structure and Relation Grounding
Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative
B.1.1:0 - Use This When
Use this pattern when an aggregation, architecture, assurance, or construction claim depends on how candidate parts, members, phases, portions, or external relations depend on each other.
Typical moments:
- a dependency diagram is used to justify a whole-level claim;
- a graph mixes parthood, mapping, order, time, resource, and boundary-crossing relations;
- a project needs to know whether a relation is part-whole, dependence, representation, influence, source use, publication use, or evidence relation;
- a selected dependency structure will be expressed with a graph, table, matrix, or another mathematical or representation lens.
First useful move. Name the dependency relation under concern before choosing graph notation. Then decide whether it is part-whole, boundary crossing, order, temporal phase, resource, representation, evidence, publication use, source use, or another direct relation defined or tested by the applicable pattern.
What goes wrong if missed. A graph becomes the ontology; an edge named “depends on” carries many relation kinds at once; external influence becomes parthood; order and time are encoded as structure; and mathematical checks look precise while the relation being checked remains unclear.
What this buys. B.1.1 lets dependency material bear on B.1 aggregation without letting graph notation decide relation kinds.
Not this pattern when.
- If the current relation word is a mereology question, use
A.14. - If the current part-whole claim needs constructional grounding, use
C.13. - If the current object is architecture selected structure, use
A.22andC.30. - If the current expression is mathematical-lens choice, use
C.29. - If the current question is performed work, use
A.15.1.
B.1.1:1 - Problem Frame
B.1.1 separates dependency structure from graph representation.
A dependency structure can be ontology-side when a direct pattern has selected the relation under concern. A dependency graph is a mathematical or representation description of that selected relation structure. The graph may be useful, but it is not the holon, not the part-whole relation, and not the constructional grounding by itself.
B.1.1:2 - Problem
Without B.1.1:
- Edge drift spreads.
ComponentOf, a collection’s belongs-to relation,PhaseOf,SerialStepOf,RepresentationOf, source use, evidence relation, and control relation all become generic graph edges. - Boundary crossing becomes parthood. A power grid, supplier, teacher, measuring instrument, model, or source record is drawn as a part because it affects the holon.
- Design and run objects mix. Planned structure, design description, actual work occurrence, and telemetry are placed in one dependency expression without a DesignRunTag or a distinction among the patterns that define those claims.
- Acyclic graph discipline overclaims. A graph check says something about the drawing, but the ontology-side relation remains ungrounded.
- Mappings become parts. A digital twin, dashboard, diagram, or architecture description is treated as a constituent of the object it describes.
B.1.1:3 - Forces
| Force | Tension |
|---|---|
| Visual clarity vs relation precision | Graphs make dependencies visible but tempt one-edge-fits-all modeling. |
| Part-whole locality vs external influence | External systems can influence, measure, transform, or supply a holon without becoming its parts. |
| Mathematical checks vs ontology-side grounding | Acyclicity, cutsets, reachability, and flow checks help only after relation kinds are selected. |
| Design view vs run evidence | Design-time dependency descriptions and run-time evidence often share labels but concern different subjects and require separate claims. |
B.1.1:4 - Solution
Use dependency structure first; use graph representation second.
B.1.1:4.1 - Dependency Structure Frame
DependencyStructure@Context:
dependencyQuestion:
intendedUse?:
claimScopeRef?: U.ClaimScope
qualificationWindowRef?
candidateNodeRefs:
selectedDependencyStructureRef?
dependencyRelationRefs:
relationParticipantRefs:
relationGroundingRefs:
partWholeRelationRefs?
boundaryCrossingRelationRefs?
orderRelationRefs?
temporalRelationRefs?
resourceRelationRefs?
representationRelationRefs?
evidenceRelationRefs?
publicationOrSourceUseRefs?
designRunTag?
definingOrTestingPatternRefs:
This frame records independently grounded relation claims and their participants. It is not itself a U.Structure. When the receiving use needs one selected dependency structure, recover all four A.22 identity discriminators: exact constituents, obtaining relation occurrences, applied constraints and named selection/use frame. The record refers to that structure and to the patterns defining its relations.
B.1.1:4.2 - Graph Representation
Use graph language only when a graph is the selected mathematical or representation lens:
DependencyGraphRepresentation@Context:
representedDependencyStructureRef:
nodeExpression:
edgeExpression:
graphPropertyChecks?
mathLensRef?
publicationOrViewRef?
The graph may express acyclicity, reachability, cutsets, weak links, flow, or traceability. Those checks apply to the graph expression and bear on the selected relation only when the rule for that relation admits the mapping. Use C.29 to state the mathematical representation correspondence, preserved and lost distinctions, and validation boundary on which that inference depends.
B.1.1:4.3 - Relation Grounding Guide
| If the edge means… | Recover… | Pattern that defines or tests the claim |
|---|---|---|
| part of the whole | part-whole relation over admitted holons | A.14, C.13, B.1 |
| an entity belongs to a world-side collection | the collection’s own belongs-to occurrence, or a separately grounded collection-as-whole claim | A.14, C.13, C.16, and the pattern that defines that collection’s rule |
| phase of the same carrier | temporal phase relation | the carrier’s identity and phase rules, A.14, and B.1.4 |
| ordered step or branch | method, process-view, Work, or order relation | A.3.1, A.3.2, A.15.1, or the pattern that defines the order relation; B.1.4, and C.29 when a lens is current |
| performed work part | work occurrence relation with evidence and timing | A.15.1 |
| external influence, signal, supply, measurement, or control | the exact obtaining relation and its participants; recover evidence provenance separately | A.3.4 for an actual transformation, C.16 for measurement, and the defining pattern for the particular supply or control relation; A.10 recovers the independently established support and bounded use |
| representation, dashboard, digital twin, or architecture description | description or representation relation, not parthood | C.2.1, E.17, C.30.AD, C.30.AD.BA |
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.
B.1.1:5 - Archetypal Grounding (Worked Cases)
B.1.1:5.1 - Plant Supplier
Source graph: PowerGrid -> Plant.
If the edge means electricity supply, recover that exact supply relation. It establishes neither plant parthood nor its absence. Test a separate part-whole claim under the chosen whole’s identity and parthood rules; an independently admitted internal power subsystem can be both a supplier and a part.
B.1.1:5.2 - Digital Twin
Source graph: DigitalTwin -> Turbine.
If the edge means representation, recover the architecture-description, publication, source-use, evidence, or digital-twin relation. The digital twin is not a turbine component by graph adjacency.
B.1.1:5.3 - Work Plan And Work Occurrence
Source graph: Prep -> Weld -> Paint.
If the graph describes a method or process view, use the patterns that define the method, description, and order claims. If it describes performed Work, use A.15.1 with occurrence identity, timing, evidence, and the exact Work relation. Do not let the same graph do both jobs.
B.1.1:6 - Bias-Annotation
| Bias risk | Failure | Mitigation |
|---|---|---|
| Graph as ontology | A graph node or edge is treated as the in-life object or relation. | Recover the dependency structure and the exact relations, then use the patterns that define or test them before graph expression. |
| One-edge-fits-all | depends on carries parthood, order, representation, source use, evidence, and influence at once. | Split the relation kinds and name the pattern that defines or tests each one. |
| External influence as parthood | Supply, measurement, teaching, source use, or control is drawn as a component relation. | Use the exact boundary-crossing, evidence, source-use, publication-use, transformation, supply, or control relation and its defining pattern. |
| Design-description and run-occurrence collapse | A planned dependency graph is treated as evidence of performed work. | Separate design description, work occurrence, and evidence relations. |
B.1.1:7 - Conformance Checklist
| Check | Requirement |
|---|---|
CC-B1.1-1 | A dependency claim names the relation kind before graph notation is relied on. |
CC-B1.1-2 | Graph, matrix, table, or diagram wording is treated as a mathematical or representation expression unless an exact structure relation makes that expression the structure under concern. |
CC-B1.1-3 | Part-whole edges use A.14 and C.13 discipline. |
CC-B1.1-4 | Boundary-crossing, transformation, evidence, source-use, publication-use, and representation relations are not recast as parthood. |
CC-B1.1-5 | Design description, run occurrence, and evidence are not mixed; the record names their separate patterns and uses a DesignRunTag or equivalent scope discipline when needed. |
CC-B1.1-6 | Graph checks are interpreted only through the selected relation’s defining or testing rule and C.29 when the mathematical lens is relied on for the current claim. |
B.1.1:8 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Symptom | Repair |
|---|---|---|
| DependencyGraph as ontology | The graph is treated as the thing being built. | Name the dependency structure and exact relations first. |
| External supplier as part | A supplier or infrastructure system is drawn inside the product. | Use the exact boundary-crossing, supply, commitment, evidence, publication-use, source-use, or other direct relation; use parthood only for admitted parts. Use A.6.C only when the source’s contract wording itself must be unpacked. |
| Mapping as parthood | A model, dashboard, or digital twin is a node inside the asset. | Use the exact representation, publication, architecture-description, or evidence relation. |
| Order as component | A subsequent step is represented as a component of an earlier step. | Use the pattern that defines the order, method, description, or Work-occurrence claim. |
| Acyclicity as adequacy | The graph has no cycles, so the model is accepted. | Check whether the selected relation is grounded and whether graph checks answer the current concern. |
B.1.1:9 - Consequences
Positive consequences:
- Dependency views become useful without becoming hidden ontology.
- External influences can be discussed without corrupting parthood.
- Graph checks keep their value and their limits.
- B.1 aggregation receives cleaner part-whole inputs.
Costs:
- A diagram alone is no longer enough; relation kinds and the patterns that define or test them must be named.
- Some compact dependency graphs need multiple relation layers or views.
- Graph-based checks may need C.29 when the mathematical lens is relied on.
B.1.1:10 - Rationale
Dependency language is useful exactly because it is broad. That breadth is also the danger. FPF keeps the breadth for recognition, then restores precision by separating relation kinds, selected structures, mathematical expressions, and publication forms.
B.1.1 therefore does not abolish dependency graphs. It makes them honest: a graph represents a selected relation structure; each direct relation is grounded by the facts and rule that make it obtain.
B.1.1:11 - SoTA-Echoing
| Source line | Practical implication for this pattern |
|---|---|
| Systems engineering dependency modeling | Dependency views are useful only when edge meaning is declared and traceable to the current engineering concern. |
| Graph theory and mathematical-lens practice | A graph property applies to the graph expression; it bears on the object only through an admitted mapping to the selected relation. |
| Applied ontology relation discipline | Part-whole, collection-specific belonging, representation, evidence, source-use, and influence relations have different admissibility conditions. |
| FPF design-description and run-occurrence distinction | A design dependency expression and a performed-Work occurrence use separate patterns and evidence. |
B.1.1:12 - Relations
- Builds on:
B.1,A.1,A.14,C.13, andA.6.5. - Coordinates with:
A.15.1for work occurrence,B.1.4for contextual and temporal aggregation,C.29for graph as mathematical lens,A.22andC.30for selected structure and architecture,C.30.ADandC.30.AD.BAfor architecture description and digital-twin cases. - Can contribute evidence to:
B.2when dependency evidence bears on whole reidentification after existing-whole explanations fail.
B.1.1:End
B.1.2 - Coordinate Decisions About System Aggregation and Delimitation
Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative
B.1.2:0 - Use This When
Use this pattern when one exact entity recognized under the already admitted U.System kind, or one exact entity still being evaluated under A.1 for that kind, is being considered as a whole and an engineering decision depends on coordinating its independently governed part-whole, delimitation, crossing, function/bearer, and whole-characteristic claims.
Typical moments:
- a machine, plant, robot, vehicle, building asset, service organization, or operating unit is proposed as a whole assembled from exact constituents;
- a system-level characteristic is to be rolled up from constituent characteristics;
- a supply, signal, measurement, control, source, publication, evidence, or transformation relation is being mistaken for a part relation;
- a functional element must be distinguished from and allocated to physical, organizational, software, or operational bearers;
- a named decision needs one recoverable view of the system boundary, exact crossings, and compatibility choices without turning that view into the system.
First useful move. Name the exact whole and its A.1 recognition status, the decision being made, and each load-bearing claim. For every claim, select its subject pattern and either recover the exact result or state the exact missing governor or information. Only then ask whether their joint organization itself changes the named decision.
What goes wrong if missed. System aggregation becomes a drawing exercise. Ports, suppliers, documents, digital twins, dashboards, source records, and measuring instruments become components by placement. Functional elements become physical parts by label. External change or measurement is read as containment. One convenient record then appears to establish all those unrelated facts.
What this buys. B.1.2 coordinates one engineering aggregation decision while leaving system recognition, exact parthood, assembly, delimitation, crossing, function, bearer, characteristic, evidence, description, representation, and decision claims with their subject patterns.
Not this pattern when.
- If the exact entity has not yet been evaluated under the already admitted
U.Systemkind, useA.1; do not promote the proposal into a durable kind-like label. - If one exact part-whole relation is the question, use
A.14and its direct specialization. - If constructive assembly grounding is the question, use
C.13. - If the question is a functional claim, use its direct behavior or realization predicate; use
A.6.Fwhen the function wording is unresolved andC.30.ASVwhen architecture-view conformance is needed. - If bearer allocation or parthood is the question, use the direct allocation or part-relation pattern; use
A.6.Monly when module or interface wording needs repair. - If a mathematical aggregation lens is the question, use
C.29. - If the question is project system-of-interest designation, system-role assignment, Work, transformation, service or access, evidence, description, or publication, use that subject pattern; B.1.2 neither identifies nor defines those relations.
B.1.2:1 - Problem Frame
B.1.2 specializes B.1 for system holons, but it is a coordination method rather than the source of one omnibus system-aggregation relation. The useful engineering question is which exact independently governed facts must be considered together for one aggregation or delimitation decision.
Keep five frequently collapsed objects distinct:
- The exact system whole. It is independently recognized under A.1 and its direct identity rule.
- Its environment. In this pattern,
environmentmeans the exact external referents and exact crossing relations made relevant by a stated delimitation and use. It is not a generic surrounding object; an exact medium is named separately when that medium is itself the subject. - An actual containing system. The larger system of which
Sis an admitted part exists for this claim only when an exact part-whole relation independently obtains. Interaction or spatial surrounding is not enough. - The project system-of-interest. Project designation or selection is a separate claim from
U.Systemidentity, environment, parthood, system-role kind or assignment, and architecture. B.1.2 does not derive it from a box or aggregation decision. - Use qualification and neighboring relations.
Contextis not one world-side container supplied by B.1.2. When claim scope, effective reference scheme, or a bounded model-use structure qualifies a use, recover that exact qualifier under its subject pattern. Recover any system-role assignment or other neighboring relation separately. None delimits the system, identifies its environment, or establishes containment by itself.
For a system-aggregation decision, use :4.1 to recover the system, parthood, delimitation, crossing, and whole-characteristic results or their blockers. Use :4.2 only when their joint organization changes that decision.
B.1.2:2 - Problem
Without B.1.2:
- Boundary by drawing. A box in a diagram is accepted as system delimitation.
- External relations become parts. Suppliers, grids, sensors, controllers, teachers, measuring instruments, or digital twins are placed inside the system because they interact with it.
- Functional and physical structures collapse. A resistor symbol, control function, chassis function, or service label is treated as a physical component by name alone.
- Whole-level characteristics lack grounding. Mass, capacity, reliability, safety, throughput, assurance, or agency-like characteristics are rolled up without saying which bearers, relations, and scales support the claim.
- Transformation becomes containment. A tool, teacher, actuator, script, or controller changes a holon and is then treated as its part or containing whole.
- Coordination record becomes ontology. One aggregate-shaped record silently creates systemhood, parts, boundary, crossings, allocation, evidence, and representation instead of pointing to independently governed facts.
B.1.2:3 - Forces
| Force | Tension |
|---|---|
| Engineering concreteness vs broad FPF holon scope | System aggregation must be practical for systems without making all holons systems. |
| Delimitation vs external dependency | A named use needs an exact system boundary while critical relations can cross it and remain external. |
| Component structure vs functional structure | Physical or organizational bearers may realize several functions, and one function may require several bearers. |
| Conservative roll-up vs redundancy | Weakest-link and conservation checks are useful, but redundancy or substitution may require B.2 whole reidentification. |
| Description vs in-life system | Diagrams, BIM models, digital twins, and dashboards describe systems; they are not the system by appearance. |
| Coordination vs ownership | One decision may need many direct facts, but the coordinating pattern must not become the source of all those relations. |
B.1.2:4 - Solution
Use B.1.2 to coordinate one named system-aggregation or delimitation decision across independently governed results. Do not introduce SystemAggregationRelation@Context, HolonDelimitationRelation@Context, HolonBoundaryCrossingRelation@Context, or another record-shaped relation merely to hold the answers together.
B.1.2:4.1 - Recover Each Direct Result Or Blocker
| Working question | Subject pattern | Exact result or stop |
|---|---|---|
| Which exact whole is being considered? | A.1 and the kind-specific recognition pattern | One exact entity recognized under the already admitted U.System kind; or the exact entity, six constructive components, kind-specific condition, and `true |
| Which constituents are parts, portions, phases, or members, and how do they assemble? | A.14, the exact part-relation specialization, and C.13 for constructive assembly grounding | Exact obtaining part-relation occurrences and the assembly they support; otherwise the missing direct governor, participant identity, obtaining fact, or assembly basis. |
| Which facts and selected boundary-use claim delimit the system for this decision? | A.1 for system identity; A.14, the exact part-relation specialization, and C.13 for parthood and assembly; every exact crossing-relation pattern for external participants; C.11 for a local choice among already available boundary readings; C.32.PAD for a post-synthesis architecture decision concerning exact project Work; C.2.1 only for a separately persistent claim | First return exact identity, obtaining parthood and assembly, and crossing facts. If those facts answer the question, stop. If the named use additionally selects a boundary reading, return the C.11 ChoiceResult or C.32.PAD ArchitectureDecisionRelation@Project that makes its inclusion, exclusion, identity-preservation, and use claim current. Another choice branch passes only after its admitted direct decision predicate, source, and result are named; otherwise return the exact missing predicate or defining pattern, participant, obtaining fact, decision governor, or information blocker. When durable reliance is needed, one separate C.2.1 episteme states that claim and cites its basis; it creates none of the world facts. A selected U.Structure remains a separate B.1.2:4.2 branch. |
| Which relation crosses the selected boundary? | The direct source, supply, flow, coupling, control, measurement, evidence, publication, transformation, commitment, or other relation pattern; F.9 only for a needed semantic correspondence or difference between two exact F.17 local senses from different semantic contexts | One exact obtaining relation occurrence with its participant bindings and direct predicate; otherwise the missing governor, endpoint, binding, or obtaining fact. |
| Which function is realized by which bearer? | The direct behavior, realization, allocation or parthood pattern; A.6.F or A.6.M only for unresolved wording; C.30.ASV only for architecture-view qualification | Recover the functional claim, admitted bearer and independently obtaining realization/allocation and parthood relations; otherwise identify the missing predicate, participant or defining source. |
| Which whole-level characteristic is claimed? | C.16, A.19, and C.29 when a mathematical lens is used | Exact bearer, characteristic, assignment or value, scale, threshold or aggregation relation, and lens-use boundary; otherwise the missing bearer, scale, relation, or evidence. |
| Which evidence, description, representation, or publication supports inspection? | A.10, B.3, C.2.1, C.29, E.17, and the exact source or architecture-description pattern | The exact episteme and exact evidence, assurance, description, representation, source-use, or publication relation; otherwise the missing identity, relation, applicability, or reliance basis. |
Naming those results together does not create a further world-side relation. Stop at the first direct blocker that prevents the named decision; do not weaken it into an aggregate-shaped placeholder.
B.1.2:4.2 - Select A Structure Only When The Joint Organization Matters
If the joint organization of several exact results itself changes the named decision, select one ordinary U.Structure under A.22. Recover all four identity discriminators: exact independently identified constituents, exact selected obtaining relation occurrences, exact constraints as applied, and one named selection-use frame with its admissible action or stop.
The selected structure is non-agentive. It creates no system, part, crossing, allocation, characteristic, evidence, or decision fact and does not become the system, its environment, or its containing whole. A box, list, graph, table, description, view, or publication can represent or describe the selected organization but supplies none of the four discriminators by form.
B.1.2:4.3 - Make Interface Choices About Exact Crossing Relations
When the aggregate exposes, namespaces, internalizes, excludes, or leaves a crossing with its subject pattern, make that choice about one exact crossing-relation occurrence and one named use. These words are ordinary decision options, not a closed FPF enumeration and not another relation kind.
Name the direct world facts, affected endpoints, exact crossing predicate and occurrence, preserved obligation or information, evidence if relied on, and the C.11 ChoiceResult or C.32.PAD ArchitectureDecisionRelation@Project that chooses among the ordinary interface options when its exact predicate applies. A different choice passes only after its exact subject assertion, predicate, and result are named; otherwise stop with the established missing-governor blocker, whose content identifies the absent exact predicate source. If a later use must inspect the choice, identify a separate C.2.1 episteme whose claim content describes it and cites that direct result; the episteme does not make the crossing, parthood, compatibility, or decision fact obtain. This preserves interface accountability without an omnibus compatibility-check object. Without that account, an apparent simplification can silently drop an external obligation or proliferate unmanaged endpoints.
B.1.2:4.4 - Whole-Level Characteristics
Roll up system-level characteristics only after the exact bearer, characteristic relation or assignment, scale, and aggregation or inference rule are selected under their subject patterns.
Useful families include:
- additive quantities such as mass, cost, energy stock, or material amount;
- limiting quantities such as pressure rating, weakest connector, safety class, or availability bottleneck;
- logical or capability claims such as emergency-stop availability or vulnerability exposure;
- architecture characteristics that depend on selected structure.
Use C.16, A.19, and C.29 when characteristic space, scale, threshold, or mathematical lens is relied on for the current claim. Use B.2 when redundancy, closure, or coordination creates or reveals a whole that must be reidentified.
B.1.2:4.5 - Functional Elements And Bearers
A functional element in a functional view is not automatically a system part. Recover the functional claim and its intended behavior, the exact bearer under its own kind and identity rule, the independently established realization or allocation relation, and any obtaining parthood relation. C.2.1 identifies a claim episteme when one must be cited; C.30.ASV qualifies an architecture structural view when that is the use.
Use A.6.F only to resolve an unclear function expression and A.6.M only to resolve module or interface wording. Neither pattern admits the bearer or establishes allocation or parthood. One bearer can realize several functions and one function can require several bearers when the direct domain relations support those claims.
B.1.2:5 - Archetypal Grounding (Worked Cases)
B.1.2:5.1 - Pump Skid
A pump skid may be one exact entity proposed for recognition under the already admitted U.System kind. Pumps, frame, valves, controller, and connectors become its components only when their exact A.14 part-relation occurrences obtain and C.13 grounds the assembly; the proposal, drawing, and component list establish none of those facts.
The power grid, maintenance crew, telemetry dashboard, and supplier are not skid components merely because the skid depends on them. Recover the exact systems or epistemes and their supply, work, telemetry, publication, source-use, or other direct relations. If a maintenance-isolation decision needs their joint organization, an A.22 selected structure may include the exact obtaining crossings without turning them into parts.
Concrete coordination result. In an illustrative component-inventory case, skid S is already recognized under A.1. Inspection and assembly evidence have established the A.14 component relations of pump P, frame F, valve V and controller C to S, with the C.13 assembly basis. The inventory is complete for this example. A documented electrical-supply relation has grid G as source and S as receiver; dashboard D is an episteme describing S. These independently supplied facts are the inputs to the decision, not conclusions inferred from the drawing.
For the question “Which of these objects belongs in S’s component inventory?”, B.1.2 returns P, F, V and C, retaining each part relation’s basis. G remains an external supply participant and D remains a description. The inventory establishes no total mass, reliability or safe-isolation conclusion: each would need its own characteristic rule or decision basis. If inspection instead leaves V’s part relation unresolved, return the three established components and that specific gap; do not present the inventory as complete. Changed assembly or supply facts reopen the affected result.
B.1.2:5.2 - Resistor In A Circuit
A resistor symbol in a circuit diagram is a functional or design-description element. The physical bearer may be a packaged resistor, a length of wire, a transistor region, or a module. Recover the exact function, bearer, allocation or correspondence, and any part relation separately; B.1.2 only coordinates them for the current circuit decision.
B.1.2:5.3 - Digital Twin Of A Building Asset
A BIM model, asset register, dashboard, or digital twin may describe the built asset and its systems. It is not the asset’s part by being linked in a model. Use architecture-description, publication, evidence, source-use, representation, and naming patterns for the description side; use exact part-relation patterns only for admitted system parts of the built asset.
B.1.2:5.4 - Lathe And Workpiece
The lathe can change the workpiece through a bounded transformation and work occurrence. Those facts do not make the workpiece a lathe component or make the lathe the larger whole containing it. Use A.3.4, A.15.1, A.12, and the exact crossing or participation pattern; use part-whole only when an exact relation independently obtains.
B.1.2:5.5 - Bias-Annotation
| Bias risk | Failure | Mitigation |
|---|---|---|
| Box as ontology | A diagram boundary becomes system delimitation by appearance. | Name the exact system and obtaining part and crossing relations. Stop if they answer the question. If a distinct use-relative boundary choice remains, name the C.11 ChoiceResult, C.32.PAD ArchitectureDecisionRelation@Project, or another explicitly admitted direct result; otherwise stop with the missing-governor blocker. Use an A.22 selected structure only when its four discriminators are independently grounded. |
| Interface as part | Supply, signal, measurement, control, publication, or evidence relation becomes a component. | Recover the exact crossing occurrence under its subject pattern and keep it separate from parthood. |
| Function as bearer | A functional block or symbol is treated as a physical or organizational component. | Recover function, bearer, allocation or correspondence, and any parthood claim separately. |
| Description as system | BIM model, dashboard, digital twin, register, or source record is treated as the system. | Use description, representation, publication, evidence, source-use, and naming patterns for the description side. |
| Transformation as containment | A tool or teacher changes a holon and is read as its part or containing whole. | Use A.3.4, A.15.1, A.12, and the exact participation or crossing pattern; require a separately obtaining part-whole relation for containment. |
| Coordination as ownership | A convenient B.1.2 record is treated as the source of all named facts. | Use its subject pattern for every row; select an A.22 U.Structure only when the organization itself changes the decision. |
B.1.2:6 - Conformance Checklist
| Check | Requirement |
|---|---|
CC-B1.2-1 | The exact whole is already recognized under the admitted U.System kind, or the exact entity and unresolved A.1 recognition result or blocker are stated without promoting the proposal into a kind-like label. |
CC-B1.2-2 | The named decision, exact system identity, and exact obtaining part and crossing relations are recoverable under their subject patterns. When a distinct use-relative inclusion/exclusion choice is claimed, it cites the applicable C.11 ChoiceResult, C.32.PAD ArchitectureDecisionRelation@Project, or another explicitly admitted direct result; without that predicate, source, and result it returns a missing-governor blocker. Any durable C.2.1 episteme states but does not create those facts. An optional selected structure separately satisfies all four A.22 discriminators. |
CC-B1.2-3 | External supply, signal, control, measurement, source, publication, evidence, transformation, or coupling claims retain exact participant bindings and direct relation patterns; none becomes parthood by crossing or importance. |
CC-B1.2-4 | Functional elements, bearers, allocation or correspondence, and any physical or organizational parthood are identified separately. |
CC-B1.2-5 | A whole-level characteristic names its exact bearer, characteristic relation or assignment, scale, aggregation or inference rule, evidence, and mathematical-lens boundary when current. |
CC-B1.2-6 | Changing, controlling, teaching, measuring, or repairing another holon does not make that holon a part of the acting system; any containing-whole claim has its own exact part-whole relation. |
CC-B1.2-7 | Description artifacts, models, dashboards, digital twins, and registers remain distinct from the system holon and from any selected structure they describe. |
CC-B1.2-8 | Any coordinating U.Structure has all four A.22 discriminators and remains non-agentive; otherwise the results stay a direct plurality. |
CC-B1.2-9 | Environment, containing system, project system-of-interest, and any claim or model-use qualifier remain separately identified; Context is not used as their common owner. |
B.1.2:7 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Symptom | Repair |
|---|---|---|
| Box as boundary | A diagram rectangle determines system membership. | Recover system identity and every obtaining part and crossing relation; stop if those facts answer the question. If a distinct use-relative boundary choice remains, name the applicable C.11 ChoiceResult, C.32.PAD ArchitectureDecisionRelation@Project, or another explicitly admitted direct result; otherwise stop with the missing-governor blocker. Add a C.2.1 episteme only when that claim must persist; use an A.22 selected structure only when its four discriminators are independently grounded. |
| Supplier as component | External supplier or grid is treated as part of the system. | Recover the exact supply, commitment, evidence, source-use, or other crossing relation under its subject pattern; infer no parthood. |
| Function block as module | A functional block is treated as a physical component. | Recover the exact functional element, proposed bearer, allocation or correspondence, and any obtaining part relation separately. |
| Digital twin as part | A model or dashboard appears inside the system aggregate. | Use description, representation, publication, evidence, source-use, and naming patterns; add parthood only if its direct predicate independently obtains. |
| Redundancy as arithmetic | Redundancy is averaged into a better system score. | Check characteristic scale and existing-whole explanation; use B.2 when the whole must be reidentified. |
B.1.2:8 - Consequences
Positive consequences:
- System aggregation remains practical for engineering systems and organizations.
- Boundary and interface concerns become explicit subject-pattern work without omnibus relation or check objects.
- Functional architecture, module allocation, and physical parthood stop collapsing into one diagram.
- Digital-twin and publication artifacts stay on the description side unless an exact stronger relation predicate is defined and current facts satisfy it.
Costs:
- Engineering diagrams used for decisions need annotations that name the exact relation and its defining pattern or declaration.
- Some familiar component lists must be split into physical parts, functional elements, external systems, sources, and descriptions.
- Whole-level characteristic claims need scale and relation discipline.
B.1.2:9 - Rationale
System aggregation is the place where holonic thinking is most tempting and most useful. It is also where false parthood is easy: anything connected, measured, represented, or controlled can be drawn inside a system box.
B.1.2 preserves the engineering payoff by coordinating exact subject-pattern results for recognition, parthood, assembly, delimitation, crossings, function, bearer, characteristic, evidence, and description. It selects one ordinary A.22 structure only when their joint organization changes the named decision.
B.1.2:10 - SoTA-Echoing
| Source family | Current lesson for B.1.2 | FPF decision |
|---|---|---|
| Systems engineering and digital engineering practice | System breakdowns, interfaces, allocations, views, and digital twins must be coordinated but not identified with one another. | B.1.2 coordinates their exact subject-pattern results and uses A.22 only when one selected organization changes the decision. |
| Reliability and safety engineering | System-level claims need conservative relation and scale discipline. | Whole-level characteristic roll-up requires C.16, A.19, and C.29 when those claims are relied on for the current use. |
| Applied ontology and constructional mereology | External dependence and part-whole construction are different relations. | Crossing relations do not become parthood; A.14 and its direct specializations govern exact part relations, while C.13 may ground the assembly they support. |
| Holonic and cyber-physical systems practice | Coordination and closure can create useful whole-level objects. | B.2 is the pattern for whole reidentification when existing system aggregation is insufficient. |
B.1.2:11 - Relations
- Builds on:
B.1,A.1,A.14,C.13,A.22, and the direct relation patterns selected for the current decision. - Coordinates with:
A.6.Ffor function wording,A.6.Mfor module/interface wording, direct subject patterns for bearer identity and allocation,A.22andC.30for selected structure and architecture,C.16andA.19for characteristics,C.29for mathematical lenses,A.3.4andA.12for transformation and acting-side externalization, andC.30.ADorC.30.AD.BAfor architecture-description cases. - Can contribute evidence to:
B.2when system aggregation no longer explains the whole-level claim and whole reidentification is needed.
B.1.2:End
B.1.3 - Knowledge Aggregation (Γ_epist): Synthesis and Target-Scheme Compilation
At a glance. Use B.1.3 to compose exact U.Episteme inputs into one knowledge aggregate while preserving provenance, conceptual fit, context, and the warrant each source actually contributes.
Use this when. Use this pattern when a named synthesis or compilation use depends on how claims, models, datasets, or arguments are combined, and the aggregation must keep source, mapping, conflict, order, and temporal qualifications inspectable.
Not this pattern when. Use C.2.1 for episteme identity and edition continuity, A.14 for a proper temporal restriction of one unchanged episteme, A.15.1 for Work parts or occurrences, B.1.4 for a bounded aggregation of already recovered order or temporal relations, and B.3 for the assurance claim that consumes the aggregate.
What changes in practice. Identify the target claim, each input’s support role and dependencies before combining them. Return a justified calculation or a reasoned synthesis with its limitations; preserve provenance and conflicts. Return identity, edition, temporal restriction, Work, publication, and assurance questions to their subject patterns.
► decided‑by: A.14 Advanced Mereology A.14/C.2.1 compliance — Use ConstituentOf for semantic parts and PortionOf only for quantitative splits of texts/data with declared μ. Use
PhaseOfonly for a proper interval of one unchanged C.2.1 episteme. When a MethodDescription or document episteme’s claim content, EntityOfConcern, or effective ReferenceScheme changes, identify another episteme and assertEpistemeEditionRelationonly when its historical-continuation predicate obtains. Work segmentation uses A.15.1; no ComponentOf is used here.
Plain‑English headline. Γ_epist composes epistemic holons (claims, models, datasets, arguments) into a single episteme while preserving provenance and distinguishing the support, limitations, and conceptual mappings on which its conclusion depends. B.3 governs the meaning and model of any assurance calculation. This is a semantic and evidential composition, not a physical sum or a universal confidence fold.
B.1.3:1 - Problem frame
- Holonic foundation. In the FPF, a
U.Epistemeis a holon whose identity is knowledge-bearing (A.1). It can be a statement/claim, a model, a theory, a specification, a dataset with semantics, or a compiled claim-bearing synthesis. - Strict Distinction (A.7). We separate: structure (what the episteme comprises), order (argument flow), identity and history (C.2.1 identities and edition relations), proper temporal restriction (A.14), work (what was spent to produce/validate it), and values (objectives/criteria). Γ_epist stays in the structure/semantics lane and calls out to Γ_ctx/Γ_time/Γ_work only after their direct inputs are recovered.
- Mereology (A.14). For knowledge composition we primarily use ConstituentOf (logical or semantic parts), UsageOf or ReferenceTo (external reliance), and each collection’s own belongs-to rule for collections such as anthologies or corpora. We do not use ComponentOf (physical) in Γ_epist.
PhaseOfmay restrict the same unchanged episteme to a proper interval when its complete C.2.1 identity triple remains fixed. Distinct labelled versions or revisions require distinct C.2.1 identities when a discriminator changes and an independently obtainingEpistemeEditionRelationfor any claimed historical continuation. Knowledge does not act and acquires neither a work-facing local system-role kind nor an assignment. Ordinary prose may say, for example, “the researcher synthesized the sources”. If the receiving use does not identify that action as one particular datedU.Workoccurrence, stop with the ordinary sentence. If it does, recover each actual performer’s A.13 core and independently admit the occurrence under A.15.1. Add F.6 only when the receiving use also needs precise assignment-bound attribution; a short local projection may omit an unused assignment identifier only when every consumed relation remains recoverable. - Assurance (B.3). Keep F (Formality), G (ClaimScope), and R (Reliability) distinct. Identify the meaning, scale, and receiving use of each value before calculating with it. A mapping’s CL summarizes one relation’s fit; its ordinal rank is not a numerical loss of reliability. Preserve provenance and make any unsupported inference or semantic crossing visible. Formality or mode does not supply a missing warrant model.
- Order/time flavours. Argument sequences may need Γ_ctx (non-commutative ordering of premises to conclusion). Knowledge evolution first uses C.2.1 to identify exact epistemes and any obtaining edition relations; B.1.4/Γ_time may then aggregate already recovered temporal restrictions, relation order, deprecation, or update windows for a bounded use. The aggregation creates neither identity nor continuity. Open B.2 only if the synthesis leaves a genuine whole-reidentification question after the existing-whole explanation check and identifies an exact candidate new whole; new wording or explanatory gain alone is not MHT.
B.1.3:2 - Problem
Naive aggregation of knowledge holons causes recurring failures:
- Unsupported confidence folds. Averaging incomparable scores can hide conflict; a compulsory minimum can discard useful complementary support or overstate the probability of several necessary conditions. Both violate B.3 when their inputs and dependency model are unjustified.
- Provenance erasure. Merges that drop sources, methods, or links break A.10 Evidence Graph Referring and make results unauditable.
- Semantic drift. Folding across mismatched concepts without explicit mappings (and their CL) yields incoherent composites that look formal but mean nothing.
- Order blindness. Arguments with essential dependency order (premise ⇒ lemma ⇒ conclusion) are treated as sets; non‑commutativity is lost and results become non‑reproducible.
- Semantic-context chimeras. Combining claims whose local senses or reference schemes differ, without exact mappings and—when meanings cross—an F.9 Bridge plus a separately warranted bounded-use claim, silently corrupts claims and inflates R.
- Category errors. Applying a physical quantity’s addition rule to truth, or averaging ordinal formality, ignores the value’s meaning and scale. Use C.16 for admissible scale operations and B.3 for the warranted support inference.
B.1.3:3 - Forces
| Force | Tension |
|---|---|
| Conservatism vs. Synthesis | Refuse unsupported assurance gains ↔ retain the real contribution of complementary and alternative support. |
| Universality vs. Domain nuance | One operator across math, science, engineering specs ↔ domain‑specific semantics and evidence patterns differ. |
| Provenance fidelity vs. Cognitive load | Keep the full trail of sources and methods ↔ avoid overwhelming authors with bookkeeping. |
| Order/time discipline vs. Flow | Respect argument order, exact episteme identity and edition relations, and any proper temporal restriction ↔ keep composition usable for day-to-day synthesis. |
| Parsimony vs. Fit | Small rule set (A.11) ↔ explicit mappings, use-specific limitations, and justified loss models where needed. |
B.1.3:4 - Solution — Terms, operator family, invariant Standard, core rules
B.1.3:4.1 - Terms (didactic recap)
- U.Episteme — a claim-bearing knowledge holon. C.2.1 identifies it through the participant-determined
EpistemeConstitutionRelationover<claim content, exact EntityOfConcern, effective ReferenceScheme>.ClaimGraphSlot,EntityOfConcernSlot, andReferenceSchemeSlotname participant meanings only inside that relation’s reusable declaration; they are not internal slots of the episteme. Empirical grounding uses the separateEpistemeEmpiricalGroundingRelation, while text, code, figures, datasets, SCR/RSCR references, publication forms, and presentation carriers remain separately governed provenance, representation, publication, or carrier material. - Evidence/Provenance Graph — an A.10 descriptive account whose edges cite independently established direct support, source, measurement or use relations. Display labels such as
evidencesdo not create generic relation kinds. - Semantic mapping — the exact correspondence rule used by this composition. When it crosses semantic contexts, identify the source and receiving F.17
SchemeSenseCellvalues and an obtaining F.9Bridge; keep the proposed use, direction, use-specific rule, permitted loss, reliance, and CL evidence summary separate. F.9 does not require CL for every Bridge; B.1.3 requires the summary for a mapping used in its support account. CL alone neither grants the use nor supplies a numerical penalty. - SCR — a
U.SCRthat lists all symbol carriers included in the aggregate; never dropped. - Semantic context — Plain shorthand for the local interpretation basis recovered from one exact F.17
SchemeSenseCellas<ReferenceScheme, LocalSenseClaim>. It is not another operation argument or entity. Crossing between two such contexts uses F.9 and the separate bounded-use and reliance steps above.
Didactic reminders. • Knowledge does not act. A researcher or engineer may use it while performing Work. Recover the exact System and Work only when the receiving claim consumes them; use A.12 only when the acting-side distinction is itself current. • A collection’s own rule establishes which epistemes belong to it; belonging is not a semantic argument link and does not by itself make a holon. Use ConstituentOf for logical or evidential composition. •
PhaseOfis only a proper temporal restriction of one unchanged episteme. Changed C.2.1 discriminators identify another episteme; testEpistemeEditionRelationseparately. Use MHT only for a remaining whole-reidentification question, not as a substitute for C.2.1 identity.
B.1.3:4.2 - The operator family (companion flavours)
To keep design vs run clean (A.15), Γ_epist has two companion flavours that share the same algebra but answer different semantic questions. Their declarations contain only the values on which the result depends. A performer, local system-role kind, or assignment is therefore not an operator argument: the same fold can be specified before staffing and can be applied in Work performed by different Systems without changing its result semantics.
When one particular operation application matters, use A.6.1 for that application and its argument and result bindings. A practitioner sentence may still say “the engineer compiled the guidance”. If no particular dated U.Work claim is current, that ordinary sentence needs no classification or assignment apparatus. If one is current, recover every actual performer System’s A.13 core and independently admit the Work under A.15.1 from its performance history, enacted Method, temporal extent, and containing System. Add F.6 afterward only when precise assignment-bound attribution is current. A short B.1.3 projection may omit an assignment identifier unused by its receiver only when every relation it consumes remains recoverable. An operation result binding says which value the application returned; it establishes neither production nor first existence of that value, publication, release, acceptance, nor a carrier. Open A.15.PROD or the publication patterns only when one of those separate questions is current.
Synthesis (design-time semantic fold). Compose exact input epistemes into a draft aggregate.
Γ_epist^synth : ( D_know : DependencyGraph< U.Episteme > ) → U.Episteme
- Domain.
D_knowdesignates exact source epistemes and the governed ConstituentOf, UsageOf, ReferenceTo, evidences, derivesFrom, and collection-specific belongs-to relations that obtain among them, together with the mappings used by the fold. The graph represents those objects and relations; it does not make them obtain. - Result. One synthesized episteme whose claim content, exact EntityOfConcern, and effective reference scheme satisfy C.2.1. Its ClaimGraph integrates the retained content; provenance and SCR keep contributing sources and carriers traceable. State its formal basis, scope, and supported conclusion with limitations. Calculate an aggregate R only where B.3 and C.2.2 establish the input meanings, scales, and dependency model. Otherwise keep support separate and return a bounded reasoned synthesis. Neither a higher formality level nor an axiomatic mode requires an invented numerical score or an irrelevant empirical study.
Compilation (target-scheme fold). Map one synthesized episteme into one exact target reference scheme.
Γ_epist^compile : ( E_synth : U.Episteme,
TargetScheme : U.ReferenceScheme ) → U.Episteme
- Domain. One synthesized episteme and the exact target reference scheme used to read the compiled claims—for example, the scheme used by a journal, standard, or program specification. For every meaning that crosses semantic contexts, the fold also relies on exact source and receiving
SchemeSenseCellvalues, an obtaining F.9 Bridge, and a separately stated bounded-use claim; any relied-on use must pass A.10 or B.3. - Result. One compiled, target-scheme episteme with explicit mapping and loss information and a C.2.1 identity determined by its claim content, exact EntityOfConcern, and effective reference scheme. The result is not thereby a publication, release, carrier, or accepted artifact.
Relationship to Γ_ctx / Γ_time. If the knowledge fold explicitly depends on argument order (for example, a derivation), the internal fold uses Γ_ctx for the sequence. If a temporal storyline matters, first identify each exact episteme and any obtaining C.2.1 edition relation; then use B.1.4/Γ_time to aggregate only the recovered temporal restrictions, relation order, or applicability windows required by the use. Γ_epist composes exact selected episteme inputs, not a label-defined current slice. If the result changes claim content, EntityOfConcern, or effective reference scheme, C.2.1 identifies another episteme. Use B.2 only when exact construction facts leave a separate existing-whole versus candidate-new-whole question.
B.1.3:4.3 - Invariant Standard (how the Quintet applies)
- IDEM (singleton identity and source-repetition discipline). Folding a single episteme without a change of claim or scheme returns itself. Repeating the same source or data creates no additional evidence or accidental assurance upgrade.
- COMM/LOC (Local commutativity / locality). Reordering genuinely independent contributions does not change a result under its declared model. A derivation or other order-dependent argument uses Γ_ctx; source order does not establish statistical independence.
- WLNK (Weakest-link bound). An unsupported indispensable premise limits the conclusion that needs it. A numerical minimum is appropriate only when the named quantity and dependency model justify a bottleneck or lower-bound interpretation. WLNK does not impose minimum over every cited source or every argument.
- MONO (Monotonicity). A monotonicity claim names the support change and the model under which it holds. Duplicate data, a contrary result, a changed target population, or the failure of a necessary assumption is not simply “more support”.
No universal reliability fold. B.3 governs the quantity, scale, dependency assumptions, and calculation. For two necessary independent conditions with probabilities 0.9 each, the conjunction has probability 0.81, not 0.9. Without independence, use a warranted conditional model or leave that joint probability unresolved. A minimum or maximum can be useful under its own declared meaning; monotonicity and boundedness alone do not establish that meaning.
Formality and calculation. Ordinal comparisons remain ordinal. A quantitative calculation requires commensurate inputs and a model for the proposed operation, including any mapping loss; a table of numbers alone is insufficient. Formal derivations state their logic and assumptions, and constructive derivations their proof basis. When no common aggregate is justified, a qualitative synthesis can still give a complete, useful answer to a bounded question.
B.1.3:4.4 - Core rules for epistemic aggregation (design‑time synthesis)
When computing Γ_epist^synth(D_know):
1. Provenance preservation. The provenance/evidence graph is unioned with de‑duplication; every claim in the aggregate remains traceable to its sources and methods. No source, method, or dataset that supports a retained claim may be dropped.
2. SCR construction. Build a U.SCR that lists all symbol carriers (texts, code, figures, datasets) that materially participate in the aggregate. Provenance nodes must be mappable to SCR entries.
3. Object alignment. Identify the result’s one exact EntityOfConcern. Reuse the same already identified entity when the inputs concern it. A governed least common ancestor in a domain taxonomy may support that identification, but the calculation does not create the entity. If the claim requires a collection, relation occurrence, or other joint subject, identify that entity under its direct pattern and show that its identity rule obtains. A list, dependency graph, shared label, or mapping cannot create a joint subject; if none is governed, stop with the missing composition governor instead of inventing a generic composite entity. Record the semantic mappings and their CL evidence summaries without silently merging homonyms.
4. Recover the support relation before combining. For the exact claim and scope, distinguish:
- Indispensable premises: the conclusion requires each named premise. A missing or defeated premise blocks that inference, not every narrower conclusion.
- Alternative sufficient arguments: each actually sufficient argument can support the conclusion; expose shared premises, datasets, assumptions, and failure causes. Different argument names do not prove independence.
- Complementary evidence: a source may constrain a rival explanation, magnitude, uncertainty, or applicability without being a necessary premise. A limited additional study need not lower the existing support.
- Different scope slices: retain their populations, outcomes, conditions, and time extents separately unless an explicit transport or combination rule supports the joint claim.
- Counterevidence: retain credible results that conflict with the proposed conclusion. Weak support, absence of decisive support, an uninformative study, and evidence against a claim have different consequences.
Deduplicate actual evidence, not just citations. Account for overlapping data and shared biases before treating agreement as additional corroboration. State what each live limitation changes in the resulting claim.
5. Compose under the receiving model, or synthesize without a score. Keep F ordinal under C.2.3; any minimum for essential formal constituents concerns that formality claim, not R. Form G through the applicable C.2.2/A.2.6 scope rules; adding a study does not by itself extend applicability. For R, name the target quantity, compatible scales, dependencies, and warranted operation under B.3/C.2.2. This can justify a bottleneck minimum, a sufficient-argument choice, a probabilistic calculation, or a statistical synthesis; none is the universal default.
For a relied-on mapping, retain its CL summary and the actual limitation. A numerical loss function needs a receiving model that establishes its meaning, units, calibration or derivation, and assumptions. An ordinal CL rank, a monotone penalty table, or clipping to [0,1] supplies none of these. If no such calculation is justified, retain the separate support and mapping limitations in a reasoned synthesis; no penalty table or new study is required merely to return that result. A receiving assurance threshold applies only to the quantity and use for which it was justified.
6. Conflict detection and disposition.
Detect contradictions, including overlapping-scope p and ¬p. Resolve a scope or interpretation difference only when the source facts establish it; do not explain away a credible contrary result by an invented subgroup story. Otherwise narrow, qualify, or withhold the affected conclusion and retain explicit conflict edges. A numerical synthesis may represent disagreement only under its justified model, not conceal it. Open B.2 only if exact construction facts leave a separate whole-reidentification question after the existing-whole explanation check.
7. Handling axiomatic and world-facing support. Retain each episteme’s declared mode and actual support:
- For an axiomatic input, empirical R may be N/A. Keep the proof, its conclusion under the stated axioms, and its formal validity;
line=formalis a useful tag, not a conversion rule. Do not set R to F. An ordinal F-derived proxy describes only its declared ordinal meaning. Any value proposed for an R calculation needs a receiving model establishing meaning, scale, conversion, and assumptions; rescaling F into [0,1] is insufficient. - For a postulative input, retain its actual warrant and empirical or other support as applicable. Apply a B.3.4 currentness or decay policy only to the support whose use consumes that policy; changing the mode creates neither evidence nor a conversion model.
- The aggregate declares its mode. If all its operative inputs are axiomatic, it is axiomatic; if an operative input is postulative, it is postulative. Keep any formal subclaim separately usable. A proof about a model supports a claim about a real system only with the needed model-to-world assumptions; evidence violating those assumptions remains visible.
- Constructive derivations. State the chosen proof basis and the correspondence needed by the conclusion. An induction proof may use its stated non-UF foundation. A UF-based equivalence claim supplies the required equivalence or isomorphism witness and the structure that the receiving theorem needs preserved. A lossy mapping cannot transport a theorem that depends on an erased distinction. If the required proof basis or correspondence is unavailable, leave that inference unresolved while retaining independently supported conclusions. A CL summary describes mapping evidence; it establishes neither equivalence nor theorem transport.
8. Order-aware arguments (optional). If the conclusion depends on premise or derivation order, identify the ordered relations and positions, declare the OrderSpec, and retain the branch, join and independence conditions needed by the argument. Use B.1.4:4 to check the bounded aggregation and its determinacy under those conditions.
9. No costs here. Any compute/collection effort is Γ_work; attach references but do not mix costs into epistemic aggregation.
B.1.3:4.5 - Core rules for target-scheme compilation
When computing Γ_epist^compile(E_synth, TargetScheme):
1. Reference-scheme bindings.
Map every operative concept, unit, and claim into TargetScheme and record the exact mapping and its CL evidence summary. For a meaning that crosses semantic contexts, name the source and receiving SchemeSenseCell values, the obtaining F.9 Bridge, the proposed use, direction, use-specific rule, and permitted loss; establish reliance separately. C.2.1 identifies the compiled episteme from its resulting claims, exact EntityOfConcern, and target scheme. A changed identity discriminator identifies another episteme; it does not by itself open a whole-reidentification question.
2. Re-express the assurance basis. Re-express F, G, and the support account in TargetScheme. Preserve the formal conclusion and empirical limitations separately. Recalculate R or a mapping loss only if the target use has the required meanings, scales, and model under B.3/C.2.2; a change of vocabulary or increased formality is not additional warrant. Without a justified aggregate, carry the separate support and bounded synthesis. A quantitative or formal application proves the calculations or derivations it actually claims, not a fictitious tuple imposed by its mode.
3. Compilation trace. Produce the compiled episteme’s SCR and the carrier hashes needed to reconstruct this application. Require independent re-hash verification when the receiving claim needs independent carrier-integrity evidence under B.3 or an applicable B.3.3 assurance profile. A level label alone does not select that check. The trace establishes neither publication nor release. 4. Order/time hooks. If the compiled episteme includes an internal derivation, carry the OrderSpec. If it selects knowledge for a time-bounded use, name the exact C.2.1 episteme identity and link to the already recovered proper temporal restriction, edition relation order, applicability window, or B.1.4/Γ_time aggregation actually used.
B.1.3:5 - Archetypal grounding (worked, didactic)
B.1.3:5.1 - Episteme — Heterogeneous evidence into a guidance statement
This is a didactic evidence-composition case, not a clinical recommendation. The receiving question concerns a treatment’s pain outcome for an identified acute low-back-pain population within six weeks. The exact population and outcome, not a label or taxonomy operation, identify the subject.
- Inputs:
E₁is a randomized trial,E₂an observational study, andE₃a mechanistic model. Retain their designs, findings, uncertainty, assumptions, and scope. A bare “R=0.84/0.55/0.60” list has no declared common quantity here and cannot support a numerical aggregate. Likewise, “medium/wide/narrow” is not a substitute for actual ClaimScope. - Synthesis: retain protocols, datasets, analysis scripts, and other participating carriers in the SCR. Establish any dosage or outcome mapping from its actual measurement basis; units named mg and IU do not themselves establish a conversion. Keep chronic cohorts and different outcomes separate unless a warranted transport relation supports the receiving claim.
- Necessary-premise case: if the proposed inference requires an outcome mapping that is unsupported, withhold that mapped inference. Retain the trial’s narrower source-scale conclusion rather than discard every source.
- Complementary case: a limited
E₂may help assess a confounding explanation left open byE₁;E₃may constrain a mechanism without establishing the clinical effect size. Explain those contributions and their limits. The minimum of three unexplained scores neither captures them nor defeats the existing trial conclusion. - Dependence case: if two reports reuse a cohort or share an outcome-measurement bias, do not count them as two independent confirmations. Different designs alone are insufficient to establish different biases.
- Contrary-result case: a credible
E₂result conflicts withE₁in an overlapping subgroup. Keep the disagreement. Different baseline severity is a possible explanation only to the extent supported by the sources. Narrow or qualify the guidance claim; do not silently average the conflict away or call it an uninformative study. - Completion: return the bounded guidance statement with its distinct supporting contributions, contrary result, scope, and unresolved interpretation. No common quantitative model has been supplied, so no aggregate R is returned. Whether another study is feasible and worth its total burden is a separate C.11/C.19.2 decision, not a condition for completing this synthesis.
Concrete completion of the case. Use the following invented findings only to illustrate the synthesis. P is the trial’s enrolled acute low-back-pain cohort; S is its identified high-baseline-severity subgroup. E₁ reports lower pain at six weeks with intervention X than with its comparator, both in P and in S. E₂ reports no such benefit in a separately observed cohort matching S; the sources have not resolved whether confounding or another difference explains the disagreement. E₃ supplies a mechanism compatible with benefit but no clinical effect estimate. No common quantitative support model is available.
The resulting guidance statement is: “The trial supports lower recorded pain at six weeks for X versus its comparator in P. The finding for S conflicts with the observational result and remains unresolved. The mechanism explains how benefit could occur but does not resolve that conflict or establish its magnitude. These sources support neither extrapolation beyond P and six weeks nor a combined reliability score.” The SCR retains all three contributions. A supported explanation of the disagreement or a corrected source result reopens the affected claim. A request for another population opens a separate question and synthesis. Identify the new claim, its subject and scope (C.2.1; A.2.6), and establish the evidence or warranted transport needed for that use. The request alone leaves the result for P unchanged. This is a completed bounded synthesis of the fictional findings, not advice to use X.
For Γ_epist^compile, map the retained claims into the journal’s scheme, carry the same limitations and any justified recalculation, and produce the compilation SCR and required hashes. C.2.1 identifies the target-scheme episteme “Guidance Statement v1.0”; later journal publication remains a separate occurrence.
B.1.3:5.2 - Episteme — Controller proof and a real protective function
- Inputs: a requirement specification, hazard analysis, test logs, and a proof of controller property P under assumptions A. Preserve each source’s actual formal basis and support. No common R scale follows from four labels or formality levels.
- Formal receiving question: “Does A entail P in the stated model?” Retain the valid proof and its assumptions as the useful result. An empirical study is not needed to turn that result into an invented empirical R; F describes checkability, not the probability that the actual controller is safe.
- World-facing receiving question: “Does the installed controller deliver the protective function in these operating conditions?” Expose the reliance on A, the implementation/model correspondence, and the actual operating scope. If A is unsupported for this use, the proof alone does not establish the world-facing claim. If logs show an edge case violating A, retain that counterevidence and withhold the stronger assurance while preserving the theorem A ⇒ P.
- Threshold case: a receiving acceptance clause requires a justified probability of at least 0.95 for the real protective function. Substituting a high F or its rescaled value cannot meet it. A declared ordinal checkability comparison remains usable as an ordinal comparison. A numerical acceptance result requires the model and evidence that warrant that particular probability; otherwise return the narrower formal conclusion and the unresolved actual-system assurance.
- Positive quantitative case: if a receiving model actually establishes two necessary independent conditions, each with probability 0.9, their conjunction is 0.81. A 0.85 threshold is not met by replacing 0.81 with min(0.9, 0.9). If independence is unavailable, the joint probability needs the actual conditional model or remains unresolved; the formal proof is unchanged.
For Γ_epist^compile, map the retained claims to the certification scheme. Where local meanings differ, identify exact source and receiving SchemeSenseCell values, test the F.9 Bridge, state the bounded certification use and permitted loss, and establish relied-on use separately. C.2.1 identifies the resulting episteme. Certification, authorization, a publication occurrence, and actual system protection remain separate claims.
B.1.3:5.3 - Contrast (didactic)
| Aspect | Knowledge composition (B.1.3:4) | System aggregation decisions (B.1.2:4) |
|---|---|---|
| What is combined? | Claims, models, datasets and arguments, with their provenance and semantic relations | Established component, material-portion and assembly facts for one engineering decision; each whole-characteristic claim uses its applicable aggregation rule |
| Conservatism | Support roles, dependence, and mapping limits under the named B.3 model; no invented aggregate | WLNK for a quantity whose physical model justifies a weakest-part bound |
| Fit | Semantic mappings and their calibration evidence, with a separately warranted receiving use | Interfaces, crossings and compatibility choices under B.1.2:4.3 and their direct relation rules |
| Order/time | Argument order; C.2.1 episteme identities and edition relations; A.14 proper temporal restrictions; B.1.4 aggregation of recovered order or temporal relations | A.15.1 for assembly Work and its temporal parts; A.14 for proper phases of enduring carriers; B.1.4 for aggregation of recovered order or temporal relations |
| Work/cost | Resources spent in synthesis, compilation or validation Work, aggregated under B.1.6 | Resources spent in assembly or operation Work, aggregated under B.1.6 |
B.1.3:6 - Proof obligations (normative)
At synthesis (Γ_epist^synth):
- PO‑SYN‑PROV. The provenance/evidence graph MUST be preserved (union with de‑duplication); every retained claim is traceable to sources/methods in the SCR.
- PO-SYN-OBJ. The result MUST name one exact EntityOfConcern already identified under its direct pattern. If the synthesis depends on several inputs as a joint subject, its collection, relation, or whole identity MUST be independently governed; a list, graph, label, or mapping is insufficient. Every semantic mapping used by the fold MUST be declared with its CL evidence summary.
- PO-SYN-CL. Every mapping used in the support account MUST retain its CL evidence summary and actual use limitation. A numerical loss MUST have a receiving model establishing its meaning, scale, derivation or calibration, and assumptions; ordinal ranks and monotonicity alone are insufficient. The summary neither establishes an F.9 Bridge nor grants use.
- PO‑SYN‑R. The result MUST distinguish indispensable premises, sufficient alternatives, complementary support, scope slices, and counterevidence where present. An aggregate R MUST have warranted input meanings, scales, dependencies, and an operation under B.3/C.2.2. Otherwise retain separate support and a reasoned bounded synthesis. Neither F nor a mode tag supplies an R conversion.
- PO-SYN-CONFLICT. The result MUST retain credible contrary evidence and distinguish an established scope or interpretation difference from an unresolved conflict. Narrow, qualify, or withhold the affected conclusion accordingly. B.2 applies only to a separately grounded whole-reidentification question.
- PO-SYN-ORDER. If the conclusion depends on order, the ordered relations, positions and OrderSpec MUST be recorded. The aggregation MUST satisfy B.1.4:4 for its declared use, including applicable branch, join and independence conditions; determinacy is relative to those conditions.
- PO‑SYN‑NOWORK. Resource spending, yields, and dissipation MUST NOT be computed here; instead, attach references to the aligned Γ_work composition.
At compilation (Γ_epist^compile):
- PO-COMP-SCHEME. The exact target reference scheme MUST be declared. Every active concept and unit MUST have an explicit mapping; a cross-context meaning use MUST name the exact F.9 Bridge, separate bounded-use claim, permitted loss, and any relied-on A.10 or B.3 result.
- PO-COMP-ASSUR. The formal basis, scope, and support account MUST be re-expressed in the target scheme without losing their limitations. Any recalculated R or loss MUST satisfy the receiving model; otherwise preserve the separate support and bounded conclusion.
- PO-COMP-SCR. The compiled episteme MUST retain an SCR with the hashes, versions, and dates required to reconstruct the application. This obligation does not assert release or publication.
- PO-COMP-ID. The output MUST be identified through its C.2.1 claim content, exact EntityOfConcern, and effective target scheme. A changed discriminator identifies another episteme. B.2 is opened only for an independently current existing-whole versus candidate-new-whole question, never as a substitute for this identity rule.
- PO‑COMP‑ORDER/TIME. If derivational order is essential, the OrderSpec MUST be referenced. If temporal selection is essential, name the exact C.2.1 episteme identity and reference the already recovered proper restriction, edition-relation order, applicability window, and B.1.4/Γ_time aggregation actually consumed.
B.1.3:7 - Conformance Checklist (normative)
| ID | Requirement | Purpose |
|---|---|---|
| CC‑B1.3.1 | Inputs to Γ_epist MUST be U.Episteme holons; ComponentOf is forbidden; use ConstituentOf, UsageOf, or ReferenceTo for their different claims; use a collection’s own belongs-to predicate only for collections. | Prevent category errors. |
| CC‑B1.3.2 | Provenance and SCR MUST be preserved in the aggregate; dropping sources or methods is non‑conformant. | Enforce Evidence Graph Referring. |
| CC‑B1.3.3 | Any aggregate R MUST follow the justified input meanings, scales, support dependencies, and receiving model. No default min, max, or F-to-R conversion is supplied; absent a common model, retain a bounded synthesis and separate support. | Prevent unsupported assurance and preserve useful non-aggregate results. |
| CC-B1.3.4 | Contrary evidence MUST remain visible. An established scope or interpretation difference may separate claims; an unresolved conflict must qualify, narrow, or defeat the affected conclusion. Use B.2 only for a separately grounded whole-reidentification question. | Keep the practical effect of disagreement visible. |
| CC‑B1.3.5 | Every U.Episteme serving as an input to Γ_epist MUST declare its mode (axiomatic or postulative). An aggregate holon’s mode MUST be postulative if any of its constituents is postulative. | Prevent category errors in reliability calculation. |
| CC-B1.3.6 | A cross-context meaning use names explicit mappings, exact source and receiving F.17 cells, an obtaining F.9 Bridge, a separate bounded-use claim and permitted loss, and any reliance result the fold consumes. CL alone never grants the use. | Make semantic crossing inspectable. |
| CC-B1.3.7 | An order-dependent conclusion MUST meet PO-SYN-ORDER and B.1.4:4. If an episteme history matters, exact C.2.1 endpoint identities and any obtaining EpistemeEditionRelation MUST be named; any proper restriction or B.1.4/Γ_time aggregation MUST cite only already recovered temporal relations. | Preserve order, identity, continuity, and temporal integrity. |
| CC-B1.3.8 | Keep design-time synthesis, target-scheme compilation, one actual operation application and its returned value, dated Work, performer and any relied-on assignment, production or first existence, publication, carrier, release, and acceptance separately governed. | Preserve semantic and practical boundaries. |
B.1.3:8 - Anti‑patterns & repairs
| Anti‑pattern | Symptom | Repair |
|---|---|---|
| Unsupported folding | Incomparable scores are averaged, minimized, maximized, or converted from F | Identify support roles, scales, dependencies, and the receiving model. If none warrants aggregation, retain separate support and a bounded synthesis; do not hide counterevidence. |
| Provenance amnesia | Sources, methods or SCR links disappear | Restore the provenance and reconsider affected reliance. Repeat the affected synthesis when its claims, mappings or support calculation depended on what was lost. |
| Homonym merge | Different concepts with the same name are silently merged | Declare the exact mapping. For cross-context meanings, identify and test the F.9 Bridge, state the bounded use and permitted loss, and keep low-CL or unresolved uses separate or provisional. |
| Silent semantic crossing | Local senses or schemes are mixed without a tested correspondence and use boundary | Declare the exact mappings; for cross-context meanings identify the F.9 Bridge, separate bounded-use claim, permitted loss, and any relied-on A.10 or B.3 result. |
| Version soup | Labels or time slices mix unchanged epistemes, distinct epistemes, edition continuity, publication, and Work history | Apply the C.2.1 identity triple first; test EpistemeEditionRelation separately; use A.14 only for a proper restriction of one unchanged episteme and A.15.1 for Work. Then aggregate only the exact recovered temporal relations the current use needs. |
| Work stuffing | Compute/curation cost blended into reliability | Move costs to Γ_work; keep R based on evidence, not spend. |
| Orderless proof | Derivation steps treated as a set | Add OrderSpec; compose with Γ_ctx inside Γ_epist. |
| Synergy by narrative | A new theory or whole is claimed from explanatory gain alone | First identify the synthesized episteme through C.2.1. Open B.2 only if exact construction and identity facts leave an existing-whole versus candidate-new-whole question. |
B.1.3:9 - Consequences
Benefits
- Auditability by construction. Every retained claim remains tied to its sources; SCR guarantees reconstructability.
- Qualified synthesis. Useful formal and complementary support is retained; dependency assumptions, contrary evidence, and mapping limitations constrain the resulting claim.
- Target-scheme results. Compiled epistemes are aligned with one declared reference scheme; any release or publication remains separately governed.
- Didactic clarity. Separates semantic folding (Γ_epist) from order (Γ_ctx), time (Γ_time), spend (Γ_work), and emergence (B.2).
Trade‑offs
- Mapping overhead. Declaring mappings and CL costs time; it prevents silent incoherence.
- No forced single score. Heterogeneous support may remain separate. This makes some comparisons less compact but avoids fictitious assurance and preserves a useful bounded conclusion. B.2 remains specific to a genuinely unresolved whole-reidentification question.
B.1.3:10 - Rationale (informative)
- Epistemic composition is not physical addition. A missing necessary premise, a complementary study, and a contrary result do different work. The receiving claim and dependency model determine their combination; minimum is not universally conservative.
- Provenance supports reliance. Losing a source or SCR link can defeat reconstruction or warranted use while the episteme keeps the same C.2.1 identity. Restore the missing provenance and reconsider the affected reliance. Identify another episteme only when claim content, EntityOfConcern or effective ReferenceScheme changes; source or method claims that form part of the claim content are subject to that same rule.
- Interpretation matters. Exact reference schemes and local senses prevent quiet reinterpretation. F.9 governs any cross-context Bridge; C.2.1 governs the resulting episteme identity.
- Parsimony with power. Provenance, support roles and dependencies, exact mappings, and order/time hooks suffice for a useful synthesis without imposing a common score. Gutierrez, Glymour and Davey Smith, Evidence triangulation in health research (2025) supports comparing design assumptions and shared biases, checking target-question comparability, and using qualitative comparison when quantitative pooling is unwarranted. This methodological contribution does not supply a universal R formula or make a further study mandatory.
B.1.3:11 - Relations
- Builds on: C.2.1 (episteme identity and independently obtaining edition relations), A.6.1 (semantic operation declarations and exact application bindings), A.14 (ConstituentOf, collection belonging under each collection’s own rule, and proper temporal restriction of one unchanged carrier), A.7 (Strict Distinction), and A.15/A.15.1 (Method/Work alignment and Work-temporal law). A.12 is used only when an acting-side distinction is current. An ordinary actor sentence needs no classification apparatus. Any particular dated synthesis or compilation
U.Workfirst reuses each performer’s A.13 core and is independently admitted under A.15.1; F.6 follows only when the receiving claim also needs precise assignment-bound attribution. A short local projection may omit an assignment identifier unused by the receiver only when every consumed relation remains recoverable. - Coordinates with: B.1.1 dependency-structure and relation-grounding checks, B.1.4 (Γ_ctx/Γ_time inside knowledge folds), B.1.6 (Γ_work for compute/collection spend).
- Coordinates with: F.9 for exact cross-context Bridges and bounded-use claims; A.10 or B.3 for reliance; A.15.PROD when production, first existence, or completion is current; and E.17/E.24.PUB for publication, form, and carrier. B.2 is used only when exact construction facts leave a separate whole-reidentification question after the existing-whole explanation check.
- Used by: B.3 assurance uses the aggregate’s exact formal basis, scope, and support account, including any justified R calculation and mapping limitations; C.11 and C.19.2 govern a separately selected inquiry or action decision.
One‑sentence takeaway. Γ_epist preserves provenance, distinguishes what each source contributes, and combines support only as its meanings and dependencies warrant—returning a useful bounded synthesis when no common score is justified.
B.1.3:End
B.1.4 - Specify Order-Sensitive or Temporal Aggregation (Γ_ctx, Γ_time)
Type: B-family aggregation pattern Status: Stable Normativity: Normative unless explicitly marked informative
Use this when. Use this pattern when the current claim aggregates already recovered relations over an exact set of ordered positions, phases, or a time window, and the question is not just ordinary part-whole construction. Typical cues are ordered steps, order-sensitive argument chains, asset histories, proper temporal restrictions of one enduring carrier, rolling windows, use-bounded roll-ups, time-sliced evidence, or a bounded chronology over exact C.2.1 episteme identities and already obtaining edition relations.
Not this pattern when. If the question is ordinary part-whole or collection admission, use B.1, A.14, and C.13. If it is episteme identity or historical edition continuity, use C.2.1 before any aggregation. If the question is the method as such, method description, work plan, dated work occurrence, or Work temporal part or episode, use A.3.1, A.3.2, A.15.2, or A.15.1. If the question is work-resource accounting, use B.1.6. If the question is changed identity, use the pattern that defines the subject’s identity or change; for a clear whole-reidentification question, use B.2 directly to test whether the existing whole suffices or a new whole must be reidentified. Use B.2.P first only when emergence-family wording hides the claim kind. If the question is temporal adequacy of a claim, use C.27.
What goes wrong if missed. Order, phase, context, or time-window wording becomes ordinary parthood, method order, performed work, evidence currentness, or whole reidentification by label.
What this buys. The practitioner can aggregate order-sensitive and temporal material while keeping method, work, transformation, work-resource, temporal-adequacy, and MHT claims with the patterns that define or test them.
B.1.4:1 - Problem Frame
Many useful aggregates are not simple unordered wholes. A manufacturing sequence changes meaning when steps are swapped. An argument chain depends on which premise is used before which lemma. A turbine or another enduring individual with a stated identity rule may be considered across proper temporal restrictions. An unchanged paper or dataset episteme may also be restricted to a proper interval only while its complete C.2.1 identity triple remains fixed; changed claim content, EntityOfConcern, or effective ReferenceScheme identifies another episteme, with edition continuity tested separately. In these cases the aggregation is about order or temporal coverage over already recovered relations, not about a new level, a generic boundary, or a hidden interaction kind.
B.1.4 defines the aggregation claim. It asks which EntityOfConcern is being aggregated, which positions or phases are included, which scope and time window qualify the claim, which ordered or phase relation is being used, what the aggregate may be used for, and which neighboring pattern carries any stronger claim.
B.1.4:1.1 - Problem
Without this pattern, four errors recur. First, SerialStepOf or another ordered relation is read as ordinary parthood, so changing the order looks harmless even when the aggregate meaning changes. Second, a phase label is read as a new holon level or a new whole, so identity change is hidden instead of handled by whole reidentification. Third, design-time plans, possible method order, run-time histories, and evidence windows are folded together as one sequence. Fourth, mathematical order, graph, or operator notation starts to stand for the in-life object instead of expressing a recovered relation for one bounded use.
The practical failure is not a missing diagram. It is an inadmissible aggregate: the user cannot tell which carrier is being followed, which positions or phases are included, which relation is ordered, which time window is covered, whether gaps or overlaps matter, or which pattern must carry a stronger work, resource, transformation, evidence, or whole-reidentification claim.
B.1.4:1.2 - Forces
| Force | Tension |
|---|---|
| Order sensitivity vs. ordinary parthood | Ordered positions must remain reviewable without recasting them as parts of one physical whole. |
| Temporal coverage vs. carrier identity | A phase aggregate needs useful time windows, but it must not hide that the carrier changed identity. |
| Design-time relation vs. run-time history | Method order, work plan, and performed work often share labels, but they are different claims. |
| Compact notation vs. ontology | Gamma_ctx, Gamma_time, graph, or algebra notation can make a relation easy to use, but cannot create a holon, method, work occurrence, or transformation. |
| Local aggregation vs. stronger return | The pattern should keep a small aggregation record, while sending resource, evidence-currentness, transformation, and MHT claims to their owners. |
B.1.4:2 - Solution
Recover a ContextTemporalAggregation@Context before using the aggregate:
ContextTemporalAggregation@Context:
aggregationConcernRef
aggregatedEntityOfConcernRef
includedPositionRefs?
includedPhaseRefs?
claimScopeRef?: U.ClaimScope
aggregationMode: contextualOrder | temporalPhase
orderedRelationRefs?
phaseRelationRefs?
orderSpecRef?
timeWindowRef?
carrierIdentityRef?
independenceOrJoinConditionRefs?
coverageAndOverlapPolicyRefs?
boundaryCrossingRelationRefs?
relatedMethodRefs?
relatedMethodDescriptionRefs?
relatedWorkOccurrenceRefs?
relatedWorkResourceAggregationRefs?
relatedTransformationRefs?
relatedWholeReidentificationRefs?
evidenceOrSourceRefs
admissibleUse
stopOrReturnCondition
nonAdmissibleOverread?
strongerSourceReturnCondition
stopOrReturnCondition states when to stop aggregating or apply another pattern; strongerSourceReturnCondition states the condition for a stronger claim. Include nonAdmissibleOverread? only when it passes F.19’s plausible-reader test. groundedNonAdmissibleOverread? is an alias for that same optional value.
Use the record to describe the exact aggregation claim and its independently established relations. The record is not itself the relation or a new U.Level, U.Boundary, U.Interaction, or generic process object.
B.1.4:2.1 - Two Aggregation Modes
| Mode | Current object | Required relation discipline | Typical use |
|---|---|---|---|
| Contextual order aggregation | An exact set of relation positions whose order, partial order, or join structure changes meaning for the stated use. | Included positions, OrderSpec, ordered relation refs, join or independence conditions, and ClaimScope when needed. | Ordered method relation, order-bound argument chain, staged construction description, controlled sequence. |
| Temporal phase aggregation | One enduring carrier considered through exact proper phases or time slices. | Carrier identity rule, included phases, PhaseOf or another direct phase relation, TimeWindow, declared coverage rule and overlap policy. For an unchanged episteme, the complete C.2.1 identity triple stays fixed. | Asset history, proper restriction of one unchanged episteme, experimental-carrier phases, dated evidence window. Distinct episteme editions first require C.2.1 identities and an independently obtaining edition relation. |
If one source phrase mixes both modes, split the record. A Method may have an ordered relation structure; the Work that enacts it may have exact A.15.1 temporal parts, episodes, operational parts, or separate occurrences, while C.27.TA supplies any independently declared overlap or other interval relation the receiving use aggregates. Those are different claims, and generic PhaseOf does not replace the Work or temporal relations.
B.1.4:2.2 - Where Stronger Claims Go
| Current claim | Pattern to use |
|---|---|
| Method as semantic way of doing | A.3.1 |
| Method description, SOP, algorithm text, simulator configuration, or formal expression | A.3.2, with publication owners when publication use is current |
| Work plan | A.15.2 |
| Dated work occurrence, performed episode, or evidence that work happened | A.15.1 |
| Work-resource roll-up, spent resource, cost, effort, energy, material, or comparable ledger | B.1.6 |
| Episteme identity and historical continuity between distinct epistemes | C.2.1; aggregate only exact identities and an already obtaining EpistemeEditionRelation when the bounded use needs their chronology |
Proper PhaseOf, portion, membership, or other parthood relation for a non-Work carrier | A.14, B.1, and C.13 as appropriate; Work temporal and part relations remain with A.15.1 |
| Holon delimitation or boundary-crossing relation | A.1, B.1, A.12, A.3.4, or the pattern that defines the exact relation |
| Bounded change under conditions | A.3.4 |
| Whole reidentification, emergence-family wording, MHT, MET, MFT, synergy, or metric-mirage wording | Use B.2.P when emergence-family wording hides the claim kind. If a whole-reidentification question remains, including one raised by an autonomy or capability change, use B.2; B.2.2 and B.2.3 handle System and Episteme result recognition, and B.2.4 is the capability/functioning decision bridge. Use B.2.5 separately for an exact two-sided supervisor-subholon feedback claim, whether or not whole reidentification is current. |
| Architecture structural view or selected structure | C.30.ASV, A.22, or the pattern that defines or tests the architecture claim |
| Mathematical order, graph, algebraic notation, graph path, or morphism used as expression | Use C.29 when mathematical-lens adequacy, preserved structure, lost structure, payoff, or stop condition is being evaluated. Use E.18 when the selected transformation-flow structure is current. Use E.18.2 when the mathematical expression of that selected structure is current. |
B.1.4:3 - Optional Operator Notation
Gamma_ctx and Gamma_time are optional notation for already recovered aggregation claims.
Gamma_ctx(contextualAggregationRecord, orderSpec, independenceAndJoinConditions)
-> contextual aggregate record
Gamma_time(temporalAggregationRecord, timeWindow, coverageAndOverlapPolicy)
-> temporal aggregate record
The notation does not create a holon, transformation, method, work occurrence, or whole reidentification by itself. It records how the selected relation set is combined for the current use.
Keep an ordinary statement about who prepared the aggregation ordinary. If the use asserts one exact dated sequencing, combining, measuring or auditing Work, recover the actual performer’s A.13 core and admit the Work independently under A.15.1. Use A.3.4 for a separate transformation claim, B.1.6 for resource aggregation, and A.10 to recover provenance and bounded reliance on independently established results. Writing the record does not identify its writer as the transformer of the EntityOfConcern.
B.1.4:4 - Admissible Checks
For contextual order aggregation:
- the ordered relation refs are named by value;
- the
OrderSpecis declared as total order, partial order, or another named relation; - independence, branch, or join conditions are named when parallel factors are used;
- the record names its included positions, ClaimScope when needed, and admissible use; any holon-boundary crossing is named by an exact relation;
- method, method-description, work, transformation, and resource claims use the patterns that define or test them.
For temporal phase aggregation:
- the carrier identity is recoverable;
- the time window is declared;
- the declared coverage and overlap policy holds; account for allowed overlaps and gaps without double counting, or narrow the use;
- identity change is not hidden as another phase;
- work-resource claims use
B.1.6; temporal claims useC.27, currentness usesG.11, andA.10recovers provenance and bounded reliance when needed.
B.1 invariant carry-through. Apply a B.1 algebraic law only when the recovered relation and declared operator justify it. Contextual aggregation is deterministic relative to the declared OrderSpec and join or independence conditions. Temporal aggregation depends on carrier identity and the declared coverage and overlap policy. A repeated designation creates no additional phase or relation by itself; retain distinct occurrences and ordered positions when the claim distinguishes them. State any singleton or idempotence law for the actual operator. Weakest-link and monotonicity claims name the characteristic and model being bounded or improved; an aggregation record alone establishes no performance, safety or assurance result.
B.1.4:4.1 - Compact Obligation Rows
| Obligation | What must be named | Why it matters |
|---|---|---|
| Independence and joins | Branch relation refs, join relation refs, and the condition under which branches may be combined. | Prevents an ordered aggregate from silently treating dependent branches as independent evidence or work. |
| Order specification | Total order, partial order, precedence relation, or another named relation over the selected positions. | Keeps order-sensitive claims from being read as unordered collection claims. |
| Decisive dependency relation | The relation that makes one position, delay, or missing step decisive for the aggregate use. | Allows weakest-link claims only when the decisive relation is visible. |
| Carrier identity | The carrier being followed across phases and the condition under which it remains the same EntityOfConcern. | Prevents temporal aggregation from hiding identity change or MHT. |
| Temporal coverage | Time window, phase refs, coverage rule, and non-overlap or overlap policy. | Prevents missing phases and double counting. |
| Chronological discipline | The rule that separates chronological order, logical order, publication order, and performed-work order. | Keeps a document sequence, argument sequence, and work occurrence sequence from substituting for one another. |
| Monotone characteristic | The exact characteristic that is preserved, bounded, or improved when the aggregate grows. | Blocks generic monotonicity claims over an unspecified aggregate. |
B.1.4:5 - Archetypal Grounding (Worked Slices)
Manufacturing sequence. A frame is prepared, welded, inspected, painted, and packed. B.1.4 records the contextual order claim: selected steps, order specification, join conditions, and admissible use for planning or comparison. The actual shop-floor work occurrences use A.15.1; energy and material roll-ups use B.1.6; a changed frame state uses A.3.4.
Paper edition history. When draft, reviewed, and camera-ready texts change claim content, EntityOfConcern, or effective ReferenceScheme, C.2.1 identifies distinct epistemes and tests each claimed EpistemeEditionRelation independently. B.1.4 may record a bounded chronology over those already recovered identities, relations, applicability windows, or publication windows; it does not turn the editions into phases of one episteme. If one unchanged episteme is genuinely needed over a proper interval, A.14 PhaseOf may state only that restriction. Source-currentness and publication-use claims use A.10, G.11, and E.17; chronology establishes none of them.
Cross-regime evidence window. A dashboard aggregates observations from two operating regimes. B.1.4 records the exact observation sets, their subject populations or carriers, the aggregation window, and the admissible use. If the regimes use different measurement bases, use C.16 or C.29 for comparability before relying on the aggregate.
B.1.4:5.1 - Bias-Annotation
| Bias risk | Failure | Mitigation |
|---|---|---|
| Notation becomes ontology | Gamma_ctx, Gamma_time, graph, or algebra wording is treated as the in-life object or relation. | Recover the ordered or temporal relation first, then treat notation as a selected expression. |
| Sequence becomes work | A method order, plan order, document order, or performed-work history is treated as the same thing. | Name the exact claim and use the applicable method, description, work-plan, dated-Work, or evidence pattern. |
| Phase becomes level | A phase label is used as a new system level or a new whole. | Recover the exact subject first: C.2.1 identity/edition law for an episteme, A.15.1 for Work, or the carrier’s direct identity rule and proper PhaseOf for another enduring individual. Open whole reidentification only when that question remains current. |
| Coverage becomes authority | A complete-looking timeline is treated as sufficient evidence or currentness. | Use the applicable evidence, source-currentness, and temporal-adequacy patterns when those claims are current. |
B.1.4:6 - Conformance Checklist
| ID | Requirement | Purpose |
|---|---|---|
| CC-B1.4-1 | The aggregate names the EntityOfConcern, included positions or phases, aggregation mode, ClaimScope when needed, time window when temporal qualification matters, and admissible use. | Prevents a generic context or time label from standing in for the aggregation boundary. |
| CC-B1.4-2 | Contextual aggregation names ordered relation refs and an OrderSpec; temporal aggregation names carrier identity, phase refs, and TimeWindow. | Keeps order and time as different relations. |
| CC-B1.4-3 | Independence, join, coverage, and overlap-policy conditions are present when the claim uses them. | Keeps local composition reviewable. |
| CC-B1.4-4 | Method, method-description, work-plan, work-occurrence, work-resource, transformation, and whole-reidentification claims use the patterns that define or test them. | Prevents B.1.4 from absorbing neighboring objects. |
| CC-B1.4-5 | Mathematical notation is treated as a selected lens or expression, not as the in-life object or relation. | Keeps Gamma_ctx, Gamma_time, graph, and algebra language bounded. |
| CC-B1.4-6 | If identity changes, coverage breaks, or a new whole is claimed, the record narrows use or names the pattern for the stronger claim. | Prevents temporal aggregation from becoming hidden MHT or transformation. |
B.1.4:7 - Common Anti-Patterns and How to Avoid Them
| Overread | Repair |
|---|---|
| A sequence is treated as physical parthood. | Recover ordered relation refs and use contextual aggregation; use part-whole patterns only for part-whole claims. |
| A phase label is treated as a new system level. | Recover the carrier identity and phase relation. If a clear whole-reidentification question remains, use B.2 directly; use B.2.P first only when emergence-family wording hides the claim kind. |
| A planning order is treated as performed work. | Use A.15.2 for work plan and A.15.1 for dated work occurrence. |
| A resource total is placed inside temporal aggregation. | Use B.1.6 for the work-resource ledger. |
| A diagram or table is treated as the aggregate. | Recover the Description episteme or publication relation and the EntityOfConcern separately. |
B.1.4:8 - Consequences
This pattern makes ordered and temporal aggregation inspectable without turning every sequence, phase, or context label into a holon level. It also lets practitioners keep useful Gamma_ctx and Gamma_time notation while avoiding a category error: the notation is an apparatus over a recovered aggregation claim, not the in-life work, method, transformation, or whole.
The cost is that the practitioner must name the relation being aggregated. The gain is that contextual order, temporal coverage, work evidence, resource accounting, transformation, and whole reidentification stop interfering with one another.
B.1.4:8.1 - Rationale
B.1.4 exists because contextual order and temporal phase aggregation are neither ordinary part-whole construction nor generic process talk. One enduring carrier with a stated identity rule can be considered through proper temporal restrictions; a selected relation set can be order-sensitive; and both cases need admissible aggregation without inventing a new holon kind. The pattern therefore keeps relation discipline explicit: PhaseOf and the carrier’s identity rule for legitimate phase aggregation; C.2.1 identity and independently obtaining edition relations for distinct episteme history; A.15.1 relations for Work; ordered relation refs and OrderSpec for contextual aggregation; and separate patterns for resource, transformation, evidence, and whole reidentification.
The old DesignRunTag warning is preserved as a rule rather than a label: do not fold design-time possible order and run-time history into one aggregate. If both are needed, make two records and relate them by value.
B.1.4:8.2 - SoTA-Echoing
| Source line | Practical implication for this pattern |
|---|---|
| Constructive and mereological treatment of phases and parts | Phase aggregation must preserve carrier identity and coverage conditions; it cannot borrow ordinary parthood when the current relation is temporal. |
| Engineering process and ordered-method notations | Ordered relations may be useful expressions of method or plan structure, but performed work and resource accounting use their own patterns. |
| Temporal modeling and evidence-currentness practice | A time window or complete phase list does not by itself prove source currentness, admissible evidence, or causal support. |
| Mathematical-lens discipline in FPF | Graph, order, and algebra notation are selected expressions over recovered relations, not ontology by spelling. |
B.1.4:9 - Relations
- Builds on
B.1,A.14, andC.13for part-whole, phase, and constructive grounding discipline. - Coordinates with
C.2.1for exact episteme identities and independently obtaining edition relations; withA.3.1,A.3.2,A.15.2, andA.15.1for method, method description, work plan, dated work occurrence, and exact Work-temporal relations. - Coordinates with
B.1.6for work-resource aggregation. - Coordinates with
A.3.4for transformation. UseB.2directly for a clear whole-reidentification question; useB.2.Pfirst only when emergence-family wording hides the claim kind. The relevant subject pattern defines or constrains the recovered claim. - Coordinates with
C.27for temporal-claim adequacy. When mathematical expression is selected,C.29tests lens-use adequacy,E.18defines the selected transformation-flow structure, andE.18.2defines its mathematical description.
B.1.4:End
B.1.5 - Gamma_method - Order-Sensitive Method Composition and Work Enactment
Type: Part B composition and grounding pattern Status: Stable Normativity: Normative unless a section is explicitly informative
B.1.5:1 - Problem Frame
Use this pattern when a project must decide whether several recovered methods compose into one larger U.Method, and when order, guarded choice, parallel branches, typed joins, adapters, or method-interface exposure changes the identity of that whole method.
Typical moments:
- a procedure, workflow, algorithm, pipeline, proof route, clinical protocol, manufacturing recipe, inference pipeline, or operational playbook has named steps or branches;
- changing the order of two candidate submethods changes the result or the admissible conditions of use;
- a diagram or code file looks like a method, but it may be only a method description, a work plan, a dated work trace, a selector registry, or a mathematical lens;
- a larger method must expose some interactions at its boundary while hiding internal steps;
- assurance needs to know which joins, adapters, cutsets, or exposed interfaces make the composite method reliable enough to enact.
- a source presents Methods as a first–then list even though representative Work may also require several of them to contribute at the same time.
Primary EntityOfConcern. The EntityOfConcern is one exact candidate or composite U.Method, already identified under A.3.1. The proposition that exact part Methods and whole-forming facts qualify it as composite is separately governed claim content. A separately identified C.2.1 episteme may carry that proposition in its ClaimGraph; the episteme then has the exact candidate Method as its EntityOfConcern under its effective ReferenceScheme. The proposition does not become the episteme.
First useful move. For each apparent step or branch, recover the governed object before composing anything: U.Method, U.MethodDescription, U.WorkPlan, dated U.Work, an A.22-selected U.Structure, method-family registry or selector outcome, mathematical lens, mechanism, formal substrate, or quoted wording that does not yet carry a method claim.
What goes wrong if missed. A flowchart becomes the method, a plan item becomes a submethod, an event log becomes proof that a method was enacted, an order edge becomes a part, or a registry of alternatives is treated as one composed method. Then work starts from a description or label whose method identity, joins, interfaces, and failure conditions were never recovered.
What this buys. The project can test whether an already identified candidate U.Method is composite and can state the needed part, order, join, interface, and identity facts without turning every useful sentence into a relation kind. If that qualification fails, the project still has a useful lower object: an A.22-selected U.Structure, description, plan, work occurrence, lens, selector result, or A.15.4 appearance-based reliance repair request.
Not this pattern when.
- If the current claim is one semantic way of doing with no order-sensitive composition question, use
A.3.1. - If the current claim is a claim-bearing episteme that describes a method or relations among methods, use
A.3.2andC.2.1. - If the current claim is intended work, use
A.15.2. - If the current claim is a dated occurrence, use
A.15.1. - If the current claim is structural component parthood, use
A.14,C.13, andB.3.5. - If the current claim is only a method-family registry, selector, fallback relation, or useful organization of already identified methods without one whole-method construction, use
G.5or select aU.StructureunderA.22.
B.1.5:1.1 - Composition Question And Object Boundaries
U.Method is a non-agentive method holon kind. A method can have submethods and can participate as a submethod in a larger method. This does not mean every step-looking node, document section, file module, graph edge, work-plan item, or work occurrence is a method part.
Order-sensitive method composition is a narrow constructive question:
Given independently recovered U.Method parts,
which methodPartOf occurrences, exact whole-forming claims, and constraints qualify one already identified candidate as composite,
and what whole-level commitments let a practitioner identify, reidentify, and enact that method?
The whole method is not the diagram, code, schedule, event log, card, or work history that may describe, plan, record, or evidence it. Work enacts the method; the method does not perform work. An A.22-selected U.Structure may organize several methods and obtaining relations for one use without constructing another method.
Gamma_method is the name for this method-composition discipline. It is not a new root U-kind, not a workflow notation, not a generic container, not a resource-accounting operator, and not a substitute for U.Work.
B.1.5:2 - Problem
Without B.1.5:
- Source-wording composition. “Step”, “stage”, “activity”, “task”, “procedure”, “workflow”, “pipeline”, or “algorithm” wording is accepted as method composition without recovering the actual objects.
- Description-as-method. A workflow diagram, BPMN model, code repository, proof script, table, checklist, or graph path is treated as the composite method itself.
- Order as mereology.
SerialStepOf,ParallelFactorOf, guarded choice, or fallback relation is placed in a structural part-whole chain. - Typed joins disappear. One submethod’s intended result is assumed to satisfy the next submethod’s precondition without an adapter method, governed correspondence or equivalence, and an explicit failure route.
- Interface exposure is hidden. Callers rely on internal interactions that should be encapsulated, or fail to see interactions that the composite method must expose.
- Run-time leakage. Resources, timestamps, telemetry, performed values, and results are baked into the method instead of remaining occurrence-side facts and separately governed resource, result, and evidence relations.
- False whole method. A method-family registry, fallback table, selector rule, or A.22-selected relation organization is treated as one whole method although no construction or whole identity has been recovered.
- Sequence becomes level. A source list, vertical diagram, curriculum, or first–then account is treated as a subject hierarchy or level structure without an independently established level relation.
- Simultaneous contributions become stages. Methods that contribute during the same bounded Work situation are forced into one before-after chain because the source, presentation, or review visits them one at a time.
B.1.5:3 - Forces
| Force | Tension |
|---|---|
| Method reuse vs source concreteness | Teams need a reusable way of doing, while sources often show only one description, run, or plan. |
| Order fidelity vs compact modeling | Important sequences and joins must remain explicit without turning every diagram edge into ontology. |
| Order vs simultaneous contribution | A real first–then condition must survive, while Methods that contribute together must not be invented as stages merely because they are described in sequence. |
| Whole-method identity vs relation usefulness | Some method-side relations are useful without asserting one composite method whole. |
| Interface exposure vs encapsulation | A composite method must state which interactions callers may rely on and which remain internal. |
| Assurance vs execution | Assurance needs joins, adapters, cutsets, and failure conditions; dated enactment, result, and evidence-use claims stay with their subject patterns. |
B.1.5:4 - Solution
A.3.1 first identifies the exact candidate U.Method and every exact part method. B.1.5 does not create their U.Method membership. It asks the narrower question: do these already identified methods, contributions, constraints, and boundary decisions warrant the claim that the candidate Method is composite?
Start with the smallest useful composition claim:
- Name the same exact A.3.1 candidate Method and exact A.3.1 part methods.
- In ordinary domain language, state the candidate’s reusable whole action, what each part contributes, and the order, guard, adapter, or join condition that the whole action actually needs.
- For every whole-forming statement other than B.1.5’s narrow
methodPartOf, use A.6.RCD’s lightest sufficient disposition: an existing direct predicate, a local compound claim, or a reusable predicate-definition episteme. A convenient edge label is not a relation-kind admission. - Add stable relation-occurrence identity, typed declarations, publication, or assurance only when a named dependent use consumes that extra result. Submit any relation-kind candidate to the exact E.24/E.24.UK admission predicates rather than admitting it here.
- If the whole action, boundary, contribution, or reidentification rule is still missing, stop the composite claim and keep the useful lower object under its subject pattern.
Minimal positive. BuildAndVerifyPumpUnit is already an exact A.3.1 Method. Its construction rule requires frame assembly, motor installation, connector adaptation when the installed connector does not meet the test precondition, and functional testing; installation and any required adaptation must finish before testing, and adapter failure stops the whole before test. These plain claims, exact methodPartOf facts, and the whole identity rule can warrant the composite-method qualification without minting one relation kind per arrow.
Discriminating non-composite. AssessVitals, ClassifyUrgency, and RouteToCare can support readable result-to-precondition and guarded-dispatch claims while still lacking one reusable whole action, complete boundary, and whole reidentification rule. Keep those claims local and do not call their organization a composite Method. Select an A.22 U.Structure only if a real receiving use needs a load-bearing selected organization.
When a caller system, planner system, substituting-method selection use, auditor, or assurance use needs a reliance-bearing account, check the complete coordinates below. This is a reading checklist, not a schema, record, RelationSignature, or set of SlotSpecs.
Composite-method qualification:
candidate whole method: one exact U.Method already identified under A.3.1
part methods: a non-empty set of exact U.Method values already identified under A.3.1
method-part occurrences defined in B.1.5: methodPartOf(part method, whole method)
other whole-forming claims and constraints:
exact order, independence, guard, iteration, fallback, adapter, and join meanings used here
each closed at A.6.RCD's lightest sufficient disposition
whole semantics:
generic participants, applicability, preconditions,
intended effects or preserved conditions, invariants, bounds,
accepted inputs and outputs, failure and stop conditions
boundary decisions:
exposed, forwarded, and encapsulated interactions
identity and reidentification:
what keeps this whole the same and what identifies another method
enactment boundary:
exact U.Work may enact the method only through A.15.1 enactsMethod
lower disposition if construction is incomplete:
selected U.Structure | U.MethodDescription | U.WorkPlan | U.Work |
G.5 selector | lens | A.15.4 appearance-based reliance repair request
B.1.5:4.1 - Recover Parts Before Composition
Do not start from the word “step”. Start from the object claim.
An apparent step can be:
- a
U.Methodsubmethod; - a description constituent inside
U.MethodDescription; - a plan item inside
U.WorkPlan; - a dated
U.Workoccurrence or work part; - an order, fallback, or selector claim among independently identified objects;
- a mathematical or representation lens over selected relations;
- mechanism or formal-substrate material;
- quoted wording that does not yet carry a method claim.
Only the first case can be a method part. Do not mint U.StepSpec, U.StepMethod, U.MethodStep, or U.MethodAlgebra for the others.
B.1.5 directly governs MethodPartOfRelation, expressed in Plain register as methodPartOf(partMethod, wholeMethod). Both participants are exact U.Method values already identified under A.3.1. The predicate obtains exactly when the whole Method’s stable construction rule names the part Method as a required contributor or as an admitted alternative for a required contribution, and that contribution participates in the whole’s reusable action. It establishes neither A.14 structural-component parthood, a work part, nor a transformation part.
One methodPartOf occurrence is determined by the ordered pair <part Method, whole Method>. Every bounded alternative already admitted by the whole’s construction rule can stand in methodPartOf at the same time; dated Work selecting one alternative does not start, end, or recur the other occurrences. For the same two exact Methods, the relation is atemporal: there is no silent cessation and later recurrence. If the construction rule changes so that a part is newly admitted or no longer admitted, the composite Method must be reidentified or the claim remains unresolved; reidentifying either participant gives another pair. This is why the participant pair is sufficient for the narrow family defined in B.1.5 even when actual enactments vary.
The same part Method may also stand in methodPartOf relations to several different whole Methods. Test every pair against the construction rule of its own whole. Each whole keeps its own reusable action, applicability, boundary, constraints, interfaces, accepted variations, and reidentification rule. One supported pair says nothing about another and creates no unique containing Method, discipline-wide whole, kind inheritance, transitivity, fusion, or common-whole closure.
A source label, list membership, diagram containment, shared name, registry entry, description membership, plan position, or work decomposition does not make methodPartOf obtain. When the test fails, keep the apparent step under its subject pattern and do not add a negative part merely to complete a diagram.
B.1.5:4.2 - Test The Composite-Method Qualification
First identify the exact candidate Method under A.3.1 from its reusable action, participant meanings, applicability, preconditions, intended result or preserved condition, bounds, and failure or stop conditions. If that Method cannot yet be identified, require A.3.1. B.1.5 then tests whether already identified part Methods and exact whole-forming facts justify calling that same candidate a composite Method; it does not create the candidate’s Method identity.
State each whole-forming fact in ordinary domain language before choosing its representational or ontological disposition. The words serial, parallel, guarded, iterative, fallback, adapter, and join do not settle the claim by themselves.
| Composition cue | What the current claim must let a practitioner decide |
|---|---|
| serial | which earlier and later Methods participate in which whole, and which accepted result or preserved condition of the earlier Method must satisfy which precondition of the later Method before continuation |
| parallel | which branch Methods may proceed without a mutual order, the independence condition, and the exact join condition that must hold before the whole continues |
| guarded choice | which alternative Method is selected, the exact selection condition, what happens when no guard or several guards hold, and which whole contains that choice |
| iteration | which part Method repeats, what establishes another iteration, and the exact stop or failure condition |
| refinement or substitution | which Method may replace which other Method, for which use, and which whole semantics, joins, and exposed interactions must remain invariant |
| fallback or dispatch | which primary and alternative Methods are involved, the exact trigger for using the alternative, and whether the statement belongs to this whole or only to a selector registry |
| adapter or typed join | which exact adapter U.Method, upstream result meaning, downstream precondition, conversion condition, and failure route make the join admissible |
Before using a first–then or vertical list as Method architecture, make both checks.
- Preserve real order. Ask what must finish or become true before another Method can start or continue. Name the Methods, the required result or condition, any join or adapter, and the failure or stop route. Keep a genuine first–then result as an unfolding or order claim; its position does not make it a subject level.
- Test simultaneous contribution. Choose one bounded Work situation and ask whether several Methods contribute during it without all of them falling into one before-after chain. One Work whole may enact several Methods through separate A.15.1 relations. Alternatively, separately identified Work occurrences may overlap while enacting different Methods. State the Work identities and relations that actually obtain. Co-occurrence alone establishes no Method part, composite Method, Work part, or level.
Both answers may be true. A Method can contain a real ordered segment while other Methods contribute during the same broader Work. The source’s reading order and the fact that several Methods are used together decide neither which Methods are parts of one whole nor whether any level exists.
Then use A.6.RCD. Reuse an existing direct predicate when one already governs the needed claim. Otherwise stop at a local compound claim when it closes this use, or publish a reusable predicate-definition episteme when several uses need the same rule. Continue to a relation-kind candidate only when a named receiver needs stable occurrence semantics that claim content cannot supply; E.24 and E.24.UK decide admission. A label such as precedesInMethod is readable claim language, not admission evidence, and an ordinary composition claim needs no invented occurrence.
Keep definition, signature, kind, and edition distinct. A predicate-definition episteme may independently satisfy ordinary A.6.0 U.Signature membership. It is not a RelationSignature; that specialization opens only for an admitted relation kind. Changed predicate-definition or signature content identifies another episteme under C.2.1. Treat and connect the two epistemes as editions through EpistemeEditionRelation only when C.2.1’s historical-continuation test passes: exact source use and the applicable continuation rule identify which claim, EntityOfConcern, and scheme features must be preserved or may deliberately change, and the current facts satisfy that rule. Revision or supersession Work, Method, provenance, and change facts are evidence for this test; no label establishes continuity. Otherwise the later episteme is a non-continuing replacement. The changed content triggers review of dependent claims; it does not by itself prove another relation kind or relation occurrence. If a relation kind is independently admitted, its direct pattern or declaration defines applicability and occurrence identity, while current case facts establish obtaining, continuation, or cessation where relevant.
When several admitted order occurrences must be reviewed together, use B.1.4’s OrderSpec, exact ordered-relation designations, and join or independence conditions in a separate bounded-use aggregation record. The record and optional Gamma_ctx notation neither participate in Method identity nor make any relation obtain. When the order statements remain local claims rather than admitted relation occurrences, compare those claim contents directly and do not pretend that an OrderSpec has occurrences to aggregate.
The composite-method qualification holds only when the candidate Method also has its own reusable semantic action, generic participant meanings, applicability, preconditions, intended effects or preserved conditions, invariants, bounds, accepted inputs and outputs, failure and stop conditions, and interface decisions. Its identity includes the exact part Methods and construction architecture on which those semantics depend. Cite an effective reference scheme or claim scope only when its variation changes a Method meaning or the use of a claim about that Method; neither is a generic container.
State the reidentification rule with the qualification. The same exact candidate continues through only those parameter changes, reorderings, or part substitutions that its A.3.1 identity rule already permits while preserving the whole action, applicability, preconditions, intended result or preserved condition, bounds, required joins, and interface boundary. A change outside those permitted variations identifies another U.Method. Use B.2 when a separate higher-level reidentification or emergence claim is current; a B.2 label is not needed to state an ordinary B.1.5 rule.
B.1.5:4.3 - Keep Order Out Of Structural Mereology
Source cues such as SerialStepOf, ParallelFactorOf, guarded choice, iteration, fallback, adapter, and typed join call attention to possible whole-forming claims. They are not admission evidence, they need not become relation kinds, they are not A.14 component parthood, and they do not make methodPartOf obtain by themselves.
Use A.14, C.13, and B.3.5 when the claim is about structural parts of a holon. Use B.1.5 when the claim is about how reusable ways of doing construct a larger reusable way of doing. The same project may need both, but the relation occurrences and truth conditions remain separate.
Use B.1.4 when a receiving use needs an inspectable order aggregation, partial-order test, or join/independence account. Its OrderSpec and optional notation describe already recovered order occurrences; B.1.5 still decides whether those methods and relations construct one composite U.Method.
When the current claim is a proper temporal restriction of one unchanged non-Work carrier, apply that subject’s direct identity rule and A.14/B.1.4 rather than B.1.5. For MethodDescription history, compare the C.2.1 identity triples and assert EpistemeEditionRelation only when its historical-continuation predicate obtains. For Work intervals, episodes, performed parts, retries, resumptions, or later occurrences, apply A.15.1’s exact relations; generic PhaseOf is not their substitute. A temporal boundary becomes a B.2-family question only when a separate whole-reidentification, closure, or supervision claim remains. Order, temporal restriction, episteme edition, Work segmentation, structural parthood, method composition, and whole reidentification remain different claims even when one source diagram uses one line for all of them.
B.1.5:4.4 - Expose The Composite Method Interface
The candidate Method’s reusable action includes a boundary decision for each interaction:
- exposed: a caller system may rely on the interaction as part of the whole Method;
- forwarded: a caller system may address an internal submethod interaction through a declared designation or adapter;
- encapsulated: the interaction is internal and cannot be relied on from outside the whole Method.
An exposure decision contributes to Method identity whenever changing it changes the reusable action or its admissible boundary. That identity consequence does not wait for an outside party to rely on the Method. A named caller, planner, auditor, substituting-method selection use, or assurance use instead determines when the decision must be stated explicitly or published for reuse. Name the interaction, precondition, result or preserved condition, failure route, and any adapter needed for each exposed or forwarded case.
B.1.5:4.4.1 - Composite-Method Boundary Account and Publication Form
When a named receiver must reuse the boundary account, first identify one exact claim-bearing U.MethodDescription episteme under A.3.2 and C.2.1. Its claim content concerns the exact composite Method and states the exposed, forwarded, and encapsulated interactions. Then keep the publication-side objects and designation content below separate.
In B.1.5, composite-Method boundary account is the local Plain phrase for this MethodDescription claim content. A boundary-account form is the separately identified reusable arrangement used to present that content when publication is load-bearing. Neither phrase creates a new kind or acronym.
- A bounded-use-declaration episteme states the operations or decisions supported by this publication, the conditions of that use, and the excluded stronger use.
- An audience-declaration episteme states the audience criterion. The actual audience consists of entities admitted by that declaration; those entities are not substituted for the declaration episteme as a publication-relation participant.
- An independently identified reusable boundary-account arrangement is a publication-form participant only while E.24.PUB
PublicationFormExpressionRelation(description edition, boundary-account form, bounded-use declaration)obtains. - A paper card, poster, page, file, or screen must first be identified independently as a physical or digital
U.PresentationCarrier; E.24.PUBPublicationFormBearingRelation(carrier, boundary-account form)then states which form it bears. - An actual system performs separate rendering, printing, uploading, indexing, or access-granting publication Work. That Work may establish or restore availability, but it is not the publication occurrence or one of its participants.
- One
EpistemePublicationRelationoccurrence, with the exact five participants<description edition, audience-declaration episteme, bounded-use-declaration episteme, boundary-account form, carrier>, makes the edition available to the declared audience for the declared use throughout its maximal continuous interval of availability. The relation occurrence is not performed by the publishing system, and the boundary-account form does not publish itself. - Names, labels, and links that designate the Method or description edition remain separately governed designation content. Neither the form nor the carrier establishes designation merely by displaying similar words.
Reader-facing boundary-account prompts:
described Method, exact MethodDescription edition, and effective reference scheme when its variation changes the Method meaning or claim use
named audience criterion and bounded use, including any excluded stronger use, when publication is load-bearing
exposed and forwarded interactions
accepted input or call meaning
preconditions and intended result or preserved condition
failure and stop routes
invariants
exact B.1.4 order aggregation or OrderSpec only when the receiver relies on its order, join, or independence limits
applicability, bounds, and quality or assurance envelope only when they limit the interaction on which the receiver relies
adapter, typed-join, and assurance references only when the receiver uses them
plain rationale for each encapsulated interaction on which misuse is likely
These prompts organize presentation; they are not direct-relation SlotSpecs, relation participants, Method parts, or a schema that creates a Method. None supplies the world-side methodPartOf facts or any other whole-forming claim. For a lightweight internal use, state the few boundary decisions in clear sentences and stop; do not create a description edition, declaration episteme, boundary-account form, carrier, publication Work, or publication occurrence by ritual.
B.1.5:4.5 - Keep Method Qualification And Work Occurrence Separate
B.1.5 evaluates and grounds the composite-method qualification of an exact U.Method already identified under A.3.1. A separately constituted U.MethodDescription may state that composition claim. Neither object creates performed Work.
One dated U.Work occurrence enacts one exact U.Method only when the A.15.1 method-enactment relation obtains. Recover each exact actual performer through A.13; A.15.1 then independently identifies the Work, time, containing System, and enacted Method. F.6 enters only when the Method-enactment account also consumes precise assignment-bound attribution through the same obtaining A.13 assignment; missing or failed F.6 leaves the Work and enactment intact. The System acts and the assignment does not. An assertion or occurrence description may cite those facts and the MethodDescription used; the Work occurrence does not store a card or record.
Parameter bindings, affected referents, resource use, telemetry, retries, results, actual transformations, production, evidence, evaluation, delivery, and acceptance remain separate objects and direct relations under their own governors. They do not become method parts, method identity fields, or generic Work outcomes merely because a report places them beside the Work.
The composition link is not one-to-one. A Work occurrence may enact the whole method without exposing every submethod as a separate work part. An exact A.15.1 TemporalPartOf_work may enact the same whole method during its selected interval. An A.15.1 episode may span several method factors, repeat one factor, or be split by evidence policy without changing the method identity. Conversely, a work part does not establish a submethod. A work part enacts a submethod only when that submethod is already an independently identified U.Method and a separate enactsMethod(workPart, submethod) occurrence obtains.
Reader check. Before saying that a work part enacts a submethod, name both sides:
- the occurrence-side object: parent
U.Work, obtaining work-part relation, interval or boundary, and exact performer System recovered through A.13; only when this reader check expressly consumes precise assignment-bound attribution, also name the exact covering A.2.1 assignment and obtaining F.6 relation; add any separately obtaining resource or evidence relation only when used; - the method-side object: exact A.3.1 submethod,
methodPartOfoccurrence, whole-forming claim at its A.6.RCD disposition, preconditions, intended result or preserved condition, interface boundary, and whole-Method identity; - the cross-side fact: the exact
enactsMethod(workPart, submethod)occurrence.
If any side is missing, lower only that side. Do not repair a missing submethod by inventing a work part, and do not repair a missing work part by inventing a submethod. Keep a method-description node, evidence segment, mechanism material, system-component behavior, or A.15.4 appearance-based reliance repair request under its subject pattern.
For an ordinary working question—what larger work is being done through this action now—use B.1.5.EW. It recovers the constitutive connections at the needed grain and shows how a changed encompassing condition changes the action. An ongoing whole need not be completed, and its constituents need not all act at once. When changing a constituent for use in one or several wholes, B.1.5.RS follows the change through their entry conditions, interactions and required results. The qualifications above still decide the corresponding Method and Work claims.
B.1.5:4.5.1 - Planning And Performed-Work Obligations
B.1.5 has three common use positions, but they are positions in use, not U-kinds:
- Planning or description-side use. A planner system performing planning Work recovers the exact Methods,
methodPartOfoccurrences, whole-forming claims at their A.6.RCD dispositions, any justified order aggregation, typed joins or adapters, interface boundary, invariants, and whole-level commitments. A resulting exactU.WorkPlanmay cite the MethodDescription edition on which it relies; neither the planning Work nor the plan is the reader that defines Method identity. - Performed-work use. Recover each exact actual performer through A.13, let A.15.1 independently admit the Work, and recover the exact
enactsMethodoccurrence for the whole Work. Add the exact covering A.2.1 assignment and F.6 relation only when this use expressly consumes precise assignment-bound attribution; missing or failed F.6 leaves the Work and enactment intact. Check capability fit or admission only when the work-entry decision consumes those claims; then check preconditions, order conformance, and exposed or forwarded interactions through their subject patterns. State resource use, evidence, and results only through their own obtaining relations. None becomes part of the method. - Assurance use. Identify cutset submethods, fragile typed joins, adapter points, mapping congruence or CL-sensitive edges, and the envelope or scope in which the composite method is expected to hold. B.3 and related assurance patterns evaluate those hooks; B.1.5 only makes them visible.
Useful invariants remain: a single recovered submethod composed alone does not create a surprising new Method; order is deterministic only under the exact order claims and conditions at their selected A.6.RCD dispositions; any throughput or quality bound must name its characteristic, critical path, and weakest-link basis; strengthening a submethod, adapter, or typed join should not make the composite Method worse unless a stated side condition changes.
B.1.5:4.5.2 - Stop Before Transformation Composition
Method composition and Work decomposition establish no U.Transformation part, composite transformation, transformation atomism, or TransformationPartOfRelation. Even when several method parts address the same referent and one Work enacts the whole method, identify each actual transformation independently under A.3.4. If a claim needs transformation composition and no direct transformation-composition governor supplies its participants, obtaining rule, and occurrence identity, return missing-governor[transformation-composition] for the proposed whole and independently identified changes. Do not infer either composition or indivisibility from the gap.
B.1.5:4.6 - Select A Structure Below The Whole-Method Threshold
Use A.22 when independently identified Methods and already obtaining relations are useful to one question or action but do not construct one whole Method. For an actual load-bearing selection, first name the selecting system, selection Method, dated selection Work and bindings, and any result episteme needed to preserve the decision. Then name all four structure discriminators: exact constituents, exact selected obtaining relation occurrences, applied constraints, and the use frame. For a one-off hypothetical comparison, state the comparison and stop without asserting a selected U.Structure. MethodRelationStructure may be used as a local readable designator only for an actually selected structure; it is not a U-kind, relation kind, Method holon, or identity field.
Typical cases:
- a fallback registry selects among alternatives but supplies no whole method;
- a workflow diagram relates method descriptions but does not recover method parts;
- a method family has independently governed refinement, substitution, or dispatch relations;
- a graph or algebra represents selected method relations as a lens;
- the same method labels occur under different effective reference schemes, while the local senses have not been resolved and any F.9 Bridge would establish only sense correspondence, not method identity;
- a work plan orders tasks but does not define one reusable method.
The selected structure is a dependent organization for its named use. It does not create its constituents or relations, become a Method, or supply holonhood. Conversely, the internal construction of one exact Method whose composite qualification has been established does not become a second generic structure merely because a diagram can display it. Select a U.Structure only when that organization itself changes the next question or action.
This lower object is not a failure. It is the right governed object when relation organization is useful but whole-method construction is not current.
B.1.5:5 - Archetypal Grounding — Worked Slices
B.1.5:5.1 - Manufacturing Recipe
AssembleFrame, InstallMotor, AdaptMotorConnector, RunFunctionalTest, and BuildAndVerifyPumpUnit are exact U.Method values already identified under A.3.1; the last is now the candidate for a composite-method qualification. The four participant-determined occurrences methodPartOf(AssembleFrame, BuildAndVerifyPumpUnit), methodPartOf(InstallMotor, BuildAndVerifyPumpUnit), methodPartOf(AdaptMotorConnector, BuildAndVerifyPumpUnit), and methodPartOf(RunFunctionalTest, BuildAndVerifyPumpUnit) obtain because the stable whole construction rule names each contribution. Every already admitted connector-adapter alternative may stand in methodPartOf simultaneously; one Work occurrence selecting an alternative does not toggle those atemporal occurrences. Removing a contribution from the construction rule, adding a new admitted alternative, or changing a required order, join, whole result, or boundary outside the declared variations identifies another whole Method.
For the ordinary use, say: the installed motor must provide the harness-installed condition required by functional test; when the supplier connector does not provide it, AdaptMotorConnector must provide the conversion before test; adapter failure stops the whole before test. In this one use, PumpInstallBeforeTest and PumpConnectorAdapterJoin are readable labels for local compound claim content in the exact PumpBuildCompositionDescription-v1 : U.MethodDescription episteme under A.3.2 and C.2.1, not relation-kind names or occurrence designators. If several pump-family uses need the same parameterized rule, A.6.RCD can identify a reusable predicate-definition episteme. Only a later named receiver that needs stable occurrences can justify evaluating a derived-kind candidate under E.24 and E.24.UK.
The composite qualification additionally requires the candidate’s generic participants, applicability, preconditions, accepted inputs, final effect, preserved conditions, exposed start and abort interactions, encapsulated calibration interaction, failure routes, and reidentification rule. A list of the five names or an arrow diagram establishes none of these facts.
PumpUnitBuildWork-2026-07-29 may enact the whole through one exact enactsMethod occurrence without four corresponding work parts. If a separately admitted MotorInstallationWorkPart-2026-07-29 exists, it enacts InstallMotor only through its own enactsMethod occurrence. Resource use, test telemetry, the produced pump unit, acceptance, and evidence remain under their subject patterns.
B.1.5:5.2 - Emergency Intake
RegisterPatient, AssessVitals, ClassifyUrgency, and RouteToCare are independently identified Methods. For a one-off protocol review, the practitioner may state two local claims in ordinary language: the intended vital-sign result meaning of AssessVitals must satisfy the admitted input meaning of ClassifyUrgency; and the declared triage rule decides which admitted urgency category holds from the declared vital-sign conditions and, when the protocol uses them, the declared symptom conditions, then maps that category to one compatible RouteToCare. If no category or several incompatible categories hold, the practitioner stops the routing decision and returns the guard rule for repair. These are useful claim contents, not MethodResultPreconditionRelation or MethodDispatchRelation admissions.
This review is deliberately hypothetical and non-load-bearing. It compares the four Methods and the two claims but does not assert a persisted U.Structure or a selection judgment. If a later receiving use needs an A.22-selected structure, its selection must identify the exact selecting system, selection Method, dated selection Work and bindings, and—where the result must persist—the result episteme. The structure itself is then identified by all four A.22 discriminators: exact constituents, exact independently admitted obtaining relation occurrences, applied constraints, and use frame. The present local claims cannot be relabelled as such occurrences merely to fill that list.
The comparison still discriminates the non-composite case. No reusable whole action, complete precondition-to-result boundary, response to every guard conflict, or whole reidentification rule has been established. A wall poster may be a carrier bearing a publication form; an exact U.MethodDescription edition is a different claim-bearing episteme, and an actual publication occurrence is what makes that edition available to an audience. For intake Work, recover each actual performer through A.13 and admit the Work independently through A.15.1. Only if this comparison also consumes which assignment covered that Work should it separately check the A.2.1 occurrence and obtaining F.6 attribution; capability or admission claims consumed by entry remain separate. None of these facts is a Method part.
If a later hospital protocol first identifies an exact A.3.1 Method such as EmergencyIntakeMethod-v4 with the missing whole semantics, B.1.5 can test its composite-method qualification. Neither a poster, the one-off comparison, nor a later selected structure turns into that Method.
B.1.5:5.3 - Learned Model Pipeline
A neural-network pipeline may describe feature extraction, embedding, attention, retrieval, ranking, and explanation generation. Some blocks may be formal substrate or mechanism material, some may be constituents of a U.MethodDescription, and some may be recovered as U.Method values.
After the candidate whole represented by the pipeline and every claimed part have been independently identified as exact A.3.1 Methods, that candidate qualifies as composite only when exact methodPartOf occurrences, whole-forming claims at their A.6.RCD dispositions, accepted inputs and outputs, invariants or admissibility conditions, typed joins, fallback behavior, failure conditions, interface decisions, and reidentification rule are present. Otherwise keep the graph as a MethodDescription, mathematical lens, mechanism material, or—when an actual selection basis and receiving use exist—an A.22-selected U.Structure.
Suppose one dated training Work enacts the exact pipeline Method while three independently identified transformations occur: the feature store changes, model parameters change, and the ranking index changes. Common Work, shared data, Method order, and temporal adjacency do not establish transformation parts or one composite transformation. Without a direct transformation-composition governor, retain the three transformations and return missing-governor[transformation-composition] for the proposed three-change whole; do not call them atomic either.
B.1.5:5.4 - Evidence Synthesis And Publication
CollectDatasets, NormalizeSchemas, EstimateModel, CrossValidate, DraftManuscript, and EvidenceSynthesisAndPublication-v3 must first be exact A.3.1 Methods. B.1.5 can qualify the last as composite only when every claimed methodPartOf occurrence obtains and its whole-forming claims and constraints pass A.6.RCD’s lightest sufficient disposition. In ordinary language, the intended result of NormalizeSchemas must satisfy the admitted input meaning of EstimateModel; legacy datasets may require adapter Methods; CrossValidate may be a critical cutset for later assurance; and a provenance condition may be a precondition of DraftManuscript before publication Work begins.
A paper draft, workflow diagram, repository, or notebook may be a claim-bearing episteme, a representation, or a carrier; its form does not make it the Method. Publication Work is U.Work. Compute, storage, reviewer time, artifact production, release, and acceptance stay with their subject patterns.
EvidenceSynthesisInterfaceDescription-v3 : U.MethodDescription may state that the Method exposes Submit() and ReleaseArtifacts(), forwards CrossValidate.Folds(k), and encapsulates ad hoc scrubbing utilities. Identify SubmissionReleaseBoundaryAccountForm-v3 independently as the reusable arrangement entity selected as the boundary-account form. Identify EvidenceSynthesisMethodsPage-2026-07 : U.PresentationCarrier independently as the digital carrier. Identify SubmissionAndArtifactReleaseUse : U.Episteme as the bounded-use declaration whose claims state the supported submission and artifact-release operations, their conditions, and the excluded stronger use. Identify SubmittingResearchersAudienceDeclaration-v1 : U.Episteme as the audience declaration whose claims select the authorized submitting researchers; those researchers are the declared audience, not a participant substituted for the declaration episteme.
PublicationFormExpressionRelation(EvidenceSynthesisInterfaceDescription-v3, SubmissionReleaseBoundaryAccountForm-v3, SubmissionAndArtifactReleaseUse) must obtain for that form use, and PublicationFormBearingRelation(EvidenceSynthesisMethodsPage-2026-07, SubmissionReleaseBoundaryAccountForm-v3) must obtain for that bearing claim. ResearchPublicationSystem performs the separate EvidenceSynthesisInterfacePublicationWork-2026-07 : U.Work, which may establish or restore availability. The distinct EvidenceSynthesisInterfacePublication-2026-07 occurrence of EpistemePublicationRelation has the five fixed participants <EvidenceSynthesisInterfaceDescription-v3, SubmittingResearchersAudienceDeclaration-v1, SubmissionAndArtifactReleaseUse, SubmissionReleaseBoundaryAccountForm-v3, EvidenceSynthesisMethodsPage-2026-07> and carries the description edition’s enduring availability to the audience selected by the audience declaration for the bounded use. Publication Work is not a participant of that occurrence. None of these description, declaration, form, carrier, Work, or publication-relation objects creates an interaction, SlotSpec, Method part, or composition fact.
B.1.5:5.5 - Ordered Preparation And Simultaneous Performance
A music-and-dance performance can contain both kinds of fact. Venue setup, safety checks, and interface checks may need a real order before the public performance starts; a failed safety check may stop the unfolding. Preserve that order when the exact Methods and conditions support it. It is not a level structure.
During the performance, dancing, music making, sound mixing, lighting, and stage coordination may contribute at the same time. If the project identifies one performance Work whole, it may enact several exact Methods through separate relations. If it identifies several Work occurrences, state which overlap. Do not rewrite these contributions as five stages merely because a production plan or review lists them one by one. Conversely, do not erase real setup, cue, or handoff order merely because the overall performance is simultaneous.
The same two-way check applies elsewhere. In engineering Work, a lifecycle or product order does not prove that architecture, realization, integration, assurance, and feedback form one sequence. In operating Work, a workflow line does not serialize queues, commitments, resources, measures, and improvement. In capability development, preparation Work may precede the target Work while several target Methods contribute together during the transfer check. Preserve every real continuation condition, but do not invent order among concurrent contributions.
B.1.5:6 - Bias-Annotation
Lenses tested: Gov, Arch, Onto/Epist, Prag, Did. Scope: cross-domain order-sensitive composition of already identified U.Method values. It does not cover sole-Method identification, description-only organization, dated Work decomposition, structural mereology, or transformation composition without a direct governor.
- Gov: each
methodPartOfoccurrence and each other whole-forming claim stays with its direct governor; a named receiver changes how much of the boundary account must be stated or published, not whether a world-side fact obtains. - Arch: the whole is qualified from exact part Methods and construction facts; order aggregation, a selected A.22 Structure, and a separate higher-level reidentification claim remain distinct architectural objects.
- Onto/Epist: Methods and obtaining relation occurrences remain distinct from MethodDescription claims, boundary-account presentation, carriers, publication Work, and publication occurrences.
- Prag: ordinary use may stop at readable local claims; reusable definitions, relation kinds, declarations, publication, and assurance are added only when a named receiving use needs them.
- Did: the manufacturing, emergency-intake, learned-pipeline, evidence-synthesis, and performance slices show positive composition, useful non-composite stopping results, and the difference between real order and simultaneous contribution across domains.
The pattern intentionally biases toward explicit construction and boundary accounts when joins or outside reliance are load-bearing. The lightweight local-claim lane and subject-pattern exits mitigate that bias so inspectability does not become ritual apparatus.
B.1.5:7 - Conformance Checklist
| Check | Requirement |
|---|---|
CC-B1.5-1 | The candidate whole and every claimed Method part are independently identified as exact U.Method values under A.3.1 before B.1.5 tests the composite-method qualification. |
CC-B1.5-2 | Step wording, description nodes, plan items, Work occurrences, file modules, graph edges, registries, source wording, mechanism material, formal substrates, mathematical lenses, and evidence or publication-use claims are not Method parts by position or label. Keep each with its direct governor unless it is independently identified as an exact U.Method and methodPartOf separately obtains. |
CC-B1.5-3 | Every methodPartOf(partMethod, wholeMethod) occurrence passes the required-contribution or admitted-alternative test. Its ordered-pair identity is exact; all bounded alternatives may obtain simultaneously, Work selection does not toggle them, and a changed admitted-part set reidentifies the whole Method or leaves the claim open. One part Method may have several whole Methods only through separately supported pairs and separately qualified whole constructions; no unique parent or closure property follows. |
CC-B1.5-4 | Every serial, parallel, guarded, iterative, fallback, adapter, substitution, or typed-join use states a concrete decidable claim and selects A.6.RCD’s lightest sufficient disposition. A relation kind and occurrence are required only after independent admission for a named occurrence-semantics use. |
CC-B1.5-5 | The already identified candidate Method states whole-level participant meanings, applicability, preconditions, intended effects or preserved conditions, invariants, bounds, accepted inputs and outputs, failure and stop conditions, interface decisions, and reidentification rule before its composite qualification is accepted. |
CC-B1.5-6 | Exposed, forwarded, and encapsulated interactions are distinguished because changing the reusable action or admissible boundary changes Method identity. A named caller system, planner system, auditor, substituting-method selection use, or assurance use determines whether the boundary account must be explicit or published; reliance does not create its identity effect. |
CC-B1.5-7 | Exact U.MethodDescription edition, independently identified boundary-account form and U.PresentationCarrier, bounded-use- and audience-declaration epistemes, separate publication Work, five-participant EpistemePublicationRelation occurrence, raw audience, and designation content remain distinct. PublicationFormExpressionRelation and PublicationFormBearingRelation state the supporting links; a system performs the Work, while the publication occurrence makes the edition available. |
CC-B1.5-8 | A load-bearing A.22 selection names the selecting system, selection Method, dated Work and bindings, any persisted result episteme, and the structure’s exact constituents, independently admitted obtaining relation occurrences, constraints, and use frame. A one-off hypothetical comparison asserts no selected U.Structure. |
CC-B1.5-9 | When the composite method needs a separate higher-level reidentification or emergence explanation, use B.2 in addition to the explicit B.1.5 method reidentification rule. |
CC-B1.5-10 | A temporal slice, episode, event-log segment, telemetry interval, engine stroke, detector component, or U.WorkPlan item is neither a Work part nor a Method part by appearance. Keep each with its subject pattern. A genuine Work part enacts a submethod only through a separate exact A.15.1 enactsMethod occurrence; whole Work may enact the whole Method without mirrored Work parts. |
CC-B1.5-11 | A receiving use that needs order aggregation names B.1.4’s exact ordered relation designations, OrderSpec, and join or independence conditions; the aggregation record or notation does not enter method identity or make relations obtain. |
CC-B1.5-12 | Typed joins name the upstream intended-result meaning and downstream precondition, plus an adapter or governed correspondence when those meanings differ, and a failure route; signatures do not establish the holder’s actual ability. |
CC-B1.5-13 | Dated Work, performing Systems, separately declared assignment species, actual assignment occurrences, obtaining F.6 attributions, resource use and costs, yields, dissipation, telemetry, results, and production, together with separate evidence-, publication-use-, evaluation-, delivery-, and acceptance claims, use their subject patterns and do not become Method identity fields. |
CC-B1.5-14 | Assurance hooks name cutsets, fragile joins, adapter points, CL-sensitive mappings, and the exact envelope or claim scope consumed by B.3; no performance or quality claim follows from composition alone. |
CC-B1.5-15 | A direct method-composition claim establishes no A.14 structural-component relation, work-part relation, or selected-structure identity unless the corresponding direct predicate separately obtains. |
CC-B1.5-16 | Method parts, Work parts, common referents, method order, and temporal adjacency establish neither transformation parthood nor a composite transformation; missing transformation-composition governance returns missing-governor[transformation-composition] for the proposed whole and independently identified changes, without an atomism inference. |
CC-B1.5-17 | A first–then or vertical account receives both checks: preserve every real continuation condition as order or unfolding, and test whether several Methods contribute during the same bounded Work situation without one total sequence. Source order creates no level; simultaneous use creates no Method part, composite Method, Work part, or level. |
B.1.5:8 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Repair |
|---|---|
| “The workflow diagram is the composite Method.” | First govern the diagram as U.MethodDescription or another representation; identify the exact candidate and part Methods under A.3.1, then test methodPartOf, whole-forming claims at their A.6.RCD dispositions, whole semantics, boundary, and reidentification. |
| “Step A is part of the Method because it is a box.” | Recover whether the box denotes an exact U.Method, description node, plan item, Work occurrence, claim, or lens expression; test methodPartOf only for an independently identified Method. |
| “Parallel branches can join because the picture rejoins.” | State the independence, downstream precondition, exact join, any adapter or correspondence, and failure route in ordinary language; use A.6.RCD’s lightest sufficient disposition and open a relation kind only for an independently accepted occurrence-semantics need. |
| “The production plan lists five Methods, so the practice has five stages.” | Preserve any real setup, handoff, or continuation order. Then test the representative Work: Methods may contribute together in one Work whole or in overlapping Work occurrences. The plan’s row order establishes neither a total sequence nor a subject level. |
| “The selector table is the Method.” | Use G.5 for the selector. Use A.22 only when an actual selection basis and all four structure discriminators are present; otherwise keep a one-off comparison without asserting a selected U.Structure. A composite Method still needs its own exact construction and whole-level commitments. |
| “The run proved the method structure.” | Record the run as U.Work; relate it to the method through enactsMethod and use evidence only through its governing relation. A successful run neither creates method parts nor settles reidentification. |
| “The phase is a method step.” | Recover the subject: use the carrier’s direct identity rule plus proper A.14 PhaseOf for one unchanged non-Work individual, C.2.1 for distinct MethodDescription epistemes and any obtaining edition relation, or A.15.1 for Work temporal parts and occurrences. None is a Method part unless an exact U.Method and methodPartOf independently obtain; use B.2 only for a separately current whole-reidentification, supervision, or closure claim. |
| “The join improves throughput, so the method has emergence.” | Name the measured characteristic, critical path, cutsets, typed joins, and assurance relation; open B.2 only when a separate whole-level reidentification claim remains. |
| “The boundary-account prompts define the Method.” | Identify the exact claim-bearing U.MethodDescription edition first. A boundary-account form is a reusable form only when PublicationFormExpressionRelation obtains; its prompts create neither the Method nor the form, carrier, declaration epistemes, publication Work, five-participant publication occurrence, or composition facts. |
| “The boundary account is a nice diagram.” | For a load-bearing publication, identify the MethodDescription edition, bounded-use- and audience-declaration epistemes, boundary-account form, and carrier independently; then distinguish the system’s publication Work from the five-participant occurrence that makes the edition available. Keep designation content separate. Otherwise state the few boundary decisions directly. |
| “The same Work and referent make the transformations one composite.” | Identify each transformation under A.3.4. Without a direct transformation-composition governor, return missing-governor[transformation-composition] for the proposed whole and independently identified changes; infer neither composition nor atomism. |
B.1.5:9 - Consequences
B.1.5 buys inspectable Method composition without confusing the candidate Method, composition claim, MethodDescription, selected Structure, Work occurrence, resource use, and assurance argument. The practitioner can say which exact Methods are parts, which ordinary whole-forming claims and constraints qualify the candidate as composite, which interactions belong to its boundary, what exact Work enacts it, and where a stronger claim must stop.
The cost is proportionate explicitness: exact Methods, methodPartOf occurrences, whole-forming claim content, order and join conditions, interface decisions, whole semantics, and reidentification must be stated before the composite qualification can be relied on. Ordinary use can stop at readable local claims; reusable definitions, relation kinds, declarations, publication, and assurance are added only when a named receiver needs them.
B.1.5:10 - Rationale
The rationale is a strict object separation. Paying this explicitness cost exposes brittle joins and accidental external dependencies at Method boundaries before someone relies on the composite claim. Order is semantic but not structural parthood. A method can be a non-agentive holon, but a step label, graph node, phase, source section, description constituent, plan item, or work part is not a method part until the U.Method and methodPartOf occurrence are recovered. Gamma_method concerns ways of doing; Gamma_work supports occurrence-side resource analysis; B.3 evaluates assurance; A.22 selects useful relation organizations; B.2 handles a separately current higher-level reidentification claim. None of those neighboring objects replaces the direct B.1.5 construction facts.
B.1.5:11 - SoTA-Echoing
These rows answer the B.1.5 practice question: how to decide and expose order-sensitive Method composition without mistaking descriptions, Work, event records, or construction diagrams for the composite Method.
| Current practice answer | Published source basis | B.1.5 adoption | Rejected shortcut |
|---|---|---|---|
| Current workflow, case, decision, process-mining, and object-centric event-log practice separates process models from event logs, telemetry, and resource records. | A.15:11 — OMG CMMN 1.1 (2016) and OMG DMN 1.5 (2024); A.15.1:13.1 — OCEL 2.0 Specification (2024) and OpenTelemetry Specification 1.58.0. | Adopt and adapt. Adopt the model, decision, occurrence, log, and telemetry separations; adapt them by requiring exact candidate and part Methods, methodPartOf, and separately grounded Work because a review must distinguish modeled composition from what happened. | Reject. A workflow notation, event log, trace, or telemetry span is neither the composite Method nor proof of Method parts or dated Work. |
| Typed functional, scoped-effect, protocol, and workflow-composition practice treats composition as constrained by interfaces, preconditions, intended results, handlers, scope, and admissible order. | A.3.1:11 — Gogioso et al., “Constructor Theory as Process Theory” (2023); Bosman et al., “A Calculus for Scoped Effects & Handlers” (2024); Matache et al., “Scoped Effects as Parameterized Algebraic Theories” (2024). | Adapt. Use preconditions, intended-result meanings, scope, order, typed joins, adapters, and failure routes as concrete tests of the whole-forming claim because a composition label alone cannot show that one reusable whole action works. Use A.6.RCD’s lightest sufficient disposition for each resulting claim. | Reject. A type signature, handler calculus, process-theory description, edge label, or source-material description alone does not identify a Method part, admit a relation kind, or ground dated Work. |
| Scoped software semantics makes operation declarations, handler scope, and boundary behavior explicit without supplying a general Method-identity rule. | A.3.1:11 — Bosman et al., “A Calculus for Scoped Effects & Handlers” (2024), and Matache et al., “Scoped Effects as Parameterized Algebraic Theories” (2024), cited above. | Adapt and delimit. Use that boundary visibility to state exposed, forwarded, and encapsulated interactions. The rule that a boundary decision affects Method identity when it changes the reusable action or admissible boundary is an FPF decision; a named receiver triggers explicit statement or publication because callers and substituting-method uses need a stable boundary account. | Reject. Handler syntax, planner Work, publication layout, carrier choice, or diagram position does not decide whether an interaction is exposed, forwarded, or encapsulated. |
| Current constructional-ontology practice requires explicit constituents, constructive relations, dependence, and identity choices rather than inferring a whole from a diagram or label. | A.1:11 — Florio and Linnebo, Introduction to Constructional Ontology (2024), and Borgo and Righetti, “Towards Applied Constructional Ontology” (2025). | Adapt. Require exact part Methods, obtaining methodPartOf occurrences, other whole-forming claims at their A.6.RCD dispositions, a reusable whole action, and a reidentification rule because constituent names alone do not construct a Method whole. | Reject. Method-composition order is not A.14 structural parthood, and neither a C.13 notation nor one shared label creates the Method or a relation kind. |
Currentness and reopen. These four decisions are qualified by the exact source selections cited above. Reopen only the affected row when a cited source or edition is superseded, or when newer practice changes the relied-on model/occurrence separation, order or join condition, interface or substitution boundary, or construction and reidentification test. Recheck that row’s B.1.5 adoption, refusal, and affected Solution, worked-case, checklist, and Relations loci; leave unaffected rows closed.
B.1.5:12 - Relations
- Uses
A.1for the general non-agentive-holon recognition boundary; A.1 does not supply Method-part or whole-forming facts. - Uses
A.3.1to identify the exact candidate Method and every exact part Method before B.1.5 tests the composite-method qualification; B.1.5 directly governs onlyMethodPartOfRelationand the composite-construction test. - Uses
A.6.RCDfor serial, parallel, guarded, iterative, fallback, adapter, join, substitution, and other whole-forming claims. Existing direct predicates, local compound claims, and reusable predicate definitions are valid stopping results; only a named occurrence-semantics need requiresE.24 for a kind candidateandE.24.UK. - Uses
A.6.RELonly when an independently admitted relation kind has an obtaining occurrence whose identity a receiver consumes. B.1.5 does not manufacture occurrence semantics for ordinary claim content. - Uses
C.2.1to identify predicate-definition, signature, and MethodDescription epistemes and any later episteme with changed identity-bearing content. UsesEpistemeEditionRelationonly when C.2.1’s exact historical-continuation predicate obtains; otherwise the later episteme is a non-continuing replacement. A predicate definition may satisfy ordinary A.6.0U.Signaturemembership; only an admitted relation kind can have aRelationSignature. - Uses
B.1.4only when a receiving use needs an explicit aggregation of already admitted, obtaining order relations, anOrderSpec, and join or independence conditions. - Uses
A.3.2for each exact claim-bearingU.MethodDescriptionandE.24.PUBonly when a named use requires publication detail: independently identified bounded-use- and audience-declaration epistemes, boundary-account form andU.PresentationCarrier; exactPublicationFormExpressionRelationandPublicationFormBearingRelation; separate publication Work performed by a system; and the five-participantEpistemePublicationRelationoccurrence that makes the edition available. Raw audience and designation content remain separately governed. - Uses
A.22.CGUSwhen a real first–then, guarded, branching, or returning unfolding is the useful result; an unfolding position is not a subject level or evidence that all contributions are sequential. - Uses
A.15,A.15.1, andA.15.2for exact datedU.Work,enactsMethod, and plans; usesA.2,A.2.1, and F.6 for local system-role-kind and Method alignment, separately declared assignment species, actual assignment occurrences, and obtaining Work–assignment attributions. The Method does not act, Work is not a relying reader, and neither a system-role kind nor an assignment performs Work. - Uses
B.1.6andGamma_workonly for occurrence-side work-resource aggregation after the Work and resource relations are recovered. - Uses
B.3for cutset, weakest-link, CL-sensitive mapping, and assurance claims; composition alone supplies no assurance verdict. - Uses
A.22only for a real selected organization with its selection basis and four identity discriminators. A one-off hypothetical comparison and local whole-forming claims do not assert a selectedU.Structure. - Uses
C.13only after B.1.5 supplies exact Method parts, whole-forming facts and constraints, and the whole reidentification rule; C.13 consumes those facts but does not create them or require one relation kind per fact. - Keeps A.14 structural-component parthood distinct from Method composition; coordinates with
B.3.5only when a published structural claim and its grounding are current. - Uses
B.2when a separate higher-level reidentification or emergence-family explanation is current; ordinary composite-Method identity still needs its explicit B.1.5 rule. - Uses
G.5when a Method-family registry, selector, fallback, or candidate-set decision is current but no whole construction is claimed. - Uses
C.29,A.6.1, andE.20when a mathematical lens, formal substrate, mechanism, or representation-maintenance claim is current. - Uses
E.10for method, step, process, workflow, ownership/stewardship, requirement, and source wording precision recovery. - Stops before any positive transformation-composition or transformation-part claim until a direct governor supplies exact participants, obtaining semantics, and occurrence identity.
B.1.5:End
B.1.5.EW - Recover How Constituent Actions Enact Encompassing Work
Type: Method pattern Status: Stable
B.1.5.EW:1 - Problem frame
Use this pattern when you need to understand, perform, teach, divide or change a way of working and cannot yet explain how its constituent actions perform the encompassing work. A person knows each movement but loses the partnered dance. A team improves a calculation but no longer obtains a usable engineering answer. A description lists stages, yet the reader cannot tell what larger work is being done through the present action.
Start with one action and ask: “What am I doing through this action now, and what makes it part of that work?” Then recover the constituents needed to perform it and the conditions of the encompassing work that affect it.
The first useful result is an explanation you can use: the selected action, its relevant constituents and encompassing work, the connections that make the whole possible, and any difference that requires changing the action or its organization. A short demonstration can supply this result. A retained diagram or record is useful only when someone needs it later.
Use an already understood connection directly. This pattern does not require reanalysing every familiar act or finding the smallest possible action and largest conceivable whole. Stop where further detail would not change the present performance, learning, division of work or correction. Use B.1.5 when the separate question is whether identified Methods qualify as one composite Method; use C.32.MWA when several structures need to be synthesized into a practice architecture.
B.1.5.EW:2 - Problem
A sequence answers “what happens after what?”. It can leave out “what is being done through what?”. While a person adjusts a step to a partner, they can already be performing a coordinated figure and the phrase containing it. They do not first finish adjusting and only later start dancing the figure.
The relation matters for action. A step that is correct in a solo exercise may be wrong in this partnered phrase. Improving the isolated movement can reinforce the failure if the needed change concerns coordination or the encompassing intention.
The reverse mistake is to call every concurrent or indispensable activity a constituent. Music reproduction can support a dance without being part of the dancer’s Work as that Work is bounded. A planning decision made yesterday can still constrain today’s action without being performed again now.
B.1.5.EW:3 - Forces
- Familiar constituents make work possible, while their combination can introduce a difficulty absent from separate practice.
- Encompassing requirements constrain the parts; the parts’ actual capabilities limit what the whole can achieve.
- One action can serve several wholes, whose conditions can differ or conflict.
- A short account can guide action; unnecessary decomposition consumes the attention needed to act.
- The whole may be ongoing while only some of its constituents are active.
- A planned connection helps design work, but actual enactment needs the performed connection.
B.1.5.EW:4 - Solution
Recover the connection in both directions: what larger work is being performed through this action, and what constituent actions make it performable? Keep genuine before-and-after dependencies alongside these connections.
B.1.5.EW:4.1 - Choose an action and the work being explained
Name an action in a recognizable situation and the moment or interval under consideration. State whether you are explaining observed Work or proposing how future work could be done. Identify what is being attempted and what a useful result would be.
Use ordinary verbs first: adjusting a step, comparing a measurement, adding a value, questioning an assumption. If the description supplies only a noun such as “coordination”, recover what the participant actually does.
B.1.5.EW:4.2 - Recover an encompassing performance
Ask what larger action is being done through the selected action now. Explain the organizing connection: which part of that larger action this performs, how it combines with other contributions, and under which conditions.
For an actual occurrence, this connection must concern the performed work. Merely intending to obtain a later benefit is insufficient. A contribution can constitute part of an ongoing attempt even when that attempt fails; successful completion is a further question.
Distinguish three possibilities where they change your answer:
- The same Work enacts several Methods.
- An independently identifiable performed suboccurrence is an operational part of encompassing Work under A.15.1.
- One Work supports, overlaps or supplies a later result to another without being its constituent.
Choose the occurrence account that fits the work. Several descriptions do not require several Work occurrences. Identify a suboccurrence separately when its extent, performer, result, resource use or correction needs to be distinguished.
A useful test is to explain the positive connection, not just what would fail if the action disappeared. Removing an external power supply can stop a calculation; that fact alone does not make power generation part of the analyst’s Work.
B.1.5.EW:4.3 - Follow constituent and encompassing work
Continue through the constituent–whole connections in the selected Method or Work structure only while the next encompassing whole’s conditions change the action, its learning or its use. Explain each intervening connection. If an action serves two wholes, keep both uses and their different conditions visible.
Then ask what you must be able to do, or obtain from another participant, to perform the selected action. If a described construction remains unclear, use B.5.RC to recover its inputs, operations, conditions and a small execution. If you lack the domain know-how, obtain an explanation or demonstration. If you understand the operation but cannot perform it in the combination, practise with the encompassing conditions, obtain support or use another qualified contributor. Stop a branch at an understood operation or an available contribution sufficient for this use.
These moves need not end in one tree. Nor does following several connections establish an unrestricted transitive parthood rule. Carry the actual conditions through the intervening wholes. A move from an action to its enabling tool, or from a Method to a more general Method, changes the relation; describe it accordingly.
B.1.5.EW:4.4 - Examine the combination at a revealing moment
At the chosen moment, identify what must be coordinated and what can vary. Keep prior-result requirements: an operation can be a constituent of an ongoing whole and still have to wait for another constituent’s output.
Change one condition of the encompassing work in thought or in a suitable trial. Determine what must change in the constituent action. Then consider a limitation of that action and determine which encompassing performance it prevents or restricts. Use available knowledge when it answers these questions; a new experiment is not automatically required.
Where control is involved, first check whether the feedback concerns the response and interval being judged. Delayed or misleading feedback can make adequate execution look wrong. Then distinguish failure to follow the reference from accurate execution of a reference that is no longer feasible or useful. A reference may remain in force between updates; generating or revising it is separate work. C.30.LCA helps recover the control relations when those are unclear. Claims about dynamics, feasible response or timing need their subject-specific basis; a conflict requiring architecture change can continue through C.30.ILC.
B.1.5.EW:4.5 - Use the explanation to continue or correct the work
Choose the correction that the recovered connection supports:
| What prevents the encompassing performance? | Useful continuation |
|---|---|
| A needed operation is unknown or cannot be performed. | Recover, learn or obtain that contribution; retain the whole conditions while doing so. |
| The operation is understood but this execution violates its conditions. | Correct the execution and inspect the affected encompassing result. |
| Individually adequate operations do not fit together. | Change their coordination, order, shared conditions or allocation; examine the burden moved elsewhere. |
| The reference or requested result cannot be met under current conditions. | Reconsider that reference, demand or available means with the participant who can change it. |
| The description assigns a connection that the work does not support. | Repair the account; do not change the work merely to fit the diagram. |
| A constituent could be replaced. | Use B.1.5.RS to preserve the requirements of its receiving wholes. |
A diagnosis may remain conditional when two explanations fit. Obtain further information only if it can change the next useful action and warrants its burden under C.11.DUA. More encompassing work does not automatically confer authority to override a participant’s constraints.
Return the explanation, any selected correction and the conditions that matter for using them. Recognition of a plausible connection is not assurance of successful performance. Establish a stronger composition, causal or performance claim only when the receiving use requires it.
B.1.5.EW:5 - Archetypal Grounding
B.1.5.EW:5.1 - A step within a partnered phrase
During one beat, a dancer transfers weight while adjusting the direction and size of the step to the partner’s movement. That adjustment is part of performing the coordinated turn; the turn is part of performing the phrase with its intended timing. The turn and phrase are ongoing through this action, although neither is yet complete.
A solo drill established that the dancer can make a large turn. In the partnered phrase, that amplitude pulls the partner off the shared line. The correction is to reduce the step and preserve the connection, not to repeat the large turn more accurately. A slower musical phrase changes when weight transfer must finish and how long the connection must remain available.
A different dancer has adequate strength and static axis control and knows the figure, but cannot maintain balance during its rotation. The missing performance lies between available muscular actions and the known figure. More strength practice or sequence recall need not repair this stipulated gap. Develop the rotational coordination in suitable practice, then return to the figure and vary the conditions that affect the combination. Keep already attained abilities; test the needed intermediate performance rather than assuming that mastery below and knowledge above fill it.
The selected Work structure here connects the performed movement, coordinated figure and phrase through their constituent–whole relations. Playing the recording is external support under this boundary. Practising these movements may later contribute to cultural transmission, but one beat does not establish that a cultural variant persists in a population.
B.1.5.EW:5.2 - An update within a running calculation
An analyst is totaling accepted observations as part of preparing a report. The algorithm maintains a running sum. On reading the next value, adding it to the accumulator is a constituent of computing the total; computing that total is part of the report preparation currently under way. The addition, computation and report preparation do not incur three copies of that minute of work.
The addition is correct over the supplied numbers. The report, however, requires excluding duplicate observations. If duplicate detection is missing, more precise addition cannot repair the report. Recover the accepted-observation rule and apply it before the affected update. The genuine order remains: the next update consumes the current accumulator, and the report cannot use the final total before the calculation finishes.
A scheduler running on the same machine overlaps the calculation. That overlap alone makes it neither an arithmetic constituent nor report-preparation Work.
B.1.5.EW:5.3 - Continuing operation between plan updates
A delivery team is following a route. Each driving action is part of progressing along that route and performing the delivery. Route planning was done earlier. Its result still constrains driving; the team is not performing the planning Work at every instant.
A newly closed road makes the old reference unusable. Better steering cannot restore feasibility. The team needs a revised route under the actual road and delivery constraints. If the road is open and the driver has merely missed a turn, execution correction may suffice. This distinction locates the useful intervention without imposing a fixed number of control levels.
B.1.5.EW:6 - Bias-Annotation
An observer can recognize their own specialist operation while missing the connection needed by another participant. Ask the receiver what the encompassing work requires. Equally, do not presume that a manager’s broad description supplies the constituent expertise. Actual constraints can invalidate the requested whole.
B.1.5.EW:7 - Conformance Checklist
- Can the reader identify the action and actual or proposed work being explained?
- Is each claimed encompassing connection explained through performed or proposed organization, rather than timing or importance alone?
- Are the needed constituents recoverable without indefinite decomposition?
- Does a consequential change in whole conditions produce an intelligible change in the action?
- Are genuine result dependencies and relevant external support retained?
- Does the result identify a useful continuation without claiming that recognition establishes success or assurance?
B.1.5.EW:8 - Common Anti-Patterns and How to Avoid Them
| Failure | Repair |
|---|---|
| Three level names stand in for an explanation. | Show what the selected action does in each encompassing performance at the chosen moment. |
| A stage list conceals current constitution. | Explain both what is done through the action now and which result must become available later. |
| Every description creates another Work and another time charge. | Use the performed history and the receiving accounting question to identify occurrences and parts. |
| All constituents must run at once. | Identify the active constituent and preserve the other constituents’ timing conditions. |
| Successful isolated practice is treated as mastery of the combination. | Practise the relevant whole and vary a condition that changes coordination. |
B.1.5.EW:9 - Consequences
The practitioner can locate a missing ability, combination condition or unworkable demand instead of treating every failure as poor execution. The account also makes division of work more useful: a contributor receives the conditions of the whole, not only an isolated task name.
Recovering these connections takes effort. Bound it by the action or explanation needed; reuse understood constituents and retain unresolved distinctions only when they affect that use.
B.1.5.EW:10 - Architectural Rationale
Work can be described at several grains without becoming several successive activities. Constitution explains why doing a part is already participating in doing the whole. Temporal order explains a different dependence, including order among those parts.
A practitioner can explain how one occurrence is performed without first establishing a reusable composite Method. Recovering that connection is enough when it answers the working question; synthesizing several practice structures is useful when their different organizations affect the decision.
B.1.5.EW:11 - SoTA-Echoing
Craver and Bechtel’s mechanistic account is a historical anchor for distinguishing constitutive organization from causal interaction. Weinberger’s critique shows why identifying intermediaries does not settle every explanatory question. This pattern adopts the need to explain organized participation; it imports no universal theory of causation or experimental test for parthood.
Matni, Ames and Doyle explain interacting control functions with different rates and recursively refinable organization. Their formal control constructions support the control example; they do not establish the constitution of every human practice. The practical recovery operation here is a methodological synthesis under FPF’s Method and Work distinctions.
For the practical question here—what larger work is being done through this action, and why must the action change—a lifecycle account is a serious but incomplete alternative. It usefully preserves preparation, delivery and other genuine precedence. It does not by itself explain why a smaller partnered step performs the figure better than a larger solo step at the same moment. Sections 4.2 and 4.4 therefore adopt organized-participation recovery and a changed-whole-condition comparison, retaining the lifecycle account where order matters. A short explanation can settle this question without building a full practice architecture.
A fixed control-layer diagram is another useful alternative when the problem already has a justified controller/reference/plant interpretation. The Matni–Ames–Doyle account helps interpret such a case and its differing rates. Section 4.4 retains the distinction between inadequate execution and an infeasible reference; section 4.2 requires the particular constituent connection rather than inferring it from diagram depth. For non-control work, the source’s formal constructions provide an analogy, not its ontology or a guarantee. Reopen this synthesis if a worked case requires causal influence to be mistaken for constitution, if its changed condition fails to discriminate the proposed connection, or if a simpler subject Method supplies the same useful correction. Where only an earlier-result dependency matters, keep that dependency account and stop.
B.1.5.EW:12 - Relations
- B.1.5 supplies Method-composition conditions; A.3.1 supplies Method identity.
- A.15.1 supplies Work enactment and operational parthood.
- B.5.RC helps recover an unfamiliar construction from its description. Missing domain knowledge or performing capability retains the separate returns in section 4.3.
- B.1.5.RS tests a proposed constituent replacement in its receiving wholes.
- C.30.LCA and C.30.ILC address control-specific interpretation and cross-scope architecture conflict.
- C.32.MWA handles synthesis when several practice structures must be considered together.
- C.11.DUA bounds further investigation by what it can change.
B.1.5.EW:End
B.1.5.RS - Evaluate a Constituent Method Replacement in Its Encompassing Uses
Type: Method pattern Status: Candidate
B.1.5.RS:1 - Problem frame
Use this pattern when a constituent Method could be replaced, simplified or implemented differently and you need to know which encompassing uses remain possible. A faster check returns the same answer on familiar inputs but no longer exposes information another part needs. An approximation is adequate for ranking options but unsuitable for deciding whether a limit is exceeded.
Start with the direction of replacement and the practical gain sought. Ask: “What do the receiving wholes rely on, and does this candidate still supply it under their conditions?”
The first useful result is a bounded substitution decision: the uses preserved, uses needing adaptation or restriction, and uses for which the replacement is incompatible or unresolved. One decisive comparison may be enough. Do not perform a new trial when an available argument or known counterexample settles the decision.
Use B.1.5.EW first if the constituent and its encompassing uses are unclear. If only the wording or diagram changes and the performed Method remains unchanged, check that representation’s correspondence instead. If the replacement supplies an entire standalone Method, use the relevant fit and choice Methods; this pattern contributes only the constituent-in-whole question.
B.1.5.RS:2 - Problem
Local adequacy does not establish substitutability. The whole can depend on output meaning, intermediate interactions, order, timing, recoverability or resource demand that a local comparison omitted. A shared constituent can satisfy one whole and fail another.
The opposite failure is to demand that every internal detail remain identical. This prevents useful replacement even when the receiving work does not depend on that detail. The preservation question must come from the actual use.
B.1.5.RS:3 - Forces
- A local gain can remove a contribution needed elsewhere.
- Several uses may require different guarantees from the same constituent.
- Simplification saves effort when its lost detail is irrelevant to the receiving action.
- Strong evidence can be expensive; a bounded argument or counterexample may already settle the next move.
- A common replacement reduces maintenance, while separate variants can preserve otherwise incompatible uses.
- Method identity, description correspondence and performance evidence answer different questions.
B.1.5.RS:4 - Solution
Compare the candidate against what the encompassing work needs, then carry the changed contribution through that work. State the direction and conditions of the result.
B.1.5.RS:4.1 - Name the proposed change
Identify the current constituent, its candidate replacement and the gain: for example, reduced delay, effort or dependence on a scarce specialist. State what changes in the operation, its inputs, outputs, interactions or realization.
Keep a proposed replacement separate from one already performed. Use A.3.1 to settle any needed identity claim: exposing a hidden step, changing an implementation within an admitted variation and proposing another Method need not have the same answer.
B.1.5.RS:4.2 - Recover the receiving wholes
Identify the encompassing Methods or work arrangements whose use can change. Follow an indirect use through the intermediate whole while it affects the decision. Include a second receiving use when the constituent is shared; local success in the first use is not evidence for the second.
This is a search bounded by the intended replacement. If the actual users cannot be recovered, restrict adoption to the known uses or return the missing use information that prevents a broader decision. Do not require an inventory of all imaginable uses.
For each relevant whole, recover:
- what it supplies or assumes at the constituent’s entry;
- what result or interaction it needs from the constituent;
- timing, ordering, coordination and resource conditions that affect this use;
- what variation or loss it can tolerate.
Plain statements are sufficient when they make the comparison executable. Use an existing interface or formal contract when it already states these conditions.
B.1.5.RS:4.3 - Compare the contribution under those conditions
Apply the proposed constituent to the receiving conditions. Follow what it supplies through the affected part of the whole, including an interaction before final output when the whole relies on it.
Choose an argument, available observations, calculation or trial that can discriminate the decision at proportionate cost. A known violation can reject a general replacement without testing every possible input. A successful example can reveal a usable construction but does not automatically support all inputs.
When an approximation is proposed, state the property preserved for the receiving use: a bound, ordering, feasible action, specified error or other needed consequence. Equal rounded answers on one example do not establish preservation of a different property.
If the same implementation must serve several wholes simultaneously, examine their joint demands. Separate success under incompatible settings is not one shared implementation. Compare retained variants or changed coordination where that is useful.
B.1.5.RS:4.4 - Classify the replacement by use
| Comparison result | What can follow |
|---|---|
| The needed contribution and conditions are preserved. | Adopt the replacement for that use at the supported scope. |
| Preservation holds only under a narrower condition. | Restrict use to that condition and retain a suitable alternative elsewhere. |
| An adapter or changed combination can restore the needed contribution. | Treat that adaptation as part of the candidate and check its full burden and behavior. |
| A required contribution is lost. | Reject the replacement for that whole, change the requirement through the relevant decision, or choose another candidate. |
| Information does not distinguish compatibility from failure. | Keep the uncertainty bounded and obtain more only if it can change a worthwhile next action. |
This is a directed conclusion. Replacing A by B in one use does not show that A can replace B, that they are the same Method, or that B is preferable in all uses.
B.1.5.RS:4.5 - Adopt or retain alternatives
Choose at the supported scope, accounting for adaptation, learning, operation and maintenance costs. Retain separate variants when their different strengths justify the burden; a single universal replacement is not required.
For an ongoing operation, use its ordinary rules for introducing change and retaining continuity. State the condition that would require reconsideration: changed inputs, another receiving whole, a tighter timing limit, lost support or a newly relevant result property. No separate certificate or trial is required merely to record that an existing basis was sufficient.
Return the decision in the form its receiver needs. Where the conclusion is only recognition of a plausible substitute, say so. A claim of guaranteed preservation needs the argument or assurance appropriate to that claim under B.3; a local decision under uncertainty uses C.11 and C.11.DUA.
B.1.5.RS:5 - Archetypal Grounding
B.1.5.RS:5.1 - Faster ordering in two encompassing uses
A team proposes replacing a stable sorting Method with a faster one that need not preserve the input order of equal keys.
One whole prepares a table showing how many records occur at each key. Internal order among equal keys does not affect those counts. Subject to the remaining input and performance conditions, the candidate can supply that contribution.
Another whole schedules requests by priority while retaining arrival order among requests of equal priority. Its method first orders records by arrival and then stably orders them by priority. Replacing the second sort with the candidate can reverse equal-priority requests. The earlier arrival ordering no longer survives the composition.
An allowed reversal of two equal-priority records with different arrival times exposes the incompatibility with the required guarantee. This is a counterexample to unrestricted replacement, not a prediction that this implementation reverses every such pair; repeated random benchmarks cannot restore the missing guarantee. Options include retaining the stable Method or sorting by an explicit compound key of priority and arrival. The compound-key candidate has changed the operation; compare its behavior and cost before using it. The same “sorted by priority” description concealed different requirements of the two wholes.
B.1.5.RS:5.2 - A bounded estimate and a threshold decision
A constituent estimates a quantity with absolute error at most 2. A receiving whole only needs to distinguish alternatives separated by more than 4; the bound can support their ordering when both estimates satisfy it.
Another whole must decide whether the quantity exceeds 100. An estimate of 99 is insufficient: the admitted interval is 97 to 101 and crosses the threshold. A more accurate estimate or another decision rule is needed for that case. At an estimate of 95, the same error bound puts the whole interval below 100 and can settle that particular decision.
The change from “estimate the quantity” to “support this decision” makes the scope of replacement explicit. The threshold is stipulated in this constructed example; the pattern does not supply a rule for choosing it.
B.1.5.RS:5.3 - A quicker observation during coordinated work
A group performs a movement sequence in response to a leader. A proposed observation Method uses occasional snapshots rather than continuous observation. It can suffice for an exercise in holding a static pose, but miss the cue that starts a coordinated transition.
Recover the timing actually needed by the encompassing sequence. If the snapshot interval exceeds the available response window, better interpretation of each snapshot cannot restore the missed cue. Keep more frequent observation, redesign the cue so it remains available, or change the coordinated sequence. Each proposal has a different burden and requires its own bounded comparison.
B.1.5.RS:6 - Bias-Annotation
The participant proposing a replacement often sees its local saving more clearly than the costs borne by other users. Recover the receiving requirements before choosing. A demand to preserve everything can conceal the opposite bias: treating familiar implementation detail as necessary even when no receiving use depends on it.
B.1.5.RS:7 - Conformance Checklist
- Are the constituent, candidate, replacement direction and intended gain clear?
- Have the relevant receiving wholes and their relied-on contributions been recovered?
- Does the comparison carry the changed contribution through each affected use?
- Are joint requirements examined when one realization must satisfy several uses together?
- Does the conclusion preserve its conditions and evidence reach?
- Are adaptation costs and a useful reconsideration condition included where they change adoption?
B.1.5.RS:8 - Common Anti-Patterns and How to Avoid Them
| Failure | Repair |
|---|---|
| One matching output stands in for preserved behavior. | Recover the timing, interaction or property actually used by the whole and test that contribution. |
| Compatibility in one whole is exported to every user. | Separate receiving uses and restrict the conclusion accordingly. |
| Every implementation detail must remain unchanged. | Preserve what the declared use relies on; permit changes outside that dependence. |
| An adapter is omitted from the candidate’s cost or failure analysis. | Include the adapter in the candidate arrangement and follow the combined behavior. |
| A successful trial becomes an unconditional guarantee. | State its supported scope and establish stronger claims only when required. |
B.1.5.RS:9 - Consequences
Useful replacements can be adopted where they work without silently breaking other wholes. An incompatibility can also expose a better architecture: different variants, an explicit interface or a changed combination.
The method requires knowledge of receiving uses. Its cost grows with meaningful differences among them, not necessarily with the number of documents or callers. Reuse one comparison across uses only when their relevant conditions and relied-on contribution match.
B.1.5.RS:10 - Architectural Rationale
Substitution is a relation to a receiving use. A constituent’s attractive property does not establish that relation. Recovering the whole’s dependence avoids both unrestricted replacement and unnecessary preservation of detail.
When the receiving uses are already understood, the practitioner can begin with their requirements and compare the replacement directly. The result is a directed substitution decision across one or several uses, including a candidate that changes the whole to accommodate the new constituent.
B.1.5.RS:11 - SoTA-Echoing
Mazo, Compton, Cohen and Ames formulate compositional contracts for layered control systems. Their contribution supports checking what adjacent functions assume and supply, including their different signal and timing models. This pattern uses that conditional-composition idea beyond the paper’s system class; its formal guarantees are not generalized.
The stable-sort case illustrates contextual preservation by an elementary algorithmic counterexample. The bounded-estimate case applies ordinary interval reasoning. These are constructed cases of the common Method, not evidence that every constituent requires a formal contract or a numerical error bound.
For the practical question of substituting a constituent, a local performance benchmark is a serious alternative: it can reveal speed, cost and errors on its tested inputs. It does not establish that a replacement preserving totals also preserves arrival order, or that its error bound supports the required threshold decision. Sections 4.2–4.4 therefore select receiving-use conditions first, then derive or test only the preservation those uses need. The worked counterexample or an available bound can settle the stated question at less effort than an additional benchmark; an unresolved performance question can still justify a targeted trial.
Formal compositional contracts offer a stronger alternative where the constituent, interfaces and encompassing system fit their mathematical assumptions. The cited control theory makes those assumptions and guarantees explicit. This Method adapts that conditional comparison into ordinary statements of inputs, interactions, results and permitted losses; it keeps the formal proof when its additional assurance is useful and attainable. It does not treat every professional practice as a control-system instance. Reopen the selected comparison when an unmodeled interaction, shared realization, changed receiver or unsupported adaptation defeats the preservation claim. If one constituent cannot satisfy the relevant uses together, retain different variants or change the encompassing arrangement instead of declaring one universally better Method.
B.1.5.RS:12 - Relations
- B.1.5 and A.3.1 define Method composition, identity and replacement-claim distinctions.
- B.1.5.EW recovers constituent and encompassing work when those connections are not yet understood.
- B.5.RA and B.5.RR reconstruct and revise the argument on which preservation depends.
- C.29 governs a mathematical correspondence used in the comparison.
- C.30.LCA supplies control-specific conditions; C.30.ILC addresses resulting cross-scope architecture conflicts.
- C.11 and C.11.DUA govern the local decision and whether further investigation is useful.
B.1.5.RS:End
B.1.6 - Work-Resource Aggregation
Type: B-family aggregation pattern Status: Stable Normativity: Normative unless explicitly marked informative
Use this when. Use this pattern when the current claim aggregates resources, effort, time, energy, material, information, cost, or another measured resource over exact dated Work occurrences, A.15.1 temporal or operational Work parts, event-bounded episodes, non-Work carrier phases with an established identity and PhaseOf relation, boundary partitions, or comparable work-resource ledgers.
Not this pattern when. If the current question is the method as a way of doing, use A.3.1. If it is a method description, SOP, algorithm text, simulator configuration, or formal expression, use A.3.2. If it is a work plan, use A.15.2. If it is whether Work occurred or which Work temporal part, episode, operational part, retry, resumption, or later occurrence is current, use A.15.1. If it is work-entry readiness, full-kit condition, or resource readiness before work entry, use A.15.5. If it is bounded aggregation of already recovered temporal relations without resource accounting, use B.1.4. If it is a transformation claim, use A.3.4. If resource gain leaves whole identity in question, use B.2; use B.2.P only when emergence-family wording is unresolved.
What goes wrong if missed. Resource, effort, time, energy, or cost totals are read from methods, plans, dashboards, or phase labels without a dated work occurrence, resource ledger, and overlap policy.
What this buys. A replayable chain that keeps the resource Characteristic, measurement work/result episteme, aggregation work/result, exact policy, work parthood/overlap, and provenance separately recoverable while preventing double counting.
B.1.6:1 - Problem Frame
Practitioners need to roll up work-resource claims across runs, exact A.15.1 Work temporal parts or episodes, teams, devices, stations, model-training epochs, non-Work carrier phases with an established identity and PhaseOf relation, or evidence-production occurrences. The recurring error is to treat a method, method description, plan, phase label, dashboard, or expected efficiency as if it were measured performed Work or as if the label established a Work relation.
Use B.1.6 for the work-resource aggregation claim. Treat dated work occurrence, Method, MethodDescription, WorkPlan, resource ledger, holon delimitation, transformation, evidence, and whole reidentification as separate claims under their applicable patterns.
B.1.6:1.0 - Problem
Work-resource totals are often borrowed from plans, method descriptions, dashboards, or phase labels even when no performed-work evidence, resource-accounting basis, holon delimitation, time window, and overlap policy have been recovered. The failure is to treat a convenient total as a work-resource aggregation claim before the dated work occurrences and resource ledger are explicit.
B.1.6:1.1 - Forces
| Force | Tension |
|---|---|
| Measured work vs. planned work | Expected yield, duration, or resource use helps planning, but cannot prove performed-work resource use. |
| Typed resources vs. convenient totals | Energy, mass, time, cost, data volume, and attention can be compared only after their resource-accounting basis and conversion relation are declared. |
| Boundary accounting vs. local convenience | Resource values are useful only when the holon delimitation, boundary-crossing relation, stock relation, and time window are named. |
| Additivity vs. shared stocks | Disjoint partitions can be added; shared meters, tools, people, inventories, data, or ports need overlap and deduplication policy. |
| Efficiency vs. whole reidentification | Apparent free gain may be measurement, changed accounting basis, substitution, or a new whole; B.1.6 cannot decide that by resource wording alone. |
B.1.6:2 - Solution — separate measurement from aggregation
Start with one direct sentence:
Dated aggregation work
W_aggapplied policyPto the exact C.16 resource-result epistemes for work setW_set, under declared work-part/overlap relations and accounting boundaryB, and obtained aggregation resultR_agg; C.2.1 epistemeE_aggstates that result and A.10/G.6 record its provenance.
If any referenced resource value lacks its resource Characteristic, measurement work, result episteme, Scale/Unit, uncertainty when current, or provenance, it is not repaired by adding a ledger row.
WorkResourceAggregation@Context is a descriptive account for one aggregation claim:
WorkResourceAggregation@Context:
aggregationConcernRef
claimScopeRef?: U.ClaimScope
accountingBoundaryRefs
timeWindowRefs
aggregatedWorkOccurrenceRefs
resourceUseRelationRefs
workPartOrOverlapRelationRefs
nonWorkCarrierPhaseRelationRefs?
resourceCharacteristicRefs
measurementWorkRefs
measurementResultEpistemeRefs
aggregationMethodRef
aggregationOperationDeclarationRef?
aggregationPolicyRef
conversionOrNormalizationRefs?
aggregationWorkRef
aggregationResultRef
aggregationResultEpistemeRef
provenancePathRefs
admissibleUse
stopOrReturnCondition
nonAdmissibleOverread?
stopOrReturnCondition states when to stop or return to another pattern. Include nonAdmissibleOverread? only when it passes F.19’s plausible-reader test. groundedNonAdmissibleOverread? is an alias for that same optional value.
Recover each of these objects and claims independently:
- a resource Characteristic says which quantity or property is accounted for;
- measurement work and a C.16 measurement-result episteme supply each attributed resource value, Scale, Unit, uncertainty, model, calibration, and time stance;
- the aggregation policy declares inclusion, conversion, weighting, missing-value, partition, overlap, and deduplication rules;
- aggregation work has its actual performer identified through A.13 and is independently admitted as dated
U.Workthrough A.15.1; if the aggregation account must also identify the assignment under which the Work was performed, F.6 checks that relation separately; Method, actual inputs through direct relations or A.6.1 bindings, resources, and temporal extent remain separate; - the B.1.6 aggregation result is the typed total, vector, interval, or bounded estimate obtained under that policy and work set;
- a distinct C.2.1 aggregation-result episteme states the result, work set, policy, boundary, time window, qualifications, and uncertainty; and
- A.10/G.6 provenance makes the measurement sources, transformations, aggregation work, and result episteme replayable.
A ledger, dashboard, policy, profile, clause, citation, or graph edge may represent or cite this chain. None establishes work occurrence, actual participation, measurement, aggregation, or result identity by presence.
B.1.6:2.1 - Subject Pattern Map
| Current claim | Subject pattern |
|---|---|
| Resource Characteristic, Scale, Unit, measurement model/calibration, measurement work and result | C.16 for measurement; A.13 for each actual performer; A.15.1 for independent Work admission; F.6 when the result must also identify the assignment under which the Work was performed; and A.6.1 for actual bindings |
| Dated aggregation Work and actual performer | A.13 identifies the actual performer, then A.15.1 independently admits the Work. Add F.6 only if the result must also identify the assignment under which the Work was performed. Method enactment and actual inputs remain separately governed, including A.6.1 bindings when used. |
| Work temporal part, episode, operational part, partition, overlap, retry, resumption, or later occurrence | A.15.1 and the exact Work relation pattern; use B.1.4 only to aggregate already recovered temporal relations |
| Proper temporal restriction of another enduring carrier | that carrier’s direct identity pattern plus A.14 PhaseOf; never a substitute for Work relations |
| Overlap, shared-stock, boundary, and deduplication facts | C.27.TA for interval overlap; the exact stock, resource-use, boundary, or accounting relation pattern for the other fact |
| Aggregation policy and typed aggregation result | B.1.6 |
| Measurement-result and aggregation-result epistemes | C.2.1; A.15.PROD only when their inception through work matters |
| Source recovery and provenance | A.10 and G.6; E.17 for publication |
| Edition currentness | G.11 |
| Planned work or resource readiness | A.15.2 or A.15.5, never a measured aggregation result |
| Transformation, whole reidentification, assurance, comparison, or decision | the applicable A.3.4, B.2, B.3, A.19, C.11, or other pattern for that exact claim |
B.1.6:3 - Optional Gamma_work Notation
Gamma_work is optional notation for a recovered WorkResourceAggregation@Context.
Gamma_work(workResourceAggregationRecord, resourceBasis, aggregationPolicy)
-> aggregationResultRef, aggregationResultEpistemeRef
The notation applies only after the resource Characteristics, C.16 measurement Work and result epistemes, dated Work set, every A.15.1 Work-part relation used by the aggregation, any C.27.TA overlap fact used by it, any separately current non-Work carrier identity and PhaseOf relation, accounting boundary and time window, aggregation policy, and dated aggregation Work have been named. The notation then summarizes that recovered aggregation record.
B.1.6:4 - Ledger Discipline
The ledger is a replay surface, not the source of the aggregation claim. For every resource component it records:
- resource Characteristic, Scale, Unit, polarity when relevant, and accounting boundary;
- exact measured or estimated subject, time window, and work occurrence to which the value applies;
- C.16 measurement work and measurement-result episteme, including model, calibration, uncertainty, and provenance refs when current;
- every A.15.1 Work-part relation used by the ledger, every C.27.TA overlap fact used by it, and any separately current non-Work carrier
PhaseOf, each independently established by its subject pattern; - shared resource, meter, person, tool, stock, data, port, or time-window overlap and the exact deduplication rule;
- conversions, normalizations, imputations, and their declared method/policy refs;
- the aggregation policy edition and actual aggregation work occurrence;
- aggregation result and distinct C.2.1 result episteme; and
- A.10/G.6 source and provenance refs, G.11 currentness when current, admissible use, stop or reopen condition, and any guard justified by F.19’s plausible-reader test.
Measured, estimated, normalized, converted, allocated, and planned values remain visibly different. A planned value does not become a measurement result or performed-work resource use. A citation to a meter or invoice does not establish the measurement work; a ledger row does not establish work parthood or overlap.
Use PortionOf only for a resource portion with its A.14 measure and additivity basis. Use PhaseOf only for a proper temporal restriction of one unchanged non-Work carrier after its direct identity rule and interval conditions hold. For Work, use A.15.1 TemporalPartOf_work, EpisodeOf_work, OperationalPartOf_work, or another admitted Work-part relation only between independently admitted Work participants after its predicate passes. Route interval overlap through C.27.TA. Use retry or resumption only through a locally declared species with the needed participant meanings, predicate, identity, cardinality, and applicability; otherwise keep separately identified occurrences. Belonging to a collection, common timestamps, shared identifiers, a phase label, or co-listing in the ledger establishes none of those relations.
B.1.6:5 - Aggregation Rules
Typed resource basis. Aggregate only values whose resource Characteristic, Scale, Unit, subject, and accounting boundary are compatible under the declared policy. Joules, hours, kilograms, currency, bytes, and attention do not become one scalar by co-location.
Measurement before aggregation. Each measured input points to exact C.16 measurement work and one measurement-result episteme. Raw meter output, indication, resource stock, attributed value, aggregation input, and later efficiency verdict remain distinct.
Exact Work set. Name every dated Work occurrence included. Parent–child, TemporalPartOf_work, EpisodeOf_work, OperationalPartOf_work, and other admitted Work-part relations must already obtain between exact Work participants under A.15.1 or their direct subject patterns. Any overlap fact comes through its exact C.27.TA temporal declaration. A Method, plan, epoch or phase label, invoice period, or dashboard grouping does not establish the Work set.
Exact policy. The aggregation policy states inclusion/exclusion, conversion, normalization, weighting, missing-value treatment, boundary allocation, uncertainty treatment, overlap/deduplication, and output kind. A policy declaration is not aggregation work or a result.
Overlap and shared stocks. Addition is admissible only for disjoint partitions or after an exact policy handles overlap. Shared people, tools, meters, inventories, datasets, ports, and time windows require the direct shared-use/overlap fact and a justified allocation or deduplication rule.
Aggregation work and result. Use A.13 to identify the actual performer and A.15.1 to admit the dated aggregation Work independently. If the aggregation account must also identify the assignment under which the Work was performed, check that relation separately through F.6. Keep the Method, actual bindings, resources, and time separate. State the B.1.6 result as a typed total, vector, interval, or bounded estimate under the named policy and Work set; then state it in a distinct C.2.1 episteme.
Uncertainty and provenance. Propagate measurement uncertainty and model/conversion uncertainty according to the exact aggregation policy. Use A.10/G.6 paths to record the established work, measurements, policy application, transformations, result, and sources.
Plan/result separation. Keep expected use from a method description or WorkPlan as planned and resource readiness under A.15.5. Use A.15.1 and the measurement or aggregation predicates for performed Work and measured results.
Efficiency and yield. A ratio or yield claim names its input resource results, exact output/domain result, measurement bases, aggregation work, and comparison policy. It does not use a generic output-result relation. Apparent free gain remains a measurement, accounting-boundary, substitution, or whole-reidentification question until its subject pattern is recovered.
B.1.6:5.1 - Compact Obligation Rows
| Obligation | What must be named |
|---|---|
| Resource input | Resource Characteristic, Scale/Unit, subject, C.16 measurement work/result episteme, uncertainty, time, and provenance |
| Work set | Dated Work occurrences, every A.15.1 Work-part relation used by this aggregation, and every C.27.TA overlap fact it uses; any non-Work carrier phase keeps its own identity rule and PhaseOf relation |
| Policy | Edition, inclusion, conversions, weights, missing values, boundary allocation, uncertainty, overlap/deduplication, and output kind |
| Aggregation execution | Actual performer identified through A.13; dated U.Work independently admitted through A.15.1; a separate F.6 check when the result must also identify the assignment under which the Work was performed; separate Method, resources, and actual direct/A.6.1 bindings |
| Aggregation result | Typed result, work set, policy, boundary, window, qualifications, and distinct C.2.1 episteme |
| Provenance/currentness | A.10/G.6 paths and G.11 result when currentness affects use |
| Later use | Exact receiving work and direct premise/reference/argument/decision-use relation |
B.1.6:6 - Archetypal Grounding
Engine test programme. C.16 measurement Work attributes fuel mass, electrical energy, operator time, and emissions values to exact subjects under their Scales, models, calibration bases, windows, and uncertainties. Each has its own result episteme. Exact test-run occurrences and obtaining A.15.1 Work-part relations define the included Work set; independently declared C.27.TA overlap facts state shared timing. A test-cell or engine phase enters only through the carrier’s identity rule and proper phase relation. Shared warm-up energy is recorded under the exact temporal and resource-use facts. Dated aggregation Work applies ProgrammeResourcePolicy-v3, which allocates warm-up energy once and propagates input uncertainty. The B.1.6 result is a typed resource vector plus qualifications; a C.2.1 episteme states it. A later emissions verdict remains separate evaluation Work and result.
Manufacturing cell. Welding and painting are two dated work occurrences. Electricity, gas, consumables, and labor time are separate resource Characteristics with measurement-result epistemes. A shared extraction fan and overlapping operator time require direct shared-use facts and an allocation policy. The resource ledger represents those facts. Establish any separately claimed Work-part relation or frame transformation through its direct pattern.
Model training. Epoch labels alone do not establish work parts. Ground the training work and exact slices, then recover C.16 measurements for compute energy, storage traffic, and operator time. Aggregation work applies an edition-pinned policy to those result epistemes. The training Method, any algorithm text that qualifies as its MethodDescription, and the dated training Work remain distinct; trained-model identity, fairness result, provenance, assurance, and deployment decision stay with their subject patterns.
B.1.6:6.1 - Bias-Annotation
| Bias risk | Failure | Mitigation |
|---|---|---|
| Plan becomes measurement or aggregation | Expected resource use is presented as performed work or an obtained total. | Keep the plan, dated work, C.16 measurement result, aggregation work, and B.1.6 result distinct. |
| Boundary or phase word carries accounting | A port, interface, team, device, epoch, or phase label is used as Work parthood, overlap, or accounting boundary. | Establish the exact delimitation, A.15.1 Work relation or non-Work carrier identity and phase relation, stock, window, and policy before aggregation. |
| Untyped total hides conversion | Hours, energy, material, money, and data are added as one number. | Keep resource vectors typed until an explicit conversion relation or model is declared admissible under the applicable measurement or mathematical-lens pattern. |
| Shared stock is double-counted | The same person, tool, inventory, meter, dataset, or port appears in multiple work slices. | Declare overlap and deduplication policy, or narrow admissible use. |
| Efficiency becomes emergence | Reduced resource use is treated as a new whole or synergy without reidentification. | Use measurement and evidence-use patterns first; use B.2 when whole identity remains the question; use B.2.P for unresolved emergence-family wording. |
B.1.6:7 - Conformance Checklist
| ID | Requirement |
|---|---|
| CC-B1.6-1 | Every resource component names its Characteristic, Scale/Unit, subject, time stance, C.16 measurement work/result episteme, and uncertainty/provenance when current. |
| CC-B1.6-2 | The included dated Work occurrences, every A.15.1 Work-part relation used by the aggregation, every C.27.TA overlap fact it uses, and every separately used shared-stock relation are independently grounded; a separately used non-Work PhaseOf passes that carrier’s direct identity rule. |
| CC-B1.6-3 | The aggregation policy names inclusion, conversion, weighting, missing values, boundary allocation, uncertainty, overlap/deduplication, and output kind. |
| CC-B1.6-4 | For dated aggregation Work, A.13 identifies the actual performer and A.15.1 independently admits the occurrence. F.6 is present only when the result must also identify the assignment under which that Work was performed. The Method, actual direct/A.6.1 bindings, resources, and temporal extent remain separate. |
| CC-B1.6-5 | The B.1.6 aggregation result and the distinct C.2.1 result episteme are recoverable; neither is a ledger row or generic result field. |
| CC-B1.6-6 | A.10/G.6 provenance and G.11 currentness remain separate from measurement and aggregation results. |
| CC-B1.6-7 | Planned values and A.15.5 resource readiness are not presented as measured performed-work aggregation. |
| CC-B1.6-8 | A ledger, policy, profile, clause, citation, dashboard, or graph edge establishes none of work, participation, measurement, part/overlap, aggregation, or result identity. |
| CC-B1.6-9 | Any yield, efficiency, comparison, assurance, transformation, whole-reidentification, or decision claim names its exact subject pattern. |
B.1.6:8 - Common Anti-Patterns and How to Avoid Them
| Overread | Repair |
|---|---|
| A method or algorithm is treated as the work-resource roll-up. | Use A.3.1 or A.3.2; use B.1.6 only for the resource aggregation claim. |
| A work plan is treated as measured work. | Use A.15.2 for the plan and A.15.1 for performed work evidence. |
| A phase label or timeline is treated as a resource ledger or as proof of a Work relation. | Recover the exact subject first: A.15.1 for Work temporal parts or occurrences, the carrier’s identity pattern plus A.14 for proper non-Work PhaseOf, and B.1.4 only for bounded aggregation of already recovered temporal relations. Add B.1.6 only when typed resource values are being aggregated. |
| A resource gain is treated as emergence. | Use measurement and evidence-use patterns first; use B.2 when whole identity remains the question; use B.2.P for unresolved emergence-family wording. |
| A ledger, dashboard, or report total is treated as the aggregation result. | Recover the source publications, C.16 measurements, work set and relations, policy, dated aggregation work, B.1.6 result, C.2.1 episteme, and A.10/G.6 provenance. |
B.1.6:9 - Consequences
This pattern defines a conservative predicate and result form for typed resource aggregation while keeping each input measurement, performed work occurrence, aggregation policy/application, result episteme, work relation, and provenance path distinct.
The cost is explicit accounting discipline. The gain is that resource roll-ups become comparable without claiming more than the evidence and boundary relation allow.
B.1.6:9.1 - Rationale
B.1.6 exists because a convenient total can hide several ontically different chains. Its result is obtained only after exact resource measurement, work-set and overlap grounding, an edition-pinned aggregation policy, and dated aggregation work. The ledger represents that recovered account.
The pattern keeps the useful old Gamma_work notation, but only as notation over a recovered aggregation record. It also preserves the old planned-versus-measured warning: a method description or work plan can declare expected yield or expected resource use, but measured aggregation depends on dated work evidence.
B.1.6:9.2 - SoTA-Echoing
Source qualification was checked against the publishers’ current surfaces on 2026-07-30. Because ISO and GHG Protocol announced active joint development of an updated product-accounting standard in 2026, these decisions remain qualified only through 2027-01-30 unless a new draft, amendment, confirmation status, or published replacement appears earlier. Internal FPF neighbour authority stays in Relations; it is not presented as an external source decision.
| Exact source and source-use decision | Visible B.1.6 mutation | Rejected overread | Smallest source-change replay |
|---|---|---|---|
| ISO 14040:2006 with Amendment 1:2020, confirmed current in 2022, and ISO 14044:2006 with Amendments 1:2017 and 2:2020, confirmed current in 2022 — adapt goal/scope, system-boundary, inventory, allocation, reporting, and intended-use discipline to one exact work-resource aggregation. | Exact policy, Overlap and shared stocks, the engine-programme case, and CC-B1.6-2/3 require boundary, work set, allocation, overlap/deduplication, output kind, and intended use before a total is admitted. | An LCA boundary, inventory table, category, or reported total does not establish FPF work parthood, measurement, aggregation work, result identity, or admissibility for every later use. | Reopen only Exact policy, Overlap and shared stocks, the engine-programme allocation paragraph, and CC-B1.6-2/3 if ISO changes boundary or allocation requirements. |
| GHG Protocol Product Life Cycle Accounting and Reporting Standard, 2011, including its allocation and double-counting requirements — adapt process subdivision/system expansion before allocation, physical or other justified allocation, and explicit double-count control for shared processes/stocks. | The ledger’s shared-resource row, Overlap and shared stocks, the manufacturing-cell case, and CC-B1.6-2/3 require an independently grounded overlap/shared-use fact and one edition-pinned allocation or deduplication rule. | Co-listing, a common meter, corporate/category membership, or a convenient allocation key does not prove disjointness, work structure, or a universal resource share. | Reopen only the shared-resource ledger row, Overlap and shared stocks, the manufacturing-cell case, and CC-B1.6-2/3 when the joint ISO/GHG replacement changes shared-process allocation or double-count rules. |
| JCGM GUM-6:2020, Developing and using measurement models — adapt input-quantity, model-adequacy, covariance, and uncertainty-propagation discipline to the edition-pinned aggregation policy. | Uncertainty and provenance, the engine-programme case, and CC-B1.6-1/3 require the input measurement uncertainties, correlations/conversions, propagation method, and qualified output uncertainty to remain distinct from provenance. | Adding source refs, estimates, or point totals does not propagate uncertainty; aggregation does not make incompatible models or quantities commensurable. | Reopen only Uncertainty and provenance, the engine-programme uncertainty sentence, and CC-B1.6-1/3 if GUM changes model or propagation requirements. |
| ISO 80000-1:2022, Quantities and units — Part 1: General — adapt quantity-kind, unit, quantity-value, dimension, and coherent-unit discipline only for typed aggregation inputs and outputs. | Typed resource basis, the model-training case, and CC-B1.6-1/3 keep joules, hours, mass, currency, bytes, and attention distinct unless an exact conversion/normalization and output kind are declared. | A shared numeral, unit label, normalized score, or vector slot does not authorize cross-kind addition, scalarization, efficiency, or comparability. | Reopen only Typed resource basis, the affected typed component in the model-training case, and CC-B1.6-1/3 if ISO 80000 changes the mapped quantity/unit distinction. |
Source refresh is local: replay the row’s named rule, case, and checklist rows first. Widen only when that replay contradicts another current B.1.6 locus; a changed accounting source cannot by itself create work, overlap, measurement, result episteme, provenance, or a downstream verdict.
B.1.6:10 - Relations
- Builds on A.13 for actual performers, A.15.1 for independently admitted dated measurement or aggregation Work, F.6 when a result must also identify the assignment under which that Work was performed, and A.6.1 for declarations and actual bindings; C.2.1 governs measurement-result and aggregation-result epistemes.
- Coordinates with
A.3.1,A.3.2, andA.15.2for method, method description, and work plan. - Coordinates with
A.15.5for work-entry readiness, full-kit condition, and resource readiness before work entry; B.1.6 may cite those refs but does not decide readiness. - Coordinates with
A.15.1for exact Work temporal parts, episodes, operational parts, overlaps, retries, resumptions, and later occurrences; withB.1.4only for bounded aggregation of already recovered temporal relations; and withC.27for temporal-claim adequacy. - Coordinates with
A.1,B.1,A.14, andC.13for holon delimitation, part-whole, proper temporal restriction andPhaseOffor a non-Work carrier, and constructive grounding. - Coordinates with
A.3.4for transformation. UseB.2for a remaining whole-identity question andB.2.Pfor unresolved emergence-family wording; the relevant B.2-family pattern defines or constrains the recovered claim. - Coordinates with
C.16for resource Characteristics and measurement results;A.10andG.6for provenance;G.11for currentness;C.29for representation or mathematical-lens claims; A.15.1 for Work relations; A.14 and B.1.4 for non-Work part or phase relations and their bounded aggregation; E.17 for publication; and the applicable comparison, assurance, transformation, reidentification, or decision pattern when those uses are current.
B.1.6:End
B.2 - Meta-Holon Transition - Whole Reidentification
Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative
B.2:0 - Use This When
Use this pattern when changed facts raise the question whether the existing whole still carries the current claim or a new whole must be identified. The question may concern its delimitation, part relation, constitutive assembly, objective, supervision, capability envelope, agency threshold, or temporal consolidation.
Typical moments:
- a set of coordinated parts becomes a regulated system with its own objective and externally visible commitments;
- a commissioning history crosses into operation and the assurance claim must restart for the operational whole;
- a theory, model family, or knowledge body becomes an episteme whole recognized under the already admitted
U.Epistemekind rather than remaining a loose catalogue; - separately governed structure, functioning, method, and work facts support a capability envelope that the existing whole cannot explain; evidence separately supports the claim about those facts;
- an architecture residual cannot be explained inside the existing whole.
First useful move. Compare the observed gain or shift with explanations that preserve the existing whole. If better parts, corrected relations, improved measurement, Method or Work repair, richer phase coverage, or architecture-view repair is sufficient, stay with the existing whole and use that subject pattern. Proceed to a new-whole claim only when that comparison leaves whole reidentification necessary.
What goes wrong if missed. Emergence becomes rhetoric, ordinary improvement is overclaimed as a new whole, or a genuinely new whole remains hidden under old part, evidence, assurance, architecture, or responsibility claims.
What this buys. B.2 gives one accountable whole-reidentification move: recover the exact existing whole, the separately governed facts that challenge its identity, the exact candidate new whole, and decide whether the existing whole continues or the new whole must carry the claim before relying on evidence, a record, or a receiving-use decision.
Not this pattern when.
- If the claim is ordinary part-whole construction, use
B.1,A.14, andC.13. - If the claim is a whole-level characteristic change, use
C.16and the direct measurement or evaluation pattern. - If the claim is capability without whole reidentification, use the direct capability and characteristic patterns.
- If the claim is transformation or work, use
A.3.4for the change andA.15.1for the Work; useA.12when the acting side needs recovery andA.15when alignment across the neighboring objects is the question. - If the claim is only wording repair for emergence-family language, use
B.2.Pfirst. - If the claim is graph, RG-like, MSPD, or other mathematical expression, use
C.29unless whole reidentification is also current.
B.2:1 - Problem Frame
A Meta-Holon Transition is not a new root ontology, generic emergence label, or mathematical graph result. It is a whole-reidentification claim about an exact holon already recognized through A.1 construction, identity, part relations, whole-level characteristics, and a direct kind-specific pattern.
The B.2 comparison determines whether the old whole remains the right EntityOfConcern for the current claim; retain it when its identity rule accommodates the change. The candidate new whole can be recognized as a U.System, U.Episteme, U.Method, U.Work, U.Discipline, or another holon kind only after E.24.UK has admitted that public kind and the exact candidate satisfies A.1 plus the direct kind-specific criterion.
B.2:2 - Problem
Without B.2:
- New whole is missed. A constructive assembly or coordinated closure changes the object, but evidence and architecture still point to old parts.
- Ordinary improvement is overclaimed. A better component, stronger measurement, or corrected method is called emergence.
- Record fields become ontology. A result field, trigger mnemonic, profile, or checklist is treated as a U-kind or actor.
- Agency becomes binary. A threshold crossing is read as “agent or not agent” instead of a characteristic-space threshold for an admitted System. A local system-role kind, classification, or assignment is a separate optional fact and neither establishes nor is required for the agency characteristic.
- Mathematics replaces ontology. A graph, RG-like flow, MSPD score, or benchmark jump is treated as MHT without recovering the holon claim.
- Transformation becomes containment. A system changing another holon is treated as its part or the larger whole containing it without a separately obtaining part-whole relation.
B.2:3 - Forces
| Force | Tension |
|---|---|
| Parsimony vs real novelty | FPF should not mint new wholes for every improvement, but some closures really change the EntityOfConcern. |
| Continuity vs reidentification | History and phase continuity matter, but some transitions require identification of a new whole. |
| Trigger recognition vs trigger inflation | Delimitation, part-relation, objective, supervision, capability, agency-threshold, and temporal cues help recognition but do not declare MHT by themselves. |
| System-facing emergence vs broader holons | Holonic systems literature is system-facing, while FPF also needs cases in which the candidate new whole is an episteme, method, work occurrence, or discipline. |
| Math-lens power vs ontology discipline | RG-like, graph, algebraic, or benchmark expressions can bear on a claim only after the holon and relation are named. |
B.2:4 - Solution
Use B.2 as a world-side whole-reidentification pattern. Start with the actual wholes and the facts governed by their direct patterns; add records only when a receiving use needs them.
- Name the exact existing whole, its admitted kind, and its identity or reidentification rule.
- Recover each changed delimitation, constituent, constructive part relation, assembly, supervision, objective, capability, characteristic, or temporal fact under its direct pattern. A cue word, profile field, measurement, or graph edge does not make the fact obtain.
- Test whether those facts can be explained as a change of the same whole. If repair, maintenance, changed characteristics, phase coverage, method or work correction, measurement, or architecture-view correction is enough under the existing reidentification rule, keep that whole and stop B.2.
- If the existing whole is not enough, identify the exact candidate new whole and execute the complete A.1 criterion. Recover its constituents, obtaining constructive relations, assembly, reidentification rule, and composition-grounded whole characteristic. Also show that the candidate’s actual boundary, interfaces, relevant characteristics, and identity-preservation conditions satisfy the applicability and compatibility conditions of at least one governed larger-assembly construction method or rule under which it can remain a constituent. Then name its already admitted holon kind and satisfy the direct kind-specific criterion. If a required condition fails, the candidate fails A.1; if missing evidence or an unavailable dependency prevents a determination, evaluation returns
unknown. - State the whole-reidentification claim: why the existing whole no longer carries the current subject claim and why the candidate new whole is the EntityOfConcern. This comparison does not itself create, admit, or classify either whole.
- Materialize a trigger profile, optional explanation-result episteme, reidentification assertion, or record only when a named receiving use must inspect, cite, compare, or preserve that claim.
The optional MHTTriggerProfile, ExistingWholeExplanationResult, and HolonReidentificationRecord are ordinary C.2.1 epistemes. Their content can designate exact wholes, facts, claims, and relation occurrences; the content fields are not world-side participants and supply no substitute for the preceding move.
B.2:4.1 - MHTTriggerProfile
MHTTriggerProfile is a U.Episteme whose EntityOfConcern is the exact existing whole already recognized under an admitted holon kind. It collects exact current cues and support for asking whether whole reidentification is live. It is not MHT itself, and its content fields do not declare another relation.
| Content field | Value kind and use |
|---|---|
existingWholeRef | U.HolonRef resolving to the exact existing whole already recognized under an admitted holon kind. |
existingWholeIdentityRuleRef | U.EpistemeRef resolving to the current identity-rule episteme. |
currentPartRelationRefs[] | U.EntityRef values, each resolving to one explicitly individuated current part-relation occurrence. |
changedDelimitationRelationRefs[] | References to exact changed delimitation relation occurrences under their direct patterns. |
changedPartRelationRefs[] | References to exact changed part-relation occurrences. |
changedSupervisionRelationRefs[] | References to exact changed supervision relation occurrences. |
changedCoordinationRelationRefs[] | References to exact changed coordination relation occurrences. |
changedObjectiveClaimRef? | U.EpistemeRef resolving to the exact objective-change claim. |
changedCapabilityClaimRef? | U.EpistemeRef resolving to the exact capability-change claim. |
agencyThresholdClaimRef? | U.EpistemeRef resolving to a current characteristic-space threshold claim. |
temporalConsolidationClaimRef? | U.EpistemeRef resolving to the exact temporal-consolidation claim. |
evidenceRelationRefs[] | References to exact evidence relation occurrences supporting the trigger claims. |
sourceUseRelationRefs[] | References to exact source-use relation occurrences when a source is relied on. |
The profile’s exact ClaimGraph and effective U.ReferenceScheme, together with its existing-whole EntityOfConcern, constitute its C.2.1 identity. Any current U.ClaimScope and an independently selected model-use structure can qualify this episteme when its receiving use needs them. These identity values and qualifications do not identify either whole, become MHT trigger facts, or make any referenced relation obtain. A single cue warrants attention; it does not establish whole reidentification.
B.2:4.2 - Existing-whole comparison and optional result
First perform an ordinary comparison: compare the observed change with direct explanations that preserve the existing whole. Consider better parts, corrected relations, improved measurement, method or Work repair, richer phase coverage, capability change, and architecture-view repair only when their direct patterns make those explanations current. If one explanation is sufficient for the receiving use, keep the existing whole, use that subject pattern, and stop B.2.
When another use must inspect or cite the outcome, identify an optional ExistingWholeExplanationResult episteme whose EntityOfConcern is the existing whole:
| Content field | Value kind and use |
|---|---|
observedChangeClaimRef | U.EpistemeRef resolving to the exact observed-gain or observed-shift claim. |
candidateExplanationClaimRefs[] | Exact claims under their direct subject patterns. |
explanationEvidenceRelationRefs[] | Evidence relations actually used to assess those explanations. |
existingWholeSufficiencyVerdict | `sufficient |
remainingWholeReidentificationQuestionRef? | The exact residual question when the result is insufficient or unknown. |
The comparison is an action a practitioner performs. The optional result records its claim-bearing outcome. Neither is a reusable checklist or Method unless an independent receiving use later requires and defines such an object. The episteme creates none of its referenced claims or relations.
B.2:4.3 - HolonReidentificationRecord
HolonReidentificationRecord is an optional U.Episteme whose EntityOfConcern is the exact new holon. Use it only when a person or system performing later work needs a durable account of why that new holon, rather than the prior whole, is the current EntityOfConcern. Candidate classification remains a separately governed judgment.
| Content field | Value kind and use |
|---|---|
existingWholeRef | U.HolonRef resolving to the exact prior whole already recognized under an admitted holon kind. |
selectedTriggerProfileRef | U.EpistemeRef resolving to the selected MHTTriggerProfile. |
existingWholeExplanationResultRef? | U.EpistemeRef resolving to the optional ExistingWholeExplanationResult; omit it when the ordinary comparison sentence is enough. |
resultHolonRef | U.HolonRef resolving to the exact candidate new whole. |
resultHolonKindRef | U.KindRef resolving to its exact admitted holon kind. |
resultHolonClassificationAssertionRef? | U.EpistemeRef resolving, only when a person or system performing later work must inspect or cite the judgment, to a C.2.1 assertion that the candidate new whole satisfies the A.1 criterion under the stated admitted holon kind. |
wholeReidentificationClaimRef | U.EpistemeRef resolving to the claim that the candidate new whole, rather than the prior whole, now carries the subject claim. |
changedClaimPatternLocators[] | U.EpistemeRef values resolving to the direct patterns for each changed claim used in the rationale. |
evidenceRelationRefs[] | References to exact evidence relation occurrences supporting the reidentification claim. |
sourceUseRelationRefs[] | References to exact source-use relation occurrences when sources are relied on. |
mathLensUseRelationRefs[] | References to exact C.29 lens-use relations when mathematical results bear on the claim. |
The record does not make the A.1 criterion true, admit a public kind, or create the candidate new holon. E.24.UK is the pattern for public-kind admission; A.1 is the pattern for world-side recognition; C.2.1 is the pattern for the optional classification assertion; its warrant requires exact evidence and assurance relations. Publication of the record is another relation under the publication patterns.
B.2:4.4 - Candidate New Whole Reference And Kind
Use one resultHolonRef : U.HolonRef for the candidate new whole and one resultHolonKindRef : U.KindRef for its kind. E.24.UK must already have admitted that public kind, and the candidate new whole must satisfy the A.1 constructive criterion plus any kind-specific membership condition. Neither the references nor the record establish those facts.
When a person or system performing downstream work must inspect or cite the classification judgment, add the optional resultHolonClassificationAssertionRef. That C.2.1 assertion may report a governed evaluation of true, false, or unknown; its evidence, warrant, and G.11 currentness stay separate from world-side criterion satisfaction. B.2 still asks a different question: whether the existing whole can continue to carry the subject claim or a new whole must be identified.
Do not use post* field names as live governed names. They hide the candidate new whole and its kind and invite temporal shorthand. Name that whole and its admitted public kind; cite a classification assertion only when the receiving use needs that episteme.
B.2:4.5 - Agency Threshold
An agency-characteristic threshold is a condition in a characteristic space, not a root kind or a substitute for the A.13 agency claim. State its exact System, predicate, claim scope, and qualification window.
Use A.13, A.19, and C.16 for the characteristic-space and threshold claim. Levin-line TAME work can discipline the multi-characteristic framing when agency evidence is relied on for the current claim. B.2 uses agency threshold only as one possible trigger in MHTTriggerProfile, and only when crossing the threshold changes closure, supervision, objective, or whole identity.
Recover the admitted System and its agency-relevant characteristic or threshold independently. A System may bear that characteristic while participating passively in the situation. A precise agency claim additionally requires the A.13 core, including the local agential system-role kind, System-classification judgment, and obtaining assignment; a characteristic-only claim does not acquire that additional scope. If claim-bearing source wording still says only “role,” use E.10.ROLE rather than presuming classification or assignment.
B.2:4.6 - Acting-System Participation
When a source describes a system changing another holon, recover acting-system participation and transformation separately.
Use A.12 for acting-side externalization, A.3.4 for bounded transformation, and A.15.1 for work occurrence. A system changing another holon does not thereby become its part or the larger whole containing it, and no U.Transformer kind is created.
B.2:4.7 - Mathematical-Lens Separation
Graph, algebra, RG-like, MSPD, benchmark, scaling, and morphism language can bear on MHT recognition only as mathematical or analytical expression.
Use C.29 when the mathematical lens is relied on for the current claim. Use B.2 only after the holon identity claim is recovered and the ordinary existing-whole comparison leaves a whole-reidentification question.
B.2:4.8 - Keep Whole Identity, Evidence, Currentness, And Reliance Separate
Keep these five distinctions explicit:
- the existing whole and candidate new whole, their constituents, obtaining constructive relations, assemblies, characteristics, and identity rules are world-side objects and facts under their direct patterns;
- a B.2 whole-reidentification assertion is a C.2.1 episteme about those objects;
- evidence and assurance relations support or warrant the assertion’s claim content but create neither whole and decide neither identity rule;
- use G.11 to determine whether the selected assertion or record edition is current for the receiving use;
- a person or system performing the receiving work decides whether to rely, decline to rely, defer, or reopen.
Evidence present or missing, and a current or stale record, can change what an evaluation returns and whether a person or system relies while performing receiving work. They cannot turn the same whole into a new whole or a new whole into the same one. Whether the existing whole continues or a new whole must be identified follows the direct identity and reidentification rules plus the actual construction facts. A.1 recognition of either candidate supplies no B.2 warrant and does not select B.2.
B.2:5 - Archetypal Grounding (Worked Cases)
B.2:5.1 - Closed-Loop Regulated System
Parts: plant, sensor, controller, actuator.
Existing-whole repair may be enough if only a sensor improved or a controller parameter changed. B.2 becomes current only when exact constructive relations and a governed assembly close the feedback and supervision around an objective, yielding one exact new whole proposed for recognition under the already admitted U.System kind, whose boundary, external commitments, and capability envelope are no longer explainable as changes of the existing whole. That proposed whole can satisfy A.1 only if its actual boundary, interfaces, relevant characteristics, and identity-preservation conditions also satisfy at least one applicable governed larger-assembly construction method or rule—for example, a rule under which the regulated system can remain one constituent of a larger plant or production system. If that compatibility condition does not hold, the proposed whole fails A.1; if the needed evidence or dependency is unavailable, evaluation remains unknown. Loop closure, a record, or a measurement supplies none of those facts.
MHTTriggerProfile@Control : U.Episteme
entityOfConcernRef: plant-plus-devices configuration
content:
changedSupervisionRelationRefs: closed feedback relation
changedObjectiveClaimRef: maintain output y near reference r
changedCapabilityClaimRef: capability envelope after closure
HolonReidentificationRecord@Control : U.Episteme
entityOfConcernRef: regulated control system
content:
existingWholeRef: plant-plus-devices configuration
selectedTriggerProfileRef: MHTTriggerProfile@Control
existingWholeExplanationResultRef: ClosedLoopExistingWholeResult
resultHolonRef: regulated control system
resultHolonKindRef: U.System
resultHolonClassificationAssertionRef: RegulatedControlSystemClassificationAssertion
wholeReidentificationClaimRef: ClosedLoopWholeReidentificationClaim
changedClaimPatternLocators: A.1, B.1.2, B.2.2, C.30.LCA, A.2.2
The exact EntityOfConcern is an actual participant in the C.2.1 EpistemeConstitutionRelation; EntityOfConcernSlot is only the corresponding declaration-local participant meaning inside EpistemeConstitutionRelationSignature. The entityOfConcernRef field and indented content fields carry participant or claim designations in each episteme; they are not SlotKinds or participants of a new MHT relation. The feedback and capability relations retain their direct identities, while the optional classification assertion retains its own C.2.1 identity and does not establish world-side holonhood.
B.2:5.2 - Compendium Becomes Theory
A collection of results can remain a catalogue. B.2 becomes current only when the knowledge body is reidentified as an episteme whole with its own claim-bearing structure, explanatory objective, reference scheme, and evidence relations.
B.2.3 specializes this case when the exact candidate new holon named by the MHT claim is recognized under the already admitted U.Episteme kind. C.2.1 defines episteme constitution and identity; E.17 and E.24.PUB define publication occurrences, forms, and carriers; C.2.P recovers source-expression and source-to-use distinctions; use A.10 for bounded evidence reliance and G.6 for its evidence/provenance graph and ledger, retaining each relation’s direct governor.
B.2:5.3 - Capability Envelope Appears
Several systems, methods, and work occurrences align and a new capability envelope appears. Apply the direct capability, characteristic, function, transformation, method, work, evidence, and architecture patterns first.
Use B.2.4 only when separately governed capability or functioning facts make a whole-reidentification question live under B.2. Evidence can support the claim about those facts; it creates neither the facts nor the question.
B.2:5.4 - Lathe And Workpiece
A lathe transforms a workpiece. That is transformation and work, not MHT and not parthood. B.2 becomes current only if the manufacturing arrangement creates or reveals a new whole that must be reidentified, such as a production cell with exact constituents, obtaining coordination and supervision relations, a governed assembly, an objective, a whole-level capability, and a reidentification rule that the earlier arrangement lacks. A.1 recognition additionally requires the cell’s actual boundary, interfaces, relevant characteristics, and identity-preservation conditions to fit at least one applicable governed construction method or rule under which the cell can remain a constituent of a larger production system.
B.2:5.5 - Same Whole, New Whole, And Lost Evidence
Replacing Pump #37’s seal is an ordinary constituent change when the pump’s reidentification rule admits that maintenance phase. The same pump remains the EntityOfConcern; use the direct maintenance, part-relation, work, transformation, and characteristic patterns and stop B.2.
Closing a controller-sensor-actuator loop can yield a new regulated-system whole only when the exact candidate assembly, supervision and coordination relations, boundary, objective, whole-level capability, admitted U.System kind, and reidentification rule satisfy A.1 and the system criterion. Its actual boundary, interfaces, relevant characteristics, and identity-preservation conditions must also satisfy at least one applicable governed larger-assembly construction method or rule under which the regulated system can remain a constituent. If that condition fails, the candidate fails A.1; if the needed evidence or dependency is unavailable, evaluation returns unknown. A wiring diagram, commissioning record, loop closure, or capability measurement alone supplies none of those construction or compatibility facts.
If the support for the reidentification assertion is present and its edition is current, a person or system performing receiving work may rely on it. If the same evidence is unavailable, evaluation can return unknown; use G.11 to test whether the edition is current for this use; and the actor may decline, defer, or reopen. None of those branches changes whether the regulated-system whole actually exists or whether the prior configuration remains the same whole.
B.2:5.6 - Selected Structure And Transformation Stops
A selected BoundedModelUseStructure organizes exact model-use relations. It is not the new holon named by an MHT claim and gains no parts, agency, or whole identity from selection, naming, or a Context Map.
Several actual changes during assembly may each be exact U.Transformation occurrences. B.2 does not treat them as constituents of one composite transformation. If whole reidentification would require positive transformation composition, transformation parthood, or composite-transformation identity and no direct governor supplies contribution, compatibility, boundary, interfaces, and reidentification, retain the exact blocker and the independently identified changes. The missing composition facts do not show that any change is atomic.
B.2:6 - Bias-Annotation
| Bias risk | Failure | Mitigation |
|---|---|---|
| Emergence rhetoric | A gain, surprise, or synergy label declares a new whole. | Perform B.2’s existing-whole comparison before declaring a new whole. |
| Record as ontology | Trigger profiles, result fields, or checklist labels become U-kinds. | Keep the trigger profile, optional explanation result, and reidentification record as U.Episteme values; keep the ordinary comparison as an action. Let E.24.UK handle public-kind admission and A.1 recognize the candidate new whole. |
| Math as MHT | Graph, RG-like, MSPD, benchmark, scaling, or morphism expression declares whole reidentification. | Use C.29; recover holon identity and existing-whole explanation first. |
| Binary agency | Agency threshold crossing is treated as a root kind or binary status. | Use the direct characteristic-space and threshold patterns; use B.2 only when whole identity changes. |
| Transformation as containment | A system changes another holon and is treated as its part or containing whole without a separately obtaining part-whole relation. | Use A.12, A.3.4, A.15.1, and the direct crossing relation pattern; apply B.2 only when separately grounded facts make whole reidentification current. |
B.2:7 - Conformance Checklist
| Check | Conformance condition |
|---|---|
CC-B2-1 | A B.2 use names the exact existing whole already recognized under an admitted holon kind, its identity rule, current part relations, and kind-specific pattern before declaring whole reidentification. |
CC-B2-2 | MHTTriggerProfile is a U.Episteme with the existing whole as EntityOfConcern, exact typed content references, and no mandatory bounded-context reference. |
CC-B2-3 | The ordinary existing-whole comparison precedes MHT. An optional ExistingWholeExplanationResult episteme is created only when a receiving use must inspect or cite its exact explanations, evidence, and sufficiency verdict. |
CC-B2-4 | HolonReidentificationRecord is a U.Episteme with one resultHolonRef for the candidate new whole, one reference to its admitted public kind, the whole-reidentification claim, direct evidence and subject-pattern references, and only an optional C.2.1 classification-assertion reference when a person or system performing later work needs to inspect or cite that judgment. |
CC-B2-5 | Agency-threshold claims use the direct characteristic-space and threshold patterns; B.2 uses them only when whole identity changes. The admitted System and characteristic are recovered independently of any optional local system-role classification or assignment, including when the System participates passively. |
CC-B2-6 | Acting-system participation and transformation use A.12 and A.3.4; B.2 does not create U.Transformer. |
CC-B2-7 | Mathematical expressions can bear on but do not replace the holon reidentification claim. |
CC-B2-8 | The candidate new whole reference and its kind reference remain separate; B.2 does not maintain one optional field per admitted holon species. |
CC-B2-9 | A candidate new episteme, system, method, work occurrence, or discipline uses A.1 recognition plus its kind-specific pattern; a dependent U.Structure is not the new holon named by an MHT claim. |
CC-B2-10 | Whether the existing whole continues or a new whole must be identified follows exact construction and reidentification facts; evidence availability, evaluation value, record currentness, and receiving reliance remain separate results. |
CC-B2-11 | B.2 does not infer transformation composition, transformation parthood, composite identity, holonhood, or atomism from several changes, one work episode, one selected structure, or missing part facts. |
B.2:8 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Symptom | Repair |
|---|---|---|
| Emergence by adjective | A capability or property is called emergent without reidentifying the whole. | Use B.2.P to recover claim kind, then B.2 only if whole reidentification is current. |
| Record as ontology | Trigger profile, result field, or record name is treated as a world-side kind. | Keep the trigger profile, optional explanation result, and reidentification record as U.Episteme values; keep the ordinary comparison as an action. Let E.24.UK handle the candidate new whole’s public kind and A.1 recognize that candidate. |
| Content field as relation slot | A reference field inside a profile or record is treated as a participant SlotKind or as evidence that the referenced relation obtains. | Keep the field in episteme content, resolve its reference to the direct occurrence, and use that occurrence’s subject pattern for obtaining and identity. |
| KPI jump as MHT | A metric improves and MHT is declared. | Perform the ordinary existing-whole comparison; use the direct measurement, characteristic, Method, Work, or architecture pattern when it explains the change. |
| Agency shortcut | Agency threshold crossing creates a new root kind. | Use the direct characteristic-space and threshold patterns; apply B.2 only when closure, supervision, objective, or identity changes. |
| Math result as MHT | Graph, RG-like, MSPD, or benchmark expression declares new whole. | Use C.29; recover holon identity before B.2. |
| Transformation as containment | A system changes another holon and is treated as its part or containing whole without a separately obtaining part-whole relation. | Use A.12, A.3.4, A.15.1, and the direct crossing relation pattern; use parthood only when an exact grounded part relation independently obtains. |
B.2:9 - Consequences
Positive consequences:
- MHT becomes a precise whole-reidentification move rather than a synonym for improvement.
- Cases involving a candidate new system, episteme, method, work occurrence, or discipline use the same B.2 whole-reidentification solution while retaining their subject patterns.
- Trigger language remains useful without becoming ontology.
- Mathematical and benchmark evidence can be used without replacing the holon claim.
Costs:
- Users must try existing-whole explanations before declaring MHT.
- MHT records require a reference to the exact candidate new whole, a reference to its already admitted public kind, A.1 recognition, and the evidence needed by any classification assertion used downstream.
- Some attractive emergence claims will return to ordinary characteristic, method, work, architecture, or measurement repair.
B.2:10 - Rationale
Holonic work needs a way to recognize when a whole has changed enough that the old EntityOfConcern no longer carries the current claim. B.2 provides that move without collapsing all novelty into “emergence” and without inventing record-field U-kinds.
The pattern is intentionally conservative: it applies repairs from subject patterns first, then supports whole reidentification only when the existing whole no longer explains the observed shift. This protects B.1 part-whole construction, A.15.1 work, A.3.4 transformation, C.16 characteristics, C.29 math-lens use, and episteme and publication discipline from being swallowed by MHT.
B.2:11 - Decision-bearing SoTA account
| Practical question | Exact primary source | Adopt, adapt, or reject in B.2 | Exact effect in this pattern |
|---|---|---|---|
| When may a configured production arrangement be treated as a distinct operating whole? | Bartels et al., Dependable Cyber-Physical Matrix Production Systems Utilizing Holonic Multi-agent Systems (2025), and Macherki et al., QHAR: Q-Holonic-Based Architecture for Self-Configuration of Cyber-Physical Production Systems (2021), with a tested reconfiguration case. | Adopt the practical need to recover exact entities, flows, coordination, dynamic interdependence, control organization, and reconfiguration purpose. Reject a named holonic architecture, control layer, or reconfiguration event as sufficient whole identity. | Sections 4 and 5.1 require actual constituents, obtaining constructive relations, boundary, objective, whole-level characteristic, reidentification rule, and larger-assembly compatibility before A.1 recognition. |
| What separates inputs, construction, and the resulting whole? | Florio and Linnebo, Introduction to Constructional Ontology (2024), and Borgo and Righetti, Towards Applied Constructional Ontology (2025). | Adopt the separation among accepted inputs, constitutive organization, and resulting identity. Adapt it to FPF’s direct part relations, assembly, reidentification rule, and admitted holon kinds. Reject a trigger profile, record, tuple, or Method label as the constructor that makes the whole exist. | Sections 1, 4, 4.3, and 5 distinguish world-side construction from comparison and record epistemes. |
| How should agency bear on whole reidentification? | Michael Levin, Technological Approach to Mind Everywhere (2022). | Adopt non-binary, multi-characteristic, empirically tested agency and multi-scale competency as possible evidence about a system. Reject an agency label or threshold as a root kind or automatic new-whole result. | Section 4.5 keeps agency as one possible trigger whose direct characteristics must affect closure, objective, supervision, or identity. |
| What can a multiscale mathematical signal contribute? | Akhtyrchenko, Katsnelson, and Ustyuzhanin, Directing Open-Ended Evolution in Artificial Life via Multi-Scale Path Divergence (v2, 3 August 2026), defines MSPD over realized trajectories as a multiscale analytical and optimization measure. | Adopt MSPD as a possible exact analytical input when its trajectory assumptions match the case. Reject a high MSPD, RG-like score, graph pattern, or benchmark jump as whole reidentification. | Sections 0, 4.7, and 8 route the mathematical result through C.29 and still require the B.2 identity comparison. |
These sources answer different questions. None supplies a universal emergence detector. Popular modeling languages and generic architecture standards are not used as decision authority here because they do not decide when the same whole ends and another begins.
B.2:12 - Relations
- Builds on:
A.1for world-side holon recognition,B.1for part-whole construction,A.14andC.13for relation and constructional grounding, andE.24.UKfor one-time public-kind admission. - Coordinates with:
A.12andA.3.4for acting-side and transformation,A.3.1andA.15.1for Method and Work,A.15when their alignment is the current question,C.16andA.19for characteristic space and threshold,C.2.1for optional claim and record epistemes,A.10andB.3for evidence and warrant,G.11for edition currentness,C.29for mathematical lenses, andC.32.P2Swhen architecturing pressure becomes whole reidentification rather than local structure repair. - Specialized by:
B.2.2when the candidate new whole is a system,B.2.3when it is recognized under the admittedU.Epistemekind, andB.2.4when capability or functioning facts require whole reidentification. - Can use neighboring evidence from:
B.2.5when a supervisor-subholon feedback relation is part of the B.2 case evidence or neighboring structure; that does not make B.2.5 a specialization for the candidate new holon’s kind. - Uses:
B.2.Pwhen emergence-family, MHT, MET, MFT, synergy, or metric-mirage wording hides which claim kind is current before B.2 is applied.
B.2:End
B.2.P - Clarify Emergence and Meta-Holon Transition (MHT) Claims
Type: Part B precision-restoration pattern Status: Stable Normativity: Normative unless a section is explicitly informative
B.2.P:0 - Use This When
Use this pattern when wording such as emergence, emergent, synergy, higher-level property, meta-system, meta-epistemic, meta-functional, MHT, MET, MFT, promotion, post*, or collection words mixed with those terms could be pointing to several different FPF objects.
The first useful move is:
Recover the claim kind before choosing replacement wording.
B.2.P is selected only when the source wording hides one of these recurring questions:
- Is this a B.2 whole-reidentification claim?
- Is the candidate new whole a system or episteme, or do capability and functioning facts make whole reidentification necessary?
- Is this only a characteristic, capability, functioning, architecture, evidence, measurement, or mathematical-lens claim?
- Is a collection, fleet, community, pool, or base being admitted as a whole, acting collective, whole-level characteristic bearer, or merely a membership set?
- Is a metric jump or benchmark result being overread as a new whole?
What goes wrong if missed. A word like “emergent” becomes a shortcut to a new U-kind, a collection receives agency by name, a metric jump becomes MHT, or source title mnemonics survive as if they were current pattern authority.
What this buys. B.2.P gives one local recovery profile for emergence-family and MHT wording. It keeps B.2-family subject patterns centered on whole reidentification while ordinary capability, characteristic, function, architecture, evidence, math-lens, publication, and collection claims remain with their subject patterns.
Not this pattern when.
- If the text already names the subject pattern and object by value, use that pattern directly.
- If the question is ordinary collection admission without emergence, synergy, MHT, metric mirage, or whole-reidentification wording, use
A.14,C.13,B.3.5,A.1,A.15, A.2 patterns, orC.16directly. - If whole-span
F.19reading settles the wording without a remaining emergence-specific FPF question, stop there. - If the question is general wording-use architecture, use
E.10andE.10.ARCH.
B.2.P:1 - Problem Frame
Emergence-family wording is overloaded. It can point to a new system whole, an episteme whole, a capability envelope, a characteristic crossing, an architecture residual, a mathematical scale expression, a benchmark artifact, a publication claim, or a collection-as-whole question.
It asks which exact EntityOfConcern, world-side or claim-side fact, and subject pattern are current, and whether the same whole still carries the claim.
B.2.P:2 - Problem
Without B.2.P:
- Generic emergence becomes ontology.
U.Emergenceor an equivalent hidden kind appears even though no such root kind is selected. - Collections become systems by poetry. A fleet, community, pool, or base is treated as an acting system because the phrase sounds collective.
- Capability becomes MHT. A new capability envelope or functioning relation is treated as a new whole without checking existing-whole explanations.
- Mathematics becomes declaration. A graph, scaling law, RG-like expression, benchmark jump, or MSPD score is treated as whole reidentification.
- Old mnemonic titles are mistaken for applicable PatternIDs. Source labels such as
METorMFThide whether the claim concerns an episteme whole, capability or functioning facts, evidence for those facts, or something else. - Semio-bias returns. Publication, dashboard, model, or source interpretation claims displace the in-life holon or characteristic under concern.
B.2.P:3 - Forces
| Force | Tension |
|---|---|
| Useful recognition vs false kind | Emergence wording often marks a real modeling concern, but it does not name a selected root kind. |
| Whole reidentification vs property change | Some cases need B.2; many cases need only characteristic, capability, function, architecture, evidence-use, or mathematical-lens patterns. |
| Collection language vs collective system | Collection words can name membership, a constructed whole, an acting system, or a characteristic bearer. |
| Source mnemonics vs current authority | Short labels help recognition but can preserve rejected ontology. |
| Mathematical expression vs ontology replacement | Formal or statistical expressions can bear on a claim only after the concrete thing or claim and its direct pattern are identified. |
B.2.P:4 - Solution
Recover the claim kind and subject pattern before any wording replacement.
B.2.P:4.1 - Emergence Claim-Kind Recovery
Read the complete natural span with F.19 and E.10’s compact cues. If an emergence-specific FPF question remains, recover five things before choosing replacement wording:
- Practical use. What decision, explanation, design move, or stop depends on the sentence?
- Exact object. Is the concern an existing whole, candidate new whole, collection, characteristic, capability, functioning relation, structure, transformation, measurement result, assertion, or mathematical expression?
- Concrete claim. What changed or obtains: construction, identity, capability, characteristic value, evidence, publication, representation, or only the wording?
- Subject pattern. Which pattern defines or constrains that object and claim without using
emergenceas a substitute? - Disposition. Keep the exact direct claim, open B.2 only for a remaining whole-reidentification question, or stop with the exact missing object or governor.
A temporary author note may retain the source phrase, exact object, subject pattern, blocked overread, and replacement or stop. The note is not a U-kind, relation, result object, or required project record. Do not ask a practitioner to fill a generic emergence card before the direct object can be named.
B.2.P:4.2 - Claim-Kind Recovery and Subject-Pattern Selection Table
| Recovered claim kind | Use this subject pattern | Do not overread as |
|---|---|---|
| Whole reidentification of a holon | B.2, with B.2.2, B.2.3, or the direct pattern for the new whole’s admitted kind; B.2.4 connects capability/functioning facts to the B.2 question | generic emergence, metric gain, or title mnemonic |
| Candidate new system whole | B.2.2 | all emergence cases or all system aggregation |
| Candidate new episteme whole | B.2.3 plus C.2.1 and episteme family | episteme agency, publication authority, or EFEM by title |
| Capability or functioning facts that make whole reidentification live; evidence separately supports the claim | B.2.4 under B.2 | generic capability, generic function, or all functioning |
| Ordinary capability claim | A.2.2 and C.16 | MHT |
| Function or functioning claim | A.6.F, A.3.4, C.30.TFS-REL, C.16, or subject pattern named by value | U.Emergence or MHT by wording |
| Whole-level characteristic or threshold | C.16, A.19, A.13, evidence-use patterns | new whole by metric alone |
| Architecture-induced property or residual | C.30, A.22, C.30.ASV, C.30.TFS-REL, C.30.ILC, and C.29 when mathematical lens is current | MHT unless B.2 reidentification is recovered |
Selected dependent U.Structure, including bounded model use | A.22, A.1.1, and the direct patterns for its selected relation occurrences | a holon, acting agent, system part, or new whole named by an MHT claim merely by selection or name |
| Several actual changes in one work or flow | A.3.4 for each independently identified change | a composite transformation, transformation parthood, holonhood, or atomism without a direct composition governor |
| Mathematical emergence, scale, coarse-graining, graph, morphism, benchmark, or MSPD expression | C.29 plus the direct subject pattern | ontology by mathematical spelling |
| Metric or benchmark mirage | C.16, A.10, C.29, source-use, and evaluation patterns | MHT or system admission |
| Collection or collective wording mixed with emergence, MHT, or synergy | First recover membership, collection-as-whole, acting collective, whole-level characteristic, or MHT | collection admission by B.2.P |
| Publication, model, dashboard, theory-text, or report claim | C.2.1, E.17, C.30.AD, E.17.*, source-use, or episteme patterns | in-life whole by description alone |
B.2.P:4.3 - Whole-Reidentification Recovery
When a whole-reidentification question remains after claim-kind recovery, do not create a second MHT schema. Use B.2 with this concrete account:
- name the exact existing whole, admitted kind, and identity or reidentification rule;
- name each changed delimitation, constituent, constructive relation, assembly, supervision, objective, capability, characteristic, or temporal fact and its subject pattern;
- try the existing-whole explanation and state whether it preserves the existing whole;
- if a new whole is still needed, require B.2 and execute the complete A.1 criterion: name the exact candidate, its constituents, obtaining constructive relations, assembly, reidentification rule, and composition-grounded whole characteristic; show that its actual boundary, interfaces, relevant characteristics, and identity-preservation conditions satisfy at least one applicable governed larger-assembly construction method or rule under which it can remain a constituent; then name its already admitted kind and satisfy the direct kind-specific criterion;
- state whether the direct identity rules preserve the same whole or require a new whole for the current subject claim;
- only when a specific downstream task must inspect or cite the decision, identify any separate assertion or record, supporting evidence and warrant, G.11 currentness result, and rely, decline, defer, or reopen decision.
Evidence availability, an evaluation value, a record field, and receiving reliance neither construct the candidate nor decide whether the existing whole continues or a new whole must be identified. If the exact candidate, one required constructive fact, or the larger-assembly compatibility condition has no governor, stop with that missing object or governor rather than writing candidateResultRef, resultKindRef, mhtWitnessRef, or a context-shaped placeholder.
B.2.P:4.4 - Collection Boundary
Collection words enter B.2.P only when they are entangled with emergence, synergy, MHT, metric mirage, or whole-reidentification wording.
If the claim is plain collection admission:
- use
A.14for membership and part-whole relation vocabulary; - use
C.13for collection-as-whole constructional grounding; - use
B.3.5for working-model assurance grounding; - use
A.1for an acting collective admitted asU.System; useA.15for a separate alignment question and A.2 patterns for the exact system-role-kind or assignment claim when either is current; - use
C.16for a whole-level characteristic.
B.2.P may point to these subject patterns; it does not own their claims. An unassembled collection remains an unassembled collection even when a list, dashboard, or project card names it as one whole. A C.13 collection construction does not by itself establish an integrated assembly, acting system, or A.1 holon.
B.2.P:4.5 - Source Mnemonics and Result Fields
Treat source labels and short forms as recognition cues until the concrete thing or claim and its direct pattern are identified.
METmay point to a claim that the candidate new whole is an episteme, source-title wording, episteme morphing, publication synthesis, or a source-only phrase. Identify the concrete claim before use.MFTmay point to capability and functioning whole reidentification, a functional-structure view, function-like wording, method and work collapse, or source-only phrase. Recover before use.promotionmay hide whole reidentification, status change, release, gate, publication, or project process wording. Recover before use.post*fields do not survive as generic governed names. When B.2 is current, name the exact candidate new whole and its already admitted holon kind directly; cite an optional classification assertion or reidentification record only when receiving work needs that episteme.
Do not treat the source label as a subject-pattern locator merely because it is recognizable.
B.2.P:5 - Archetypal Grounding (Worked Cases)
B.2.P:5.1 - “The Fleet Emerged As A New Actor”
Recover:
- Is “fleet” a membership set, collection-as-whole, acting collective system, or the candidate new system named by an MHT claim?
- Does the agency wording name an admitted System, an agency-relevant characteristic or threshold, a local system-role kind, a separate System-classification judgment, an obtaining assignment, or only ordinary prose? Recover these independently: the characteristic can obtain without an assignment and the System may participate passively. Send unresolved claim-bearing “role” wording through
E.10.ROLE. - Does the candidate new system have its own delimitation, objective, coordination, and capability envelope, and is the reidentification claim separately supported by evidence and assurance?
If the candidate new whole is an acting system, use B.2 and B.2.2. If the case is only a managed collection with a whole-level metric, use A.14, C.13, B.3.5, and C.16.
B.2.P:5.2 - “The Model Shows Emergent Robustness”
Recover:
- Which claims concern the model as a description episteme, and which concern its mathematical expression or lens use?
- Is robustness a characteristic-space claim?
- Is the result a benchmark artifact?
- Is there an in-life holon whole-reidentification question?
For those direct claims, use C.29, C.16, A.10, and source-use patterns as applicable. Use B.2 when the identity of the in-life whole remains the question.
B.2.P:5.3 - “A Meta-Functional Transition Happened”
Recover:
- Is there capability or functioning evidence?
- Do separately governed capability or functioning facts make a whole-reidentification question live, with evidence only supporting the claim about those facts?
- Is the concern function-like wording, a functional-structure view, a method-and-work relation, or a candidate new holon?
Use B.2.4 only for the B.2-facing whole-reidentification case. Otherwise use A.6.F, A.2.2, C.16, A.3.4, C.30.TFS-REL, A.15, or architecture patterns.
B.2.P:5.4 - “The Selected Context Became A Meta-System”
Recover the exact selected relation organization. If it is BoundedModelUseStructure, keep it as dependent U.Structure under A.1.1 and A.22. A context label, Context Map, diagram, or selection decision supplies no constituents, part relations, agency, holonhood, or MHT. If the source instead concerns an actual system whole, identify that system and its construction independently before B.2.
B.2.P:5.5 - “The Evidence For Emergence Was Lost”
Recover the exact whole-reidentification assertion, its evidence or assurance relation, the selected assertion edition, and the receiving work. Missing evidence can make a governed evaluation return unknown; a stale edition can fail G.11 currentness; a person or System performing the receiving work can decline reliance, defer, or reopen. None of those results reverses an actual construction or changes the direct rule that decides whether the existing whole continues or a new whole must be identified. Do not rewrite evidence loss as absence of the whole or as a new MHT.
B.2.P:5.6 - “The Assembly Changes Form One Higher-Level Change”
Identify each actual change independently under A.3.4. A shared work occurrence, flow, changed referent, time window, method decomposition, or C.13 construction trace does not make those changes parts of one transformation. If the use requires a composite transformation and no direct governor supplies constituent contribution, compatibility, boundary, interfaces, whole identity, and reidentification, return that exact blocker. Do not infer either composition or atomism.
B.2.P:5.7 - Bias-Annotation
| Bias | How B.2.P prevents it |
|---|---|
| Emergence-as-root-kind bias | The recovery starts from EntityOfConcern, claim kind, and subject pattern; no generic U.Emergence is introduced. |
| Collection-agency bias | Collective nouns are separated into membership set, constructed whole, acting collective system, whole-level characteristic bearer, or candidate new holon named by an MHT claim. |
| Metric-as-whole bias | Benchmark jumps and characteristic changes stay with C.16, A.10, C.29, source-use, and evaluation patterns unless B.2 whole reidentification is still live. |
| Math-lens-as-ontology bias | Graph, scale, morphism, benchmark, and MSPD expressions stay mathematical-lens or evaluation material until the in-life EntityOfConcern is recovered. |
| Source-mnemonic bias | MET, MFT, promotion, and post* spellings remain recognition cues until the concrete thing or claim and its direct pattern are named. |
B.2.P:6 - Conformance Checklist
| Check | Requirement |
|---|---|
CC-B2P-1 | Precision restoration starts with claim-kind recovery, not lexical replacement. |
CC-B2P-2 | No generic U.Emergence is created. |
CC-B2P-3 | Whole reidentification requires B.2; B.2.P does not declare MHT. |
CC-B2P-4 | Collection admission remains with subject patterns unless collection wording is entangled with emergence-family or MHT wording. |
CC-B2P-5 | Capability, functioning, characteristic, architecture, evidence, math-lens, publication, and source-use claims keep their subject patterns. |
CC-B2P-6 | Source mnemonics and result-field spellings do not identify subject patterns or become U-kinds. |
CC-B2P-7 | Replacement wording is reread in its complete natural span through F.19 with E.10 cues inside; only a remaining FPF question opens the applicable lexical or subject rule before live use. |
CC-B2P-8 | Whole-reidentification recovery names the exact existing whole, changed direct facts, exact candidate new whole, every condition of the complete A.1 criterion including governed larger-assembly compatibility, and whether the existing whole continues or the new whole must be identified, without a generic recovery record or bounded-context field. |
CC-B2P-9 | Evidence, evaluation, assertion or record identity, G.11 currentness, and receiving reliance remain separate from world-side construction and reidentification. |
CC-B2P-10 | Selected dependent structures and collections do not become holons by name; several changes do not become a composite transformation, and a missing composition governor does not establish atomism. |
B.2.P:7 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Symptom | Repair |
|---|---|---|
| Emergence as root kind | The sentence needs a new named thing called emergence. | Recover claim kind; use B.2, C.16, C.29, C.30, A.2.2, A.6.F, A.10, or source-use pattern. |
| Collection receives agency by wording | A community, pool, fleet, or base acts because the noun is collective. | Recover membership, collection-as-whole, acting collective system, whole-level characteristic, or MHT separately. |
| Metric jump as new whole | Benchmark improvement is declared as emergence. | Use C.16, A.10, C.29, and source-use patterns; use B.2 when whole identity remains the question. |
| Title mnemonic as authority | MET or MFT is used as if the acronym named the thing or claim under discussion. | Recover an episteme-whole reidentification claim, capability or functioning facts, their direct episteme or function pattern, or source-only wording. |
| Description as in-life whole | A model, dashboard, report, or twin is treated as the system because it depicts the system. | Use episteme, publication, architecture-description, source-use, or digital-twin description patterns for the description; independently recover any in-life holon under its direct pattern. |
| Evidence decides ontology | Missing or stale evidence is taken to end a whole, while a current record is taken to create one. | Keep construction and reidentification world-side; evaluate support, currentness, and reliance separately. |
| Selected structure as new whole | A bounded model-use structure or Context Map is called a meta-system. | Keep dependent U.Structure under A.1.1 and A.22, and identify any actual candidate new system independently. |
B.2.P:8 - Consequences
Positive consequences:
- B.2-family emergence language no longer creates hidden U-kinds.
- B.2, B.2.2, B.2.3, and B.2.4 stay centered on their subject claims instead of carrying repeated first-stage precision restoration.
- Collections, capabilities, functions, characteristics, architecture residuals, mathematical expressions, and publications keep their subject patterns.
Costs:
- Ambiguous emergence-family phrases take one recovery step before use.
- Some attractive umbrella claims become narrower subject-pattern claims.
- Old mnemonic labels may survive only as quoted source wording or reduced-use cues unless the concrete thing or claim and its direct pattern are identified.
B.2.P:9 - Rationale
Emergence-family wording is useful because it marks a possible explanatory concern. It is dangerous because it can hide the actual object: a holon, system, episteme, capability, characteristic, architecture structure, mathematical expression, evidence relation, source publication, or collection.
B.2.P follows F.19’s whole-span reading with compact E.10 cues; E.10.ARCH or a direct subject rule resolves only the remaining FPF ontology question, after which F.19 tests the repaired sentence. This prevents one word from creating several local ontologies.
B.2.P:10 - SoTA-Echoing
| Line of practice | Practical implication for B.2.P |
|---|---|
| Emergence and whole-level behavior literature distinguishes new-whole questions from ordinary characteristic, capability, and measurement claims. | B.2.P keeps whole reidentification with B.2 and assigns ordinary characteristic, capability, evidence, and measurement claims to their subject patterns. |
| Systems and holonic practice use collection and whole language for many different objects. | B.2.P requires membership, constructed whole, acting collective system, whole-level characteristic bearer, and candidate new holon named by an MHT claim to be identified separately. |
| Mathematical and statistical treatments of scale, coarse-graining, graphs, morphisms, and benchmarks can clarify a claim without replacing the ontology. | B.2.P uses C.29 for the mathematical-lens claim and still requires the in-life EntityOfConcern and direct subject pattern. |
| Publication and model practice often makes the description more visible than the described holon or characteristic. | B.2.P separates publication, source-use, model, dashboard, and architecture-description claims from the in-life whole-reidentification claim. |
B.2.P:11 - Relations
- Builds on:
F.19,E.10,E.10.ARCH,E.24,F.18, andB.2. - Uses for whole reidentification:
B.2, withB.2.2andB.2.3as kind-specific specializations andB.2.4as the capability/functioning decision bridge. - Keeps collection admission with:
A.14,C.13,B.3.5,A.1,A.15, A.2 patterns, andC.16. - Coordinates with:
A.2.2,C.16,A.6.F,A.3.4,C.30,A.22,A.1.1,C.30.ASV,C.30.TFS-REL,C.30.ILC,C.32.P2S,C.29,A.10,B.3,C.2.1,G.11,E.17, and source-use patterns.
B.2.P:End
B.2.2 - Meta-System Transition: Test the Proposed New Whole as a System
Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative
B.2.2:0 - Use This When
Use this pattern when B.2 has identified one exact candidate new whole and that same individual must be recognized under the already admitted U.System kind: a swarm, production cell, cloud platform, regulated control system, organizational unit, or another physical or operational whole that can act in work or transformation while remaining itself.
The first useful question is not “is there emergence?” First test the exact candidate against A.1’s six common components. Then test whether its physical or operational organization makes it eligible to act in work or transformation while preserving its identity—the direct U.System criterion. After those two tests, recover only the additional facts used by the concrete case, such as delimitation, an objective or commitment, coordination, capability, system-role kind or assignment, method, work, transformation, functioning, architecture, evidence, assurance, or time. State each fact or claim through the pattern that defines its object or relation. Do not make an objective or commitment a condition for U.System recognition; require it only for the separate objective or commitment claim being made.
Use B.2 first to decide whether whole reidentification is needed and to identify the one candidate new whole. Use B.2.2 only when that candidate is to be tested under the already admitted U.System kind.
What goes wrong if missed. A real operating whole is still managed through old component claims, or a mere collection is declared a new system without establishing its A.1 basis and acting eligibility.
What this buys. The system MHT keeps the useful meta-system-transition intuition while preserving FPF’s subject patterns for system participation, architecture, capability, transformation, work, evidence, and assurance.
Not this pattern when.
- If the result whole is claim-bearing and non-agentive, use
B.2.3and the episteme family. - If the evidence is only a capability or functioning gain without whole reidentification, use
A.2.2,C.16,A.6.F,A.3.4,C.30.TFS-REL, andA.10. - If the claim is ordinary system aggregation or delimitation, use
B.1.2,A.1,A.14, andC.13. - If the claim is a mathematical, simulation, graph, benchmark, or scaling expression, use
C.29and the relevant description or publication pattern before returning to B.2. - If the claim is only supervisor-subholon feedback relation inside an already admitted system whole, use
B.2.5.
B.2.2:1 - Problem Frame
B.2 is holon-general. B.2.2 is its U.System specialization.
A system-result MHT is current when B.2’s exact new whole proposed for recognition under the already admitted U.System kind is a physical or operational holon eligible to act and the case needs that same recognized whole to carry one or more separately governed system-level claims, such as delimitation, objective, coordination, capability, functioning, architecture, transformation, work, assurance, or time. The old constituent systems may remain parts, participants, resources, or interacting neighbors, but their claims do not automatically become claims about that recognized result system.
A collection of systems is not thereby a system MHT. B.2.2 carries B.2’s existing-whole/new-whole comparison through complete A.1 recognition and the direct U.System criterion; it does not create a system-specific result object or record schema.
B.2.2:2 - Problem
Without this specialization:
- System identity stays on old parts. The project keeps component assurance, component responsibilities, and component interfaces after the operating whole has changed.
- System claims become rhetoric. A group gets a collective name, but no delimitation, objective, obtaining coordination relation, or capability envelope is established for the exact new whole proposed for recognition under
U.System. - Supervision is overread. A coordination mechanism is treated as a containing whole, safety warrant, or complete system recognition without the corresponding direct facts.
- Transformation is confused with containment. One system changing another holon is treated as part-whole construction instead of transformation and work.
- Architecture description replaces architecture. Dashboards, diagrams, simulations, bills, and digital twins are treated as the operating system rather than descriptions of it.
B.2.2:3 - Forces
| Force | Tension |
|---|---|
| Component assurance vs result-system assurance | Old component claims may still matter, but they do not automatically cover the new operating whole. |
| Delimitation vs external participation | The result system needs an admitted delimitation while external acting systems, external resources, and its environment remain outside it. |
| Coordination vs whole identity | An obtaining coordination relation can make the system question live, but coordination alone does not satisfy A.1 or the direct U.System criterion. |
| Capability gain vs identity change | A new capability envelope can reveal a result system, but some gains remain ordinary capability or functioning claims. |
| System architecture vs system description | Architecture claims concern the operating whole; diagrams and records have separate description, representation, or publication uses. |
B.2.2:4 - Solution
After B.2 leaves a whole-reidentification question open, continue with the same exact candidate new whole and direct facts. Add no system-specific result species or context-shaped slice.
B.2.2:4.1 - Reuse The B.2 Candidate And Complete System Recognition
Keep B.2’s one resultHolonRef for the exact candidate new whole and its one resultHolonKindRef, which here resolves to the already admitted U.System kind. The references may appear in B.2’s optional HolonReidentificationRecord when a receiving use needs a durable account; B.2.2 adds no second record.
Before calling the candidate a system result:
- execute the complete A.1 criterion over the candidate’s exact constituents, obtaining constructive relations, governed assembly, reidentification rule, and composition-grounded whole characteristic;
- show that its actual boundary, interfaces, relevant characteristics, and identity-preservation conditions satisfy at least one applicable governed larger-assembly construction method or rule under which it can remain a constituent;
- apply the direct
U.Systemcriterion to that same individual: its actual physical or operational organization must make it eligible to act causally in work or transformation while preserving its identity; - recover only the additional system facts used by the concrete case—including any delimitation, objective, commitments, coordination, capability, system-role kind or assignment, method, work, transformation, functioning, architecture, evidence, assurance, or temporal claim—and state each through the pattern that defines its object or relation; and
- keep the classification judgment, evidence or assurance, currentness, and receiving reliance separate from those world-side facts.
If a required A.1 component or the acting-eligibility criterion fails, do not identify the candidate as the system result. If an additional system fact needed for another claim is absent, withhold that claim rather than treating its absence as failure of the U.System criterion. If missing evidence or an unavailable dependency prevents a determination, report unknown; neither a filled reference nor an optional record changes that result.
B.2.2:4.2 - Carry Result-System Claims Through Subject Patterns
When the candidate is recognized as U.System, state every changed result-system fact or claim under its subject pattern:
- system-role assignments through
A.2.1, relations among system-role kinds throughA.2.7, and other relations through the patterns that define them; - capabilities through
A.2.2and their measured-characteristic claims throughC.16; - methods through
A.3.1, their descriptions throughA.3.2, and mechanisms throughA.6.1; useA.15when their alignment with roles and work is the question; - transformations through
A.3.4; - work occurrences through
A.15.1; - functioning and functional-structure wording through
A.6.Fto its direct subject pattern; selected transformation-flow structures throughE.18and their bounded architecture use throughC.30.TFS-REL; - architecture through
C.30,A.22, andC.30.ASV; - evidence and assurance through
A.10,B.3, andB.3.5; - temporal and dynamics claims through
C.27,A.19, and the direct temporal patterns.
Do not reuse old component evidence as if it automatically covered the proposed new whole after recognition under U.System. Carry an unchanged component claim only through its exact continuing relation; establish each changed result-system fact under its subject pattern and support the associated claim through a separate evidence or assurance relation.
B.2.2:4.3 - System Trigger Interpretation
When a receiving use has materialized B.2’s optional MHTTriggerProfile, read its cues for a system case as follows:
Cue recorded in MHTTriggerProfile | System-case reading | Subject pattern kept visible |
|---|---|---|
| Delimitation change | The operating whole now has an external delimitation and crossing relations that differ from the old aggregate. | A.1, B.1.2, A.14, C.13 |
| Objective or evaluation change | Recover the system-level objective, mission, or SLO used as an evaluation criterion; distinguish any safety case or viability claim from that criterion. | C.16, E.13, A.10, decision or assurance patterns |
| Supervision or coordination change | Recover how constituent behavior is regulated for the result whole, including controller or distributed-coordination facts; name any protocol or governance claim separately. | B.2.5 only for supervisor-subholon feedback; A.12, A.3.4, A.15.1 for their separately current claims |
| Capability or closure claim | Recover the exact capability envelope and closure relations of the proposed new whole after recognition under U.System; keep supporting evidence separate. | A.2.2, C.16, A.10 for evidence use, and B.2.4 when whole reidentification is current |
| Agency threshold | The result whole crosses a concern-specific agency threshold in characteristic space. | A.13, A.19, C.16 |
| Temporal consolidation | A commissioning, phase, release, or operating-time consolidation changes the current system identity claim. | C.27, A.15.1, temporal patterns |
| Context reframe | A changed question or selected model-use structure changes which exact whole is under concern; it does not itself change that whole’s identity. | A.1.1, A.22, B.2, and the whole’s direct identity pattern |
No cue is enough by itself. Each row points to facts and claims to inspect; B.2’s direct existing-whole/new-whole comparison, complete A.1 recognition, and the system-kind criterion decide the result.
B.2.2:4.4 - Delimitation and External Acting Systems
For system-result MHT, distinguish:
- a part of the result system;
- an external acting system that changes the result system or a constituent;
- an environment or resource that participates in work;
- a description, dashboard, twin, model, diagram, or publication about the result system.
A lathe making a workpiece, a controller steering a plant, or a teacher changing a learner does not thereby become a part of the changed holon or the larger whole containing it. Use A.12, A.3.4, and A.15.1 for acting side, transformation, and work. Use part-whole patterns only when parthood itself is admitted.
B.2.2:4.5 - Assurance Re-Basing
When the exact candidate new whole is recognized as U.System, test old assurance against that system rather than transferring it by name.
Ask:
- Which component evidence still applies unchanged?
- Which evidence applies only through explicit correspondence or source-use relation?
- Which assurance claims must be rewritten for the result system?
- Which architecture, capability, functioning, work, temporal, or evidence claims now have different subject patterns?
A claim about the recognized result system may reuse component evidence only through an exact correspondence or source-use relation and a fresh evaluation of applicability. That system does not inherit safety, reliability, responsibility, or performance claims by label.
B.2.2:5 - Archetypal Grounding (Worked Cases)
B.2.2:5.1 - Search-And-Rescue Swarm
Before MHT, the project has individual drones with local navigation and maintenance records. After MHT, the current object may be one search-and-rescue swarm if the result whole has its own mission objective, coordination relation, external command relation, capability envelope, and swarm-level risks.
- Candidate new whole: the search-and-rescue swarm named by B.2.
- A.1 basis: exact drone constituents, obtaining formation and coverage-coordination relations, the governed swarm assembly, the swarm reidentification rule, and the whole-level area-search characteristic; its boundary, command and mission interfaces, operating characteristics, and identity-preservation conditions also fit the applicable larger rescue-system construction rule.
- System criterion: the swarm has acting eligibility. This case also has its own command-and-operating-area delimitation, mission objective, coordination relations, and external commitments.
- Assurance: swarm-level tests support claims about the candidate; individual drone certificates remain component evidence and do not establish the swarm facts.
The old drone evidence remains relevant, but it is not enough for the swarm-level assurance claim.
B.2.2:5.2 - Cloud Platform
Independent services become a platform only if the current claim concerns a result system: a shared control plane, system-level SLO, deployment and rollback coordination, platform-level evidence, and external commitments.
If the only change is a better dashboard or one more service, use architecture-description, publication, measurement, or component patterns. Use B.2.2 only when B.2 identifies the operating platform itself as the exact candidate new whole and that candidate passes A.1 plus the direct U.System criterion.
B.2.2:5.3 - Production Cell
A machine, robot, fixture, workpiece carrier, and inspection station can become a production cell when the cell has its own delimitation, objective, obtaining coordination relations, transformation structure, exact work occurrences, and capability envelope. Evidence separately supports the claims about those facts.
A fixture being manufactured as a workpiece is not part of the machine merely because the machine changes it. The production cell claim needs a result system; the manufacturing relation remains transformation and work.
B.2.2:5.4 - Bias-Annotation
| Bias risk | Failure | Mitigation |
|---|---|---|
| Named aggregate as system | A fleet, platform, or cell name is treated as system recognition. | Apply B.2 to one exact candidate; require the complete A.1 criterion and the direct U.System criterion. |
| Component evidence transfer | Component certificates are read as assurance for the proposed new whole after its recognition under U.System. | Re-test each claim against that exact recognized system and use exact evidence or assurance relations; do not transfer support by label. |
| Coordination as whole | A controller, protocol, or coordination relation is treated as automatic system MHT. | Recover the obtaining relation, then require B.2 whole reidentification plus complete A.1 and U.System recognition; keep any support separate. |
| Description as system | Dashboard, simulation, model, twin, or bill is treated as the operating system. | Use episteme, publication, source-use, and architecture-description patterns for description objects. |
| Transformation as containment | An external system changes a holon and is treated as its part or containing whole without a separately obtaining part-whole relation. | Use A.12, A.3.4, A.15.1, B.2.5, and part-whole patterns separately. |
B.2.2:6 - Conformance Checklist
| Check | Requirement |
|---|---|
CC-B2.2-1 | B.2 has already left a whole-reidentification question before B.2.2 is used. |
CC-B2.2-2 | B.2’s one exact candidate new whole passes the complete A.1 criterion and is independently recognized under the already admitted U.System kind. |
CC-B2.2-3 | No system-specific result reference, context-shaped slice, or second reidentification record is introduced; any optional durable account remains B.2’s C.2.1 episteme. |
CC-B2.2-4 | Result-system delimitation and crossing relations are named without creating U.Boundary or U.Interaction. |
CC-B2.2-5 | An obtaining supervision or coordination relation is not treated as automatic system recognition, and evidence for it is not treated as safety warrant. |
CC-B2.2-6 | Acting-system participation, transformation, and work are separated from parthood. |
CC-B2.2-7 | Component assurance is not silently transferred to the result system. |
CC-B2.2-8 | Recover the episteme, representation, or publication claim for a description, dashboard, simulation, or digital twin separately from recognition of the operating system it describes, even when that system is the EoC. |
B.2.2:7 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Symptom | Repair |
|---|---|---|
| Named aggregate as system | “The platform” or “the fleet” is treated as a system because it has a name. | Identify one exact candidate and apply the complete A.1 and direct U.System criteria; if either fails or cannot be determined, withhold system-result recognition and return that failure or unknown to B.2 without inferring that the old whole is sufficient. |
| Component certificate transfer | Individual part certificates are used as result-system assurance. | Re-base assurance through B.2.2:4.5 and evidence-use patterns. |
| Controller as containing whole | A controller or external system is treated as the new whole because it changes the parts. | Use A.12, A.3.4, B.2.5, and part-whole patterns separately. |
| Dashboard as system | A monitoring model is treated as the operating system. | Use episteme, publication, source-use, C.30.AD, or digital-twin description patterns. |
| Capability jump as system MHT | A metric improves and the result is called a new system. | Perform B.2’s ordinary existing-whole comparison; return to capability, characteristic, Method, Work, or architecture patterns if the existing whole remains sufficient. |
B.2.2:8 - Consequences
Positive consequences:
- Meta-system transition remains usable for engineering and organizational systems without making B.2 system-only.
- System ontic preservation becomes explicit: the same exact candidate is recognized under A.1 and
U.System, while each system fact and claim stays with its subject pattern. - Assurance, responsibility, architecture, work, and evidence claims are kept with their subject patterns.
Costs:
- A system-result MHT cannot be declared by name, diagram, dashboard, or metric jump alone.
- Teams must separate old component evidence from result-system evidence.
- Some apparent emergence claims return to ordinary system aggregation, capability, measurement, or architecture repair.
B.2.2:9 - Rationale
Valentin Turchin’s meta-system transition remains a useful intuition for the system case: components can become a higher operating whole when coordination and control create a new object of management and assurance. FPF generalizes that intuition in B.2, then uses B.2.2 to keep the classical system case precise.
The key distinction is ontological, not lexical. A whole proposed for recognition under the admitted U.System kind is not a trigger profile, coordination mechanism, graph, description, dashboard, or process label. It is one exact candidate new whole that satisfies A.1 and the direct U.System criterion; every changed system fact and claim stays with its subject pattern.
B.2.2:10 - SoTA-Echoing
| Source family | Lesson for B.2.2 | FPF decision |
|---|---|---|
| Meta-system transition and holonic systems lineage | A new coordinated whole can become the relevant operating object. | Use B.2 for whole reidentification, then apply complete A.1 and U.System recognition to the same candidate as required by B.2.2. |
| Systems-of-systems and cyber-physical systems practice | Operational closure, coordination, external commitments, and assurance often change at the level of the exact new whole proposed for and then recognized under U.System. | B.2.2 keeps the direct facts with their subject patterns and tests each assurance claim against that exact recognized system instead of transferring component support. |
| Constructional and part-whole ontology | Acting on an object and being part of it are different relations. | A.12, A.3.4, A.15.1, A.14, and C.13 remain separate subject patterns. |
| Digital-twin and architecture-description practice | Rich descriptions can track a system without being the system. | Use episteme, description, representation, and publication patterns for the descriptive item; recover the operating system independently as EoC. |
B.2.2:11 - Relations
- Specializes:
B.2for one exact candidate new whole independently recognized under the already admittedU.Systemkind. - Builds on:
A.1,B.1.2,A.14, andC.13for holon and system delimitation and part-whole grounding. - Coordinates with:
A.12,A.3.4,A.15,A.15.1,A.2.1,A.2.2,C.16,A.6.F,C.30,A.22,C.30.ASV,C.30.TFS-REL,A.10,B.3, andB.3.5. - Uses:
B.2.5when supervisor-subholon feedback relation is part of the system-result evidence. - Contrasts with:
B.2.3for MHT-result holons admitted asU.EpistemeandB.2.4for the capability and functioning decision bridge to whole reidentification.
B.2.2:End
B.2.3 - Meta-Holon Transition With Episteme Result
Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative
B.2.3:0 - Use This When
Use this pattern when B.2 has identified one exact candidate new whole and that same individual must be recognized under the already admitted U.Episteme kind: a theory, model family, standard, doctrine, specification body, research programme, field-level knowledge body, or other claim-bearing non-agentive holon.
Use B.2 first to decide whether whole reidentification is current and to identify the one candidate new whole. Use B.2.3 only when its resultHolonKindRef resolves to U.Episteme.
First useful move. For B.2’s exact candidate, identify one U.ClaimGraph, one exact EntityOfConcern, and one effective U.ReferenceScheme, then test whether their EpistemeConstitutionRelation obtains under C.2.1. Keep grounding, viewpoint, view, publication, source use, representation, evidence, and assurance in their neighboring direct relations.
What goes wrong if missed. A catalogue, literature review, dashboard, model repository, or vocabulary is called a new theory without claim-graph reidentification; or a real new episteme whole is treated as a pile of publications.
What this buys. The pattern preserves B.2 whole reidentification while keeping episteme ontology with C.2.1 and the episteme family. It prevents episteme-result MHT from becoming episteme agency, publication authority, generic emergence, or a second episteme ontology.
Not this pattern when.
- If the result whole is a physical or operational holon eligible to act, use
B.2.2. - If the question is episteme constitution, empirical grounding, publication, source use, view, viewpoint, ClaimGraph, reference scheme, or description use without MHT, use
C.2.1,C.2.P,C.2.P.DR,E.17, and the direct episteme-family pattern. - If the question is effect-free episteme morphing, viewing, retargeting, or controlled semantic coarsening, use
A.6.2,A.6.3,A.6.4, orA.6.3.CSC. - If the question is synthesis work, use
A.15.1for performed work andA.12orA.3.4for acting-side and transformation claims. - If the wording is ambiguous emergence-family language, use
B.2.Pbefore selecting B.2.3.
B.2.3:1 - Problem Frame
A library is not a theory, and a theory is not its publication.
A group of papers, models, datasets, design notes, forecasts, standards, or local doctrines may remain a collection. B.2.3 becomes current only when B.2’s exact candidate new whole can be constructively recognized under A.1 and the current C.2.1 constitution criterion identifies that same individual as one claim-bearing episteme.
B.2.3 introduces no special episteme result object. It retains B.2’s one resultHolonRef and resultHolonKindRef, then requires C.2.1 for episteme constitution and each current neighboring relation’s own subject pattern.
B.2.3:2 - Problem
Without this specialization:
- Catalogues become theories. Aggregated publications or dashboards are treated as a new episteme because they are stored together.
- Theory becomes publication. The paper, report, standard document, model card, or dashboard is used as the episteme itself.
- Episteme receives agency. The theory, standard, or doctrine is described as if it performs work or enforces behavior by itself.
- Morphing becomes MHT. A view, retargeting, coarsening, translation, or model transformation is treated as a new episteme whole.
- Assurance is inherited silently. Trust in constituent sources is treated as trust in the reidentified episteme whole.
- Generic emergence replaces claim structure. “Emergent theory” hides the actual claim graph, reference scheme, and grounding relation.
B.2.3:3 - Forces
| Force | Tension |
|---|---|
| Synthesis vs aggregation | A new episteme whole can integrate claims, but many collections remain indexes, reviews, or portfolios. |
| Episteme identity vs publication form | The episteme may be published in many forms; no publication form is the episteme by appearance. |
| Claim organization vs agency | An episteme can organize claims and guide use, but systems perform work with or on it. |
| Constituent evidence vs result assurance | Evidence for parts may bear on the result, but the result episteme needs its own claim and assurance relations. |
| Source mnemonic vs current ontology | Short labels can aid recognition while hiding whether the current question concerns B.2 whole reidentification, C.2.1 constitution, A.6 morphing, E.17 publication, or source use. |
B.2.3:4 - Solution
Use B.2.3 as the U.Episteme specialization of B.2. Reuse B.2’s exact existing whole, exact candidate new whole, direct construction facts, and optional C.2.1 records; add no context-shaped slice or episteme-result schema.
B.2.3:4.1 - Reuse The B.2 Candidate And Complete Episteme Recognition
Keep B.2’s one resultHolonRef for the candidate and its one resultHolonKindRef, which here resolves to the already admitted U.Episteme kind. Execute the complete A.1 criterion over that candidate, including the larger-assembly applicability and compatibility condition. Then apply C.2.1 to the same individual:
- identify its exact claim content as one
U.ClaimGraph; - identify the exact independently governed
U.Entitythat those claims concern; - identify the effective
U.ReferenceSchemeunder which the claims are read about that entity; and - test whether the direct
EpistemeConstitutionRelationamong those participants obtains and yields one interpretable claim-bearing whole.
The candidate and its constitution relation are distinct, even though C.2.1 reidentifies them from the same participant triple. A card, tuple, repository, publication set, graph representation, or filled reference does not make the relation obtain. If A.1 or C.2.1 fails, do not identify the candidate as the episteme result; if a required dependency cannot be evaluated, return unknown.
B.2.3:4.2 - Keep Constitution And Neighboring Relations Separate
The exact ClaimGraph, EntityOfConcern, and effective ReferenceScheme are the three participants of C.2.1’s EpistemeConstitutionRelation. That constitution relation does not by itself identify A.1 constituents or constructive part relations. When A.1 requires those facts, recover them from an exact direct episteme-part or claim-composition pattern. The EntityOfConcern remains an independently governed entity related through aboutness and reference. Keep all other current questions in their direct relations:
- empirical grounding uses
EpistemeEmpiricalGroundingRelationonly when designated empirical claims have current claim-to-world mappings involving the exact grounding holon; - viewpoint selection for a describing use follows
E.10.D2;U.Viewrecognition requiresE.17.0conformance of the exact episteme to an exact viewpoint; - publication occurrence, publication form, carrier, source use, and C.29 representation remain distinct from the episteme and its constitution;
- an exact acting System first has the A.13 core and A.15.1 independently admits its synthesis Work under a Method; F.6 enters only if the receiving transition account also consumes precise assignment-bound attribution through the same obtaining A.13 assignment, while any actual transformation remains a separate claim; and
- evidence and assurance support or challenge exact claims but do not enter episteme identity or establish constitution.
Add only the neighboring object or relation required by the receiving use. Do not infer any of them from a publication set, and do not turn them into extra identity positions.
B.2.3:4.3 - Episteme Trigger Interpretation
When a receiving use has materialized B.2’s optional MHTTriggerProfile, interpret its cues without giving agency to epistemes:
Cue recorded in MHTTriggerProfile | Episteme-case reading | Subject pattern kept visible |
|---|---|---|
| Delimitation change | The knowledge body now has a stable EntityOfConcern, scope, reference scheme, and claim scope. | C.2.1, A.7, source-use patterns |
| Objective or evaluation change | The result episteme contains an answer or evaluation claim for a question that the collection did not answer as one claim-bearing whole. | C.2.1, C.16, E.21 or relevant evaluation pattern |
| Supervision or coordination change | Principles, axioms, invariants, reference schemes, or claim-graph constraints organize how constituent claims are interpreted. | C.2.1, A.6.0, A.6.1, C.29 when formal lens is current |
| Capability or closure claim | The candidate episteme supports a new explanatory, predictive, specification, or coordination use; evidence for that claim remains separate. | C.2.1, C.16, A.10 for evidence use, and the pattern for that use |
| Agency threshold | The episteme remains non-agentive. For an agency-characteristic claim, recover the exact System, characteristic predicate, scope, and window and test the characteristic independently; that characteristic claim does not require an assignment. A precise agency claim requires the separate A.13 core. If dated Work is also claimed, recover each exact performer through A.13 and let A.15.1 independently admit the Work. Add F.6 only when the receiving claim expressly consumes precise assignment-bound attribution; missing or failed F.6 leaves the Work intact. | A.12, A.2.1, A.13, A.19, C.16, A.15.1, F.6 |
| Temporal consolidation | A chronology or source-currentness change prompts inspection of the knowledge body. Test any changed ClaimGraph, EntityOfConcern or effective ReferenceScheme under C.2.1; currentness alone changes none of those identity values. | C.2.1, C.27, G.11, E.17, and source-use patterns |
| Context reframe | New terms, reference schemes, or EntityOfConcern mapping reframe the knowledge body. | C.2.1, A.6.3, A.6.4, F.18 |
These cues identify claims and relations to inspect. They neither constitute the candidate episteme nor select B.2; the direct facts, complete A.1 criterion, C.2.1 constitution test, and B.2 existing-whole/new-whole comparison decide the result.
B.2.3:4.4 - Blocked Readings
Do not use B.2.3 as:
- a name for generic emergence;
- an authority claim for a publication;
- an agentive claim about a theory, standard, or doctrine;
- an effect-free episteme morphism, view, retargeting, or coarsening;
- a second episteme ontic beside C.2.1;
- a shortcut from source synthesis to high trust;
- a replacement for source-use, evidence, assurance, or publication patterns.
B.2.3:5 - Archetypal Grounding (Worked Cases)
B.2.3:5.1 - Reliability Doctrine
Before MHT, teams have local runbooks, incident reports, dashboards, and reliability definitions. They may be useful, but they are not yet one episteme.
After MHT, the exact candidate may be a reliability doctrine when it passes A.1 and its ClaimGraph, EntityOfConcern, and effective ReferenceScheme stand in an obtaining C.2.1 constitution relation. Add empirical grounding to operating services, handbook publication, and source-use relations for standards or training materials only when the receiving use needs them.
- Candidate new whole: the reliability doctrine named by B.2.
- A.1 basis: exact constituents and constructive relations established by an obtaining episteme-part or claim-composition predicate, a governed assembly and reidentification rule, a composition-grounded claim-bearing characteristic, and compatibility with an applicable larger knowledge-body construction rule.
- C.2.1 constitution: the doctrine’s exact ClaimGraph states its principles and definitions; its EntityOfConcern is user-visible service harm and reliability; its effective ReferenceScheme supplies the reliability designations and interpretation rules.
- Neighboring relations: empirical grounding to operating services, handbook publication, source use for standards and training materials, and evidence or assurance are added only for the receiving use and do not identify the doctrine.
Systems use and cite the doctrine, use it in training, and let its claims guide their work; any relevant local system-role kind and assignment remain separate claims.
B.2.3:5.2 - Model Family Becomes Theory
A model family can remain a toolbox. It becomes an episteme-result MHT only if B.2’s candidate passes A.1 and one exact ClaimGraph, EntityOfConcern, and effective ReferenceScheme stand in an obtaining C.2.1 constitution relation. Empirical grounding and explanatory or predictive use are checked through neighboring direct relations when the receiving use needs them; they are not extra identity constituents.
If the change is only a new model publication or benchmark score, use publication, source-use, measurement, evidence-use, and mathematical-lens patterns instead.
B.2.3:5.3 - Standard Body
A set of clauses, examples, and annexes can become a standard episteme only when the candidate passes A.1 and its exact ClaimGraph, EntityOfConcern, and effective ReferenceScheme satisfy C.2.1 constitution. Recover its terms, references, scope, and conformance claims under that constitution; identify publication forms separately.
The standard is not the committee, the PDF, or the Work of enforcement. The committee may be an acting System. If committee or enforcement Work is claimed, recover each exact performer through A.13 and admit the Work independently under A.15.1. Add F.6 only if the account expressly consumes precise assignment-bound attribution; a missing or failed relation leaves the Work intact. The PDF file is a presentation carrier; its layout may supply a publication form.
B.2.3:5.4 - Bias-Annotation
| Bias risk | Failure | Mitigation |
|---|---|---|
| Library as theory | A repository, dashboard, or reading list is treated as one claim-bearing episteme. | Identify B.2’s exact candidate, execute A.1, and test its C.2.1 ClaimGraph/EntityOfConcern/ReferenceScheme constitution. |
| Publication as episteme | A PDF, report, standard document, model card, or dashboard is treated as the episteme itself. | Keep the episteme, publication form, and carrier distinct under C.2.1, E.17, E.24.PUB, and source-use patterns. |
| Episteme agency | A theory, standard, or doctrine is described as performing Work or enforcement. | Recover every exact acting System through A.13 and let A.15.1 independently admit the Work. Add F.6 only when the receiving account expressly consumes precise assignment-bound attribution; a missing or failed attribution does not demote the Work. |
| Morphing as MHT | View, translation, coarsening, or retargeting is called a new episteme whole. | Use A.6 episteme-morphism patterns unless B.2 whole reidentification remains current. |
| Source trust transfer | Trust in constituent sources becomes assurance for the result episteme. | Re-evaluate assurance and source-use relations for the result episteme; retain only those that still apply to its exact claims. |
B.2.3:6 - Conformance Checklist
| Check | Requirement |
|---|---|
CC-B2.3-1 | B.2 has left a whole-reidentification question before B.2.3 is used. |
CC-B2.3-2 | B.2’s one exact candidate new whole passes the complete A.1 criterion and is independently recognized under the already admitted U.Episteme kind through current C.2.1 constitution. |
CC-B2.3-3 | No episteme-specific result reference, context-shaped slice, second result schema, or extra episteme identity positions are introduced. |
CC-B2.3-4 | Publication, source-use, view, viewpoint, claim-bearing, and representation questions require C.2.1, E.17, C.2.P, C.2.P.DR, and direct episteme-family patterns. |
CC-B2.3-5 | The episteme is non-agentive. Acting Systems first satisfy A.13, and synthesis or enforcement Work is independently admitted through A.15.1. F.6 enters only for an expressly consumed precise assignment-bound attribution; missing or failed F.6 leaves the Work intact. Agency-characteristic evaluation remains independent of assignment. |
CC-B2.3-6 | Assurance for the result episteme is not silently inherited from constituent epistemes or publications. |
CC-B2.3-7 | Effect-free morphing, viewing, retargeting, and controlled coarsening are not treated as B.2.3 unless whole reidentification is current. |
B.2.3:7 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Symptom | Repair |
|---|---|---|
| Library as theory | A repository or reading list is treated as one episteme. | Recover one exact candidate and test A.1 plus the C.2.1 constitution relation; if either test fails, withhold episteme-result recognition. Keep any independently established collection claim without inferring that it is sufficient for the current use; report unknown when a required test cannot be evaluated. |
| PDF as episteme | A PDF carrier or its publication form is used as the theory itself. | Use publication patterns for the PDF and keep B.2’s resultHolonRef for the independently constituted episteme. |
| Doctrine receives agency | “The standard enforces…” or “the theory decides…” | For a literal claim of dated enforcement or decision Work, recover its actual performer through A.13 and admit the Work independently under A.15.1; add F.6 only when the use consumes precise assignment-bound attribution. Otherwise use F.19 to retain ordinary guidance wording when its capable user and action are recoverable. |
| Morphism as MHT | A view, translation, coarsening, or retargeting is called a new episteme whole. | Use A.6.2, A.6.3, A.6.4, or A.6.3.CSC unless B.2 whole reidentification is current. |
| Synthesis as high trust | A new theory inherits trust because its sources were reliable. | Rebuild assurance for the result episteme through A.10, B.3, B.3.5, C.2.1, and source-use patterns. |
B.2.3:8 - Consequences
Positive consequences:
- Episteme-result MHT becomes usable without preserving title mnemonics as ontology.
- C.2.1 remains the episteme identity pattern.
- Publications, source use, synthesis work, evidence, assurance, and acting systems remain separate.
Costs:
- A claimed synthesis must identify and test the current C.2.1 constitution, not only cite a portfolio.
- Result-episteme assurance requires a fresh applicability judgment for the exact result claim; existing relations may be reused where that judgment warrants it.
- Some “new theory” claims return to publication, source-use, morphism, benchmark, or evidence-use patterns.
B.2.3:9 - Rationale
Knowledge synthesis can create a new holon, but only when the result is a reidentified claim-bearing episteme. B.2.3 keeps that useful case and removes the drift toward episteme agency, publication authority, generic emergence, and duplicate episteme ontology.
This pattern is deliberately thin. B.2 is the pattern for whole reidentification; C.2.1 is the pattern for the ClaimGraph/EntityOfConcern/ReferenceScheme constitution relation and episteme identity; publication and source-use patterns contain the defining content for their relations; A.6 episteme-morphism patterns contain the defining content for morphing and retargeting; use A.15.1 for synthesis Work and A.12 for the acting-side split.
B.2.3:10 - SoTA-Echoing
| Source family | Lesson for B.2.3 | FPF decision |
|---|---|---|
| Evidence synthesis and living-review practice | Synthesis claims need explicit scope, evidence relation, currentness, and maintenance rather than narrative authority. | B.2.3 requires current C.2.1 constitution and keeps assurance and source use in neighboring relations. |
| Knowledge-graph and claim-network practice | A knowledge body can be represented as related claims, evidence, and sources. | The actual ClaimGraph is a C.2.1 constitution participant; its graph representation, evidence, and sources do not declare MHT or add episteme identity positions. |
| Science-of-science and paradigm-change studies | Fields and theories can consolidate into named bodies with new scope and organizing principles. | B.2.3 treats consolidation as a cue to inspect; it neither constitutes the candidate episteme nor selects B.2. |
| Publication and standards practice | A standard, report, model, or dashboard use may concern claim content, a representation, a publication form, or its carrier; its name alone does not decide which. | E.17 and source-use patterns remain separate from the episteme whole. |
B.2.3:11 - Relations
- Specializes:
B.2for an exact candidate new whole independently recognized under the already admittedU.Epistemekind. - Builds on:
B.2for the exact candidate new whole and whole reidentification,A.1for candidate recognition,C.2.1for the obtaining ClaimGraph/EntityOfConcern/ReferenceScheme constitution relation, andE.24.UKfor prior public-kind admission. - Coordinates with:
C.2.P,C.2.P.DR,E.17,E.17.*,A.6.2,A.6.3,A.6.4,A.6.3.CSC,A.10,B.3,B.3.5,C.29,F.18, andF.19. - Uses:
B.2.Pwhen source wording such as emergence-family or title-mnemonic wording hides the claim kind. - Contrasts with:
B.2.2for system-result MHT andB.2.4for the capability and functioning decision bridge to whole reidentification.
B.2.3:End
B.2.4 - Do Capability or Functioning Changes Require Whole Reidentification?
Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative
B.2.4:0 - Use This When
Use this pattern when exact capability, functioning, or transformation-flow facts, already established under their subject patterns, make a B.2 whole-reidentification question live.
The first useful question is whether those facts can still be explained by the existing whole. If they can, keep that whole and use the direct pattern for the capability, functioning relation, transformation, Method, Work, module, characteristic, or architecture claim. If they cannot, use B.2 for the residual question. Evidence and measurement separately support, challenge, or leave unresolved the claims about those facts; they create neither the facts nor B.2 selection.
What goes wrong if missed. A genuine new whole is hidden under ordinary capability improvement; or every impressive capability, function, method chain, module allocation, or metric gain is overclaimed as emergence.
What this buys. The pattern keeps capability and functioning facts available to B.2 while preserving the separate evidence relation and preventing B.2.4 from becoming a generic capability, function, method, work, module, or emergence pattern.
Not this pattern when.
- If the claim is ordinary capability, use
A.2.2; useC.16for its measured-characteristic claims. - If function-like wording hides the exact claim, use
A.6.Fto recover its direct subject pattern; an already precise functioning claim returns directly to that pattern. - If the claim is transformation or transformation-flow structure, use
A.3.4orE.18respectively; useC.30.TFS-RELfor the selected structure’s bounded architecture use. - If the claim is method, method relation, method description, work plan, or work occurrence, use
A.15,A.3.1,A.3.2,A.15.2, andA.15.1. - If bearer allocation is the question, use the direct allocation or parthood pattern. Use
A.6.Monly for unresolved module/interface wording, andC.30,A.22orC.30.ASVonly for the current architecture, selected-structure or architectural-view claim. - If the claim is measurement, threshold, score, robustness, quality, or a whole-level characteristic, use
C.16andA.19for that claim andA.10only when evidence use is current. - If the wording is ambiguous emergence, synergy, or title-mnemonic language, use
B.2.Pbefore selecting B.2.4.
B.2.4:1 - Problem Frame
A new capability is not automatically a new whole. A function-like relation is not automatically a part-whole relation. A transformation-flow structure is not automatically MHT.
B.2.4 is the narrow B.2 specialization for cases where exact capability, functioning, or transformation-flow facts defeat the existing-whole explanation and point to a candidate new holon. Evidence bears on claims about those facts; it does not make the explanation fail by itself.
B.2.4:2 - Problem
Without this specialization:
- Capability becomes generic emergence. A threshold crossing or new envelope is treated as a new whole without B.2 checks.
- Function becomes ontology. Function-like wording creates
U.Functionor a hidden peer kind. - Method and work collapse. The way of doing, description of doing, planned work, and performed work are compressed into one vague operational claim.
- Module allocation becomes functional truth. A module label is treated as evidence for the required behavior or selected structure.
- Transformation-flow description replaces in-life structure. A graph, diagram, or publication of a flow is treated as the flow structure or whole.
- Whole reidentification is missed. A real result whole is left as “just a better capability”.
B.2.4:3 - Forces
| Force | Tension |
|---|---|
| Capability facts vs whole identity | Exact capability facts can make a new-whole question live; capability claims stay with A.2.2 and measured-characteristic claims with C.16, whether or not that question arises. Their evidence remains separate. |
| Functioning relation vs part-whole relation | Functioning often crosses parts and bearers; it is not parthood by wording. |
| Transformation-flow structure vs mathematical description | Flow structure may enter architecture claims; selecting a graph or diagram as an object of concern does not identify it with the flow structure it represents. Its lens, description, or publication use remains separate. |
| Method composition vs performed work | A method relation can describe possible doing, while a dated work occurrence is an in-life fact and evidence only supports claims about that occurrence. |
| New whole vs local improvement | The pattern must preserve real novelty without turning every improvement into MHT. |
B.2.4:4 - Solution
Use B.2.4 as a decision bridge from direct capability and functioning facts to B.2 whole reidentification. Add no generic slice, context placeholder, candidate-bearer list, or second B.2 record.
B.2.4:4.1 - Start From Exact Facts, Claims, And Support
- Name the exact existing whole and its direct identity or reidentification rule.
- Identify each exact capability envelope, obtaining functioning relation, or selected in-life transformation-flow structure under its subject pattern. Keep method, method description, work plan, work occurrence, module allocation, characteristic, and architecture facts separate when they are current.
- State the exact claim made about those facts. Name evidence or measurement only as a separate relation that supports, challenges, or leaves that claim unresolved.
- Perform B.2’s ordinary existing-whole comparison. Better measurement, component improvement, Method or Work repair, allocation repair, or architecture-view repair can leave the same whole in place.
- If a residual whole-reidentification question remains, use B.2 for it. B.2 then identifies one exact candidate new whole, applies the complete A.1 and kind-specific criteria, and compares that candidate with the existing whole.
B.2.4 adds no result species. If a receiving use needs a durable account, use B.2’s optional C.2.1 epistemes; their content neither creates the direct facts nor selects the new whole.
B.2.4:4.2 - Subject-Pattern Test
Before applying B.2, test whether the exact facts are already explained under a subject pattern:
| Exact fact or claim under concern | Subject pattern if sufficient | B.2.4 remains current only when |
|---|---|---|
| Capability envelope | A.2.2 for the capability of an exact System holder, C.16 for measured characteristics; A.10 only for evidence use | the exact envelope and holder facts leave a candidate-whole question that the existing whole cannot explain |
| Function or functioning relation | A.6.F recovers the exact claim and its direct subject pattern; A.3.4 for an actual transformation and C.16 for a measured characteristic | the obtaining relation and whole-level facts leave a residual new-whole question |
| Transformation-flow structure | E.18 for the selected structure, A.3.4 for actual transformations, C.30.TFS-REL for bounded architecture use; C.29 only for a mathematical representation use | the selected in-life structure changes which whole can carry the current claim |
| Method relation or method family | A.3.1 for Method identity, B.1.5 for composition, A.15 for role–Method–Work alignment, and G.5 for registry or selector-facing use; use the direct pattern for any separately claimed family relation and C.29 only when a lens is used | the exact method facts change the whole, not merely the way of doing |
| Method description or procedure text | A.3.2 and C.2.1 distinguish the MethodDescription and its episteme identity; use E.17 or E.24.PUB for a current publication occurrence, form, or carrier, C.2.P for unresolved source-expression or source-to-use wording, and A.10 or G.6 only when evidence provenance is relied on | an in-life whole-reidentification question remains after the description is separated |
| Work plan or work occurrence | A.15.2, A.15.1 | exact planned or performed work facts leave a new-whole question; the plan or occurrence is not the whole by label |
| Module, component, or bearer allocation | The direct allocation or parthood pattern; A.6.M for unresolved module/interface wording; C.30, A.22 or C.30.ASV only for the corresponding claim | exact allocation and architecture facts defeat the existing-whole explanation |
| Metric, score, threshold, robustness, or quality claim | C.16, A.19; A.10 only for evidence use | the underlying characteristic facts, not the score or support record alone, defeat that explanation |
B.2.4:4.3 - Existing-Whole Explanation
Perform B.2’s ordinary existing-whole comparison before claiming whole reidentification. Materialize its optional ExistingWholeExplanationResult only when another use must inspect or cite the outcome.
Subject-pattern explanations that often stop B.2.4 include:
- better measurement or benchmark normalization;
- improved component capability;
- corrected function-like wording;
- a clearer method relation or method family selection;
- a new method description without corresponding in-life capability or work facts;
- better work coordination inside the same whole;
- module allocation repair;
- architecture-view or transformation-flow-structure repair;
- better evidence, measurement, or source currentness for an unchanged world-side claim.
If one of these explanations is sufficient, finish B.2.4 by retaining the existing whole and continue with the subject pattern.
B.2.4:4.4 - When B.2.4 Requires B.2
Use B.2 when the exact direct facts show that the existing whole cannot carry the current subject claim and an exact candidate new whole must be tested. Examples:
- a production cell has an exact capability envelope, obtaining coordination and functioning relations, a selected in-life transformation-flow structure, and external commitments that cannot be explained by individual machines or the old aggregate;
- a service platform has an obtaining functioning relation and external commitments that cannot be assigned to one service or module;
- exact coordination and work facts concerning a team, a toolchain, and the enacted Methods from a method family make a result-system candidate live; or
- a candidate episteme has exact constitution and explanatory-use facts that leave an episteme whole-reidentification question.
After the return, use B.2 for the existing-whole/new-whole comparison, its one exact candidate, and any optional record. B.2.4 adds no result record or evidence slice. The direct patterns still define and test the contributing facts, while evidence or measurement supports the associated claims.
B.2.4:5 - Archetypal Grounding (Worked Cases)
B.2.4:5.1 - Production Cell Capability
A milling machine, robot arm, fixture, and inspection station can remain a collection of assets even when a scheduling rule for their use is available. A new production-cell candidate becomes current only when exact capability, functioning, coordination, and transformation-flow facts cannot be explained by any single component or the old aggregate. Cell-level cycle time and tolerance measurements may support the claim; they do not create the candidate or those facts.
Use A.6.F for function-like wording, A.3.4 for transformations, E.18 for transformation-flow structure and C.30.TFS-REL for its bounded architecture use, A.15.1 for performed work, C.16 for cycle-time and tolerance characteristics, and B.2 only when the cell whole must be reidentified.
B.2.4:5.2 - CI/CD Capability
A team may have methods for coding, testing, and releasing. That does not by itself create a new whole. Use the direct Method and Work patterns for the method relations and performed release work.
B.2.4 becomes current only if exact capability, coordination, commitment, and work facts leave a result-holon question that the existing team or platform cannot explain. Evidence may support that claim; an automated delivery label or score does not decide the ontology.
B.2.4:5.3 - Theory Explains New Phenomena
A new theory may explain phenomena that the source portfolio did not explain. Use B.2.4 to bring the exact explanatory-use facts into B.2’s ordinary existing-whole comparison, while evidence separately supports or challenges the claim about that use. This does not assign an A.2.2 capability to the episteme. B.2.3 supplies the episteme-result specialization if the exact candidate is U.Episteme; C.2.1 defines its constitution; C.29 handles any mathematical-lens use.
B.2.4:5.4 - Bias-Annotation
| Bias risk | Failure | Mitigation |
|---|---|---|
| Capability as emergence | A new capability label or supporting report declares a new whole. | Recover the exact capability facts and direct pattern, separate their evidence, and perform B.2’s ordinary existing-whole comparison. |
| Function as part | A function block or functioning relation becomes physical or organizational parthood. | Separate functioning relation, bearer allocation, selected structure, and part-whole claims. |
| Method chain as whole | A sequence of methods or work stages is called a new holon. | Keep method, method description, work plan, and work occurrence with subject patterns. |
| Diagram as flow structure | A diagram or graph is treated as the in-life transformation-flow structure. | Use the mathematical, description, publication, and selected-structure patterns before B.2. |
| Metric jump as MHT | A benchmark, KPI, robustness, or threshold gain declares whole reidentification. | Use C.16, A.19, A.10, and B.2 existing-whole explanation before MHT. |
B.2.4:6 - Conformance Checklist
| Check | Requirement |
|---|---|
CC-B2.4-1 | B.2.4 is used only when exact capability, functioning, or selected in-life transformation-flow facts leave a B.2 whole-reidentification question after subject-pattern explanations are tested. |
CC-B2.4-2 | Ordinary capability, function, functioning, transformation, method, work, module, characteristic, evidence, and architecture claims return to subject patterns. |
CC-B2.4-3 | No generic U.Emergence, U.Function, U.MetaMethod, or capability-root kind is created. |
CC-B2.4-4 | Method, method description, work plan, and work occurrence remain separate. |
CC-B2.4-5 | Mathematical or publication descriptions of transformation-flow structure do not replace the in-life structure. |
CC-B2.4-6 | If B.2 remains current, it handles the one exact candidate new whole, complete recognition, whole comparison, and any optional record; B.2.4 introduces no result species. |
B.2.4:7 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Symptom | Repair |
|---|---|---|
| Capability by declaration | A leader names a new capability, but the exact capability facts remain component-level or unknown. | Use A.2.2 for the capability facts, C.16 for their measured characteristics, and A.10 for support; use B.2 only if the existing-whole explanation fails. |
| Function as part | A function block is treated as a physical or organizational part. | Use A.6.F for function-like wording, E.18 for transformation-flow structure and C.30.TFS-REL for its bounded architecture use, A.6.M for module wording, and C.30, A.22, or C.30.ASV for the current architecture, selected structure, or structural-view claim. |
| Method chain as whole | A sequence of methods is called a new holon. | Recover the exact method relation and any current work occurrence; use B.2 only when a result holon is current. |
| Diagram as flow structure | A diagram or graph is treated as the transformation-flow structure itself. | Use the applicable description, publication, mathematical-lens, or selected-structure pattern; use B.2.4 only after the selected structure is recovered and a whole-reidentification question remains. |
| Metric jump as whole | A KPI improves and MHT is declared. | Use C.16, A.10, and existing-whole explanation first. |
B.2.4:8 - Consequences
Positive consequences:
- Exact capability and functioning facts can make real whole reidentification current, while evidence bears only on the associated claims.
- Subject patterns remain visible, so local improvements are not overclaimed.
- Method, work, function, module, and architecture distinctions survive high-pressure capability language; each claim remains with its subject pattern.
Costs:
- Teams must do the subject-pattern test before using B.2.4.
- Many impressive capability claims will stay outside MHT.
- B.2.4 depends on B.2 for the whole-reidentification result and any durable record required by the receiving use.
B.2.4:9 - Rationale
Capabilities and functioning relations are often where a new-whole question first becomes visible. Their direct facts, not the availability of supporting evidence, determine whether the existing-whole explanation still works.
B.2.4 keeps this mixed situation disciplined. It does not rename the capability, functioning, transformation flow, method, work, allocation, measurement, or support as “meta-function”. It asks whether the exact direct facts defeat the existing-whole explanation and, only then, requires B.2 for the residual question.
B.2.4:10 - SoTA-Echoing
| Source line | Practical implication for this pattern |
|---|---|
| Capability and functioning approaches | An A.2.2 capability envelope states what its named System holder can do under conditions; it is not automatically a new whole. Evidence supports or challenges the claim about the envelope but does not create it. |
| Functional architecture and transformation-flow practice | Obtaining functioning relations and selected in-life flow structures can make a new-whole question live; descriptions and diagrams remain distinct from those facts. |
| Method and work ontology in FPF | Method, method description, work plan, and performed work occurrence must stay separate when capability evidence is interpreted. |
| TAME and agency-as-characteristic-space work | Agency-like evidence is multi-characteristic and thresholded by concern; B.2.4 does not create a binary agency kind. |
B.2.4:11 - Relations
- Specializes:
B.2for cases where exact capability, functioning, or selected in-life transformation-flow facts leave a whole-reidentification question after subject-pattern explanations are tested. - Uses:
B.2.Pwhen emergence-family or title-mnemonic wording hides the claim kind. - Coordinates with:
A.2.2,C.16,A.6.F,A.3.4,E.18,C.30.TFS-REL,A.15,A.3.1,A.3.2,A.15.2,A.15.1,A.6.M,C.30,A.22,C.30.ASV,C.29,A.10, and source-use patterns. - Contrasts with:
B.2.2for system-result MHT andB.2.3for episteme-result MHT.
B.2.4:End
B.2.5 - Supervisor-Subholon Feedback Relation
Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative
B.2.5:0 - Use This When
Use this pattern when a holon is supervised, regulated, steered, corrected, constrained, or coordinated through a two-sided feedback relation between one supervising acting system and one or more supervised holons. If the supervision is conditioned by a local system-role kind or assignment, recover that classification and exact assignment separately.
The first useful move is to recover the facts supporting the feedback claim:
Which holons are supervised?
Which admitted system supervises these holons for this feedback use, under which policy and during which time window, and which local supervisor system-role kind and exact assignment obtain when that classification matters?
What observation, report, signal, publication, or source relation carries state?
What influence, constraint, objective, mode, or work change returns?
Which rule and case facts couple that return to the observation for each supervised holon?
Which transformation, work, architecture, evidence, assurance, timing,
or causal claim is being made in addition to the relation?
What goes wrong if missed. A control diagram, policy note, dashboard, publication channel, or supervisor word starts carrying part-whole, agency, safety, assurance, timing, gate, or architecture claims that belong elsewhere.
What this buys. B.2.5 gives a readable compound claim: for each named holon, this system receives the stated observation and returns an influence coupled to it under the applicable rule. The observation, influence and coupling facts remain separately governed; the assertion can support a control description without introducing a fused feedback occurrence.
Not this pattern when.
- If the question is a control-structure view, use
C.30.LCA. - If the question is architecture or selected structure, use
C.30,A.22, andC.30.ASV. - If the question is reusable dynamics, timing, rate, or temporal validity, use
A.3.3andC.27. - If the question is causal use, use
C.28. - If the question is evidence, provenance, assurance, or a gate decision, use
A.10,G.6,B.3, orA.21respectively. UseA.20for its internal-constraint test in a transformation-flow structure; other constraint claims need their direct pattern. - If module or interface wording hides the exact claim, use
A.6.Mto recover it; use the direct pattern for an already precise allocation or commitment claim. - If the question is whole reidentification, use
B.2.
B.2.5:1 - Problem Frame
A supervisor-subholon feedback claim states observation or reporting, returned influence and their coupling for named participants in one use. It is a conjunction under A.6.RCD, expressed in a C.2.1 assertion. Each base relation retains its own participants, applicability and identity rule. A system-role kind or assignment may qualify the acting system when independently established.
Use B.2.5 for this compound description. A broader architecture, MHT, Work or evidence account may use it while retaining the direct rules for those additional claims.
B.2.5:2 - Problem
Without this pattern, three different structures collapse:
- Part-whole structure. Which holons are parts of which wholes.
- Supervisor-subholon feedback relation. Which admitted system supervises, what it observes, and what influence or constraint returns; add its system-role kind and assignment only when separately current.
- Description or representation structure. Which diagram, dashboard, report, model, publication, or control-view description represents the relation.
When these are confused, a functional layer is treated as a physical part, a publication is treated as an acting system, a diagram is treated as evidence, or a supervisor label is treated as a gate or assurance result.
B.2.5:3 - Forces
| Force | Tension |
|---|---|
| Recognizable feedback language vs kind precision | Engineers use feedback, control, supervision, and regulation language naturally; FPF needs the relation and neighboring claim kinds named. |
| Relation vs view | A supervisor-subholon relation may appear inside a control-structure view, but the view and relation are different objects. |
| Acting system vs episteme | A theory, model, standard, dashboard, or report used as a claim-bearing episteme remains distinct from the System that revises or uses it. |
| Closure vs stronger claims | A two-sided feedback relation can supply input to stability or assurance work, but does not certify those claims. |
| Medium visibility vs perfect communication | The relation needs observation or report and influence or constraint sides, including publication or medium limits when current. |
B.2.5:4 - Solution
State the feedback claim in one C.2.1 episteme about the named controller and supervised holons. A sufficient ordinary reading is: “For every drone in this set during the stated interval, controller C receives the stated observations and returns commands coupled to those observations under rule R.” Use A.6.RCD’s compound-claim branch; the description does not require a new relation kind or one independently reidentifiable feedback occurrence.
For a nonempty set H and each h in H, recover three propositions under their direct domain definitions:
- Observation: which state of h is observed or reported to the controller, through which obtaining observation, report, publication or source relation.
- Return: which influence from the controller reaches h, under the applicable command, constraint, objective, mode or Work predicate.
- Coupling: which rule applies to this observation and return, and which facts establish that this return depends on that observation under the rule.
The compound claim is true exactly when all three propositions hold for every member of H under common applicability: the same named use, participants, scope and temporal qualification. This is ordinary logical conjunction of those propositions, not a combination of probability scores or assurance results. Recover each direct definition and its applicable edition when the claim relies on it. A local use needs no separately published conjunction rule.
An optional note can retain the needed details:
SupervisorSubholonFeedbackClaim@Context: // claim-bearing episteme, not U.Relation
supervisingActingSystemRef: U.EntityRef resolving to one admitted U.System
supervisedHolonRefs: FinSet(U.HolonRef) // nonempty
useAndTemporalQualification:
pairClaims: // one for every supervised holon
supervisedHolonRef:
observationClaimAndBaseRelationRefs:
returnedInfluenceClaimAndBaseRelationRefs:
applicableCouplingRuleAndEdition:
couplingFacts:
supervisorSystemRoleKindRef?:
supervisorSystemRoleAssignmentRef?:
evidenceRefs?:
strongerClaimPatternRefs?:
Observation and influence references keep their own kinds; a report episteme, a signal occurrence and a source-use relation are not interchangeable occupants of one relation position. Evidence supports the assertion under A.10; its adequacy and the obtaining of the base facts remain separate questions. A local system-role kind and assignment are added only when they independently obtain and affect this use.
B.2.5:4.1 - Establish and qualify the conjunction
Co-present telemetry and commands are insufficient. For each pair, apply the coupling rule to the actual observation and return. An unrelated broadcast fails that condition; one-way reporting fails the two-sided predicate. If the rule is missing, return the missing governor. If the rule exists but a needed observation or dependency fact is unavailable, return missing information. Neither absence of proof alone nor an empty supervised set supports the affirmative assertion. A negative claim needs the rule’s non-obtaining test and facts that satisfy it.
Keep the base occurrences and their own extent and continuity rules. A communication break can make an interval-qualified feedback assertion fail without ending a supervisor assignment. Reconnection requires current observation, return and coupling facts. Apply a changed policy to the affected interval; adding a holon extends the asserted set only after its own pair is supported.
Reopen the dedicated relation-kind alternative only when a receiving use needs to identify a feedback occurrence independently across changes. That alternative must supply its obtaining, extent and continuity rules, including interruptions, under A.6.RCD and A.6.REL. A useful compound description can stop here.
B.2.5:4.2 - Part-Whole Boundary
A supervised holon may be part of a larger holon, but supervision and parthood are different relations. A controller, committee, platform-governance group, review board, or tool-mediated group can supervise when the exact acting entity is independently admitted as U.System; it may do so under an exact system-role assignment without being a physical part of the supervised holon. A method, policy, or review practice can structure the supervision work; it does not supervise by itself.
Use A.1 for holon recognition, A.14 for the exact mereological claim, and B.1 or C.13 for the applicable construction account. Use B.2.5 for the compound supervisor-subholon feedback claim.
B.2.5:4.3 - Acting-System Boundary
The supervising participant is an admitted acting system. When local classification matters, A.2 supplies the exact supervisor system-role kind and A.2.1 supplies the obtaining assignment; neither label nor assignment acts. Do not create U.TransformerRef or treat a publication, theory, dashboard, model, method description, or report as the acting system.
For acting-side externalization, use A.12. For transformation, use A.3.4. For Work, use A.15.1. For system-role kind and assignment, use A.2 and A.2.1.
B.2.5:4.4 - Control-Structure View Boundary
When feedback is drawn as planner, controller, observer, plant and supervisor structure, B.2.5 states the compound claim and C.30.LCA governs the control-structure view. The view can cite both the assertion and the independently obtaining base relations. Its arrows alone establish neither their obtaining nor the coupling.
B.2.5:4.5 - Neighboring Claim Boundary
B.2.5 does not certify stability, safety, assurance, evidence sufficiency, causal validity, gate passage, rate adequacy, or mathematical adequacy.
Use:
A.3.3for reusable dynamics or state-evolution claims;C.27for temporal and rate adequacy;C.28for causal-use claims;A.10andG.6for evidence and provenance;B.3for assurance;A.20for its internal-constraint test in a transformation-flow structure andA.21for gate decisions;C.29for mathematical-lens use.
B.2.5:5 - Archetypal Grounding (Worked Cases)
B.2.5:5.1 - Robotic Swarm
A fleet controller C supervises drone d1. In this illustrative protocol R1, each control tick requires a same-tick range report received by C and a returned command received by d1. The command is generated from that report: reduce speed when the reported obstacle distance is below 2 m; otherwise maintain speed. These protocol predicates govern reporting, command delivery and their coupling for this case; they do not establish sensor accuracy or safety.
| Case facts under R1 | Compound result |
|---|---|
At tick 10, C receives d1’s 1.2 m report, generates reduce speed from it under R1, and d1 receives that command. | All three conjuncts hold for {d1} at tick 10. |
| At tick 11, C receives telemetry, but the only delivered command is an unrelated scheduled broadcast. | The known command has no R1 coupling to that report; it does not satisfy this feedback predicate. |
| At tick 12, the report arrives but the complete tick trace shows no returned command. | The return conjunct fails. Reporting remains an independently supported fact. |
| At tick 13, the link breaks and the complete trace shows no same-tick report or return. | The claim covering every tick 10–13 fails under R1. A supervisor assignment may still continue under its own rule. |
| At tick 14, the link reconnects and a new report, R1-based command and delivery are established. | The tick-14 claim is supported from those new facts; the earlier interval does not become uninterrupted. |
If the tick-13 trace is unavailable, the corresponding conclusion is unresolved instead of negative. If R1 changes to R2, use R2’s actual coupling test for the new interval. Adding d2 requires d2’s own report, return and coupling facts before asserting feedback for {d1,d2}.
A C.30.LCA description consumes the report and command relation references plus the compound assertion. It need not invent a single feedback occurrence to draw the supported connection. Claims about convergence, delay tolerance, disturbance damping, evidence, assurance or safety use their subject patterns.
B.2.5:5.2 - Scientific Theory Revision
A theory is revised when labs publish findings and a research community reviews anomalies and accepted revisions.
B.2.5 can state feedback around review and revision when the reviewed object is independently admitted as a Holon and the report, returned revision influence and coupling rule are established. Otherwise retain the independently supported review or source-use claims. Recover the exact admitted System that performs the review or revision, whether it is a research community, standards body, lab, review board, or tool-mediated group; any local system-role kind and assignment are separate claims. The theory remains the reviewed or revised episteme.
For publication channels, journals, datasets, reports, and review records, keep each object’s identity distinct from its current publication or source-use relation; recover content, form, representation, or carrier only when the case depends on that distinction.
B.2.5:5.3 - Product Platform Policy
A product platform constrains component teams through interface rules and release gates. B.2.5 states the component reports, returned constraints and rule coupling those constraints to the reports for the admitted platform or governance system; a system-role kind or assignment is added only when separately current.
Work alignment uses A.15; a separate work-authority claim needs its own direct pattern. Gate passage uses A.21; A.6.M restores interface wording before the exact commitment claim returns to its direct pattern; architecture view uses C.30.LCA when the control structure is described.
B.2.5:5.4 - Bias-Annotation
| Bias | How B.2.5 prevents it |
|---|---|
| Supervisor relation mistaken for parthood or containing-whole identity | The supervisor relation is not a parthood claim; A.1 governs holon recognition, A.14 the exact mereological claim, and B.1 or C.13 the applicable construction account. |
| Feedback-as-proof bias | A closed feedback relation may supply input to separate stability, safety, assurance, or timing work, but does not certify those claims. |
| Description-as-relation bias | A diagram, dashboard, report, or control-view description does not establish the in-life feedback relation by itself. |
| Episteme-agency bias | Only an independently recognized Holon fills a supervised reference. A theory, standard, model, dashboard, or publication may instead be used on the source side under its own kind and relation; the supervising acting system must still be named, and any system-role assignment is separate. |
B.2.5:6 - Conformance Checklist
| Check | Requirement |
|---|---|
CC-B2.5-1 | A conforming use names supervised holons and the supervising acting system; it adds the local supervisor system-role kind and exact assignment only when each independently obtains. |
CC-B2.5-2 | A conforming use names the observation, report, or source side and the influence, constraint, or objective side. It also names the coupling rule, its case facts, common applicability, temporal qualification and evidence that changes the compound claim or its later use. |
CC-B2.5-3 | The assertion is the conjunction of observation, return and coupling for every member of a nonempty supervised set. It introduces no fused U.Relation occurrence; a mathematical loop needs its separate C.29 use. |
CC-B2.5-4 | No U.TransformerRef or U.InteractionRef is created. |
CC-B2.5-5 | Parthood, control-structure view, base publication and source-use relations, and the compound feedback assertion are kept separate. Each base occurrence keeps its own identity and extent rules. |
CC-B2.5-6 | Stability, safety, timing, causal, evidence, assurance, gate, and mathematical-lens claims use the patterns that define or test them. |
CC-B2.5-7 | Episteme examples name the acting systems that perform review, revision, publication, or use. |
B.2.5:7 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Symptom | Repair |
|---|---|---|
| Unspecified supervisor-subholon feedback | Subholons are said to be coordinated through supervisor-subholon feedback, but no supervising acting system, medium, or feedback relation is named. | Recover the supervised holons, actual supervising System, observation side and returned influence side. Record that claim only when the receiving use needs it; add a system-role kind or assignment only when independently current. |
| Functional layer as component | A planning or control layer is modeled as a physical part of the controlled holon. | Separate parthood from feedback relation; use C.30.LCA for the view. |
| Perfect communication | State access is assumed instant, complete, or lossless. | Name medium or publication limits; use C.27, A.3.3, or evidence-use patterns for timing and information claims. |
| Episteme acts | A theory, model, paper, dashboard, or standard senses, judges, plans, or adapts. | Recover each exact acting System through A.13 and let A.15.1 independently admit the dated revision Work. Add F.6 only when the account expressly consumes precise assignment-bound attribution through the same obtaining A.13 assignment; F.6 identifies neither assignment nor performer, and missing or failed F.6 leaves the Work intact. A short sentence may omit an unused assignment identifier. Name the Method or review practice structuring the Work when current, and any publication or source-use relation. This Work rule does not make assignment or system-role classification a condition of the supervisor-subholon feedback relation itself. |
| Relation certifies safety | The feedback relation is treated as evidence, assurance, gate, or safety result. | Keep the relation and use the pattern for the stronger claim. |
B.2.5:8 - Consequences
Positive consequences:
- Supervisor-subholon language stays useful without creating false acting objects or false part-whole claims.
- Control diagrams, publication channels, and feedback relations can be coordinated without being collapsed.
- Stability, safety, assurance, gate, timing, and evidence claims stay inspectable.
Costs:
- A compound feedback description is only the beginning of stronger analysis.
- Some control diagrams need qualification because their stronger claims remain unproven.
- Episteme examples require explicit acting systems for review and revision.
B.2.5:9 - Rationale
Supervisor-subholon feedback is a recurring relation in control, organization, architecture, and epistemic revision. It becomes precise only when separated from part-whole composition, control-structure views, publication and source-use relations, and stronger assurance claims.
The compound assertion supplies the present description use. A reusable feedback predicate or a dedicated relation kind is a further choice under A.6.RCD when a receiver needs it and the additional semantics are available. A mathematical loop remains a separately selected lens or structure.
B.2.5:10 - SoTA-Echoing — establish the feedback claimed for this interval
Practice question. What is enough to say that a named controller and holon participated in feedback during a specified interval? The selected line requires observation, returned influence and their rule-governed coupling. A serious cheaper alternative describes the intended controller, feedback channel and command channel in a functional control structure. That description can answer a design question before any operation occurs; it cannot alone settle an assertion about an actual interval.
Åström and Murray’s Feedback Systems, Chapter 1 summary supplies the selected control-theoretic line: feedback involves reciprocal influence, and sensing, computation and actuation form the basic control loop. The same source treats stability and useful closed-loop behavior as further design questions. Adapt reciprocal influence into the three propositions in §4, retaining each domain’s actual coupling rule. This supports a minimal descriptive assertion, not an import of continuous-time dynamics into organizational or episteme examples.
The STPA Handbook, MIT-STAMP-001, March 2018, Chapter 2, pp. 22–25 and 45–48 supplies the substantive control-structure comparator and failure analysis. It distinguishes a functional structure of possible information flow from physical structure, and examines missing, delayed or incorrectly used feedback. Adopt those distinctions for the view boundary in §4.4 and the interruption cases in §5.1. Reject using the diagram alone as an actual-interval witness; that shortcut is not a claim of the handbook. The handbook remains a source for analysis of control and unsafe scenarios, not a certificate that B.2.5’s assertion establishes safety.
The difference is visible at ticks 10–14 in §5.1. The intended diagram can stay unchanged while a delivered broadcast is unrelated to the observation, a command is absent, or the link is broken. Testing the three propositions distinguishes those cases and treats an unavailable trace as unresolved. The comparison therefore governs §4.1’s coupling and absence tests and CC-B2.5-2–3, while leaving C.30.LCA to describe the structure.
For an operational claim, both approaches can reuse the same controller rule and available trace; checking the relevant observation/return pair adds local work but closes a question the diagram leaves open. For an intended design, retain the cheaper structural description. A full dynamics model or STPA analysis costs more and answers stronger questions; it is needed only when those questions are selected. Reopen when the coupling rule, interval or member set changes, or a receiving use needs to reidentify one feedback occurrence across interruptions. These sources do not supply that new occurrence’s identity rule or establish the FPF Holon classification of an organizational example.
B.2.5:11 - Relations
- Builds on:
A.6.RCDfor the compound claim andC.2.1for its assertion;A.1,A.2.1,A.12,A.3.4,A.15.1,B.1,A.14, andC.13. - Coordinates with:
B.2when exact feedback facts leave a whole-reidentification question; evidence separately supports or challenges the claims about those facts. - Coordinates with:
C.30.LCAfor control-structure view,A.3.3for dynamics,C.27for temporal and rate adequacy,C.28for causal use,A.10andG.6for evidence,B.3for assurance,A.20for its internal-constraint test in a transformation-flow structure,A.21for gate decisions,A.6.Mfor module-interface wording, andC.29for mathematical-lens use. - Uses:
B.2.Pwhen emergence or MHT wording hides the claim kind, including feedback or supervision invoked as an emergence claim. Ordinary feedback wording follows F.19/E.10 restoration and its direct subject pattern.
B.2.5:End
B.3 - Is This Claim Supported for This Use? — Trust and Assurance Calculus
Type: Foundational (B) Status: Stable Normativity: Normative when an FPF use makes an assurance claim about one exact target claim.
Plain-English headline. B.3 helps a practitioner state what an assurance claim is about, which argument and results support it, what use they support, what remains unsupported, and what would reopen the conclusion. It does not turn a badge, evidence item, calculation, record, publication, status, or decision into assurance by appearance.
Use this when. Use B.3 when an actual named assurance claim is current: for example, a claim that an exact model claim is credible for one decision, or that an exact safety claim is adequately supported for one release use.
First useful move. Write the target claim and the assurance use in one sentence. Then ask which direct results and argument make that use supportable. If there is no assurance claim, stop and use the pattern that defines or tests the actual evidence, status, gate, permission, safety, release, work, or domain-result claim.
What goes wrong if missed. A visible label or a convenient score starts raising trust without an exact target, argument, basis, limitation, and use. At the other extreme, a modest assurance question is forced through a universal score and a large record whose fields do not affect the decision.
What this buys. The user gets the smallest assurance result that changes the named use, with enough basis and limits to inspect or reopen it. Domain-specific characteristics and calculations remain usable without pretending that unlike measures share one scale.
Not this pattern when. Stay with A.2.4 for the classification of an episteme as evidence, A.10 and G.6 for source recovery and bounded reliance, G.11 for currentness, F.10 for a status value and its use, A.21 for a gate decision, and the direct domain pattern for safety, permission, access, responsibility, release, compliance, or controlled action. Consequence alone does not create an assurance claim. A direct domain rule may require one, but the claim must be stated before B.3 is applied.
First output. Produce either one bounded AssuranceResult claim or a plain statement that the available argument does not support the attempted assurance use. Do not create a B.3 result merely to record that another pattern is relevant.
B.3:1 - Problem frame
Assurance concerns a claim, not the world-side subject in isolation. Begin with one exact target claim, identified by its C.2.1 episteme or ClaimAddress as specified in §4.2, and one named use of an assurance conclusion. The claim’s EntityOfConcern remains the system, episteme, method, work occurrence, relation occurrence, or other exact subject identified by its direct pattern.
For example:
- a battery-pack safety fact and its direct test result remain under their safety, measurement, and test patterns;
- the episteme that states the safety claim remains under C.2.1;
- an assurance result states whether a named argument carries that claim for a named release use;
- a later gate, permission, or release decision remains a separate result.
The word calculus here means a disciplined way to select, combine, and interpret the inputs that the assurance argument actually consumes. B.3 defines no universal arithmetic across systems and epistemes.
B.3:2 - Problem
Five failures recur:
- Assurance by appearance. A badge, dashboard, attestation, card, status, or publication is treated as the assurance conclusion.
- One scale for unlike properties. Formality, reliability, coverage, congruence, and evidence quality are placed in one tuple even though they have different bearers and scales.
- Unsupported aggregation.
min, an average, a penalty, or another fold is called conservative without a dependency model and calibrated quantities. - Process burden by default. Every result is required to name dated Work, Method, assignment, bindings, and a reusable record even when the claim’s own basis closes the use.
- Domain obligations absorbed into assurance. Safety, rights, access, responsibility, contest, redress, status, or controlled-action rules are replaced by a generic assurance record.
B.3:3 - Forces
| Force | Tension |
|---|---|
| Small result vs inspectability | A practitioner needs a quick result, while a consequential or reusable claim may need a replayable argument. |
| Shared discipline vs domain meaning | Assurance needs common boundaries, while each characteristic and aggregation rule gets its meaning from its subject and domain. |
| Conservatism vs useful synthesis | The result must avoid overstatement without discarding justified combination or independent lines of support. |
| Formal clarity vs warranted belief | Formalization can improve inspectability and checking while leaving truth or empirical adequacy unchanged. |
| Current use vs change over time | An assurance conclusion must be usable now and reopen when its basis, scope, or conditions change. |
B.3:4 - Solution
B.3:4.1 - Start from one assurance question
State these three things before choosing measures or a record:
- the exact target claim;
- the named assurance use;
- the conclusion that must be supported, narrowed, or refused for that use.
Keep the following objects separate whenever they are current:
- world-side facts and direct domain results;
- the target-claim episteme;
- evidence-use relations and source-provenance paths;
- any assessment Work and the System that performed it;
- formal, empirical, causal, measurement, conformance, or comparison input results;
- the assurance-result episteme;
- calculation traces, witnesses, and an optional note or publication that cites the result;
- later reliance, status use, gate, permission, release, or action.
Evidence can support or challenge a claim. It does not make the target fact true. A favorable assurance result does not pass a gate, grant permission, or prove that later work relied on it.
B.3:4.2 - Use the smallest sufficient result
The compact result contains only facts every B.3 use needs:
AssuranceResult:
targetClaimRef:
assuranceUse:
basisRefs:
disposition: supported-for-use | narrowed | abstain | evidence-needed | reopen | blocked
limitationsAndNotCarried:
reopenCondition:
targetClaimRef identifies the exact C.2.1 episteme or one exact C.2.1 ClaimAddress when the use concerns one addressed claim inside a larger episteme. basisRefs cite the direct results, evidence-use relations, provenance paths, argument claims, or domain rules actually used. A compact result is complete when these fields decide the named use and another person can see why the stronger use is not carried.
Add a claim scope, condition set, interpretation scheme, audience, or time window only when changing it could change the conclusion. Keep design and run conclusions separate whenever their inputs or conditions differ.
Add assessment Work, performer, Method, application bindings, witnesses, or a reusable record only when the receiving use depends on competence, conflict of interest, timing, reproducibility, contest, redress, or later replay. These identities are never mandatory merely because B.3 is used.
An optional assurance note may cite the result and its basis. B.3 does not define a reusable RelianceSafetyCase, a safety authority, or a general contest-and-redress profile. If such a reusable object is needed, it requires its own problem, ontology, sources, minimum output, and direct domain boundaries.
B.3:4.3 - Name each characteristic by its bearer and scale
Include a characteristic result only when the assurance argument consumes it. State:
AssuranceCharacteristicResult:
bearerRef:
characteristic:
scaleAndUnit:
valueOrInterval:
interpretationForThisUse:
basisRef:
One characteristic name must not silently change meaning between subjects. System reliability, replication quality, evidential support, proof inspectability, and relation congruence are different characteristics even when a local source labels several of them R or CL.
The legacy letters F, G, R, and CL may appear inside a declared local scheme, but B.3 assigns them no universal cross-domain meaning:
- Formality or inspectability. Formal structure can make assumptions and inference steps easier to check. It raises assurance only when the named argument explains which uncertainty or verification need it closes. Making a wrong model proof-grade does not improve truth or empirical adequacy.
- Claim scope.
U.ClaimScopestays an A.2.6 value. It is not a quality coordinate. Widening or narrowing scope changes the claim and its applicable use under the declared scope rules. - Reliability-like characteristics. Use the exact domain definition, bearer, population or trials, conditions, scale, unit, and qualification window. A system reliability measure and an evidence-quality judgment are not interchangeable.
- Relation congruence. Characterize one exact mapping, calibration, interface, or other relation occurrence only under a declared scale and interpretation. The value neither changes the participants nor supplies a universal penalty.
Never average ordinal values. Do not subtract an ordinal value from a ratio quantity. Thresholds and order comparisons are valid only under the scale that defines them.
B.3:4.4 - Aggregate only under an applicable model
B.3 supplies no default fold. When the assurance argument combines quantitative or ordered inputs, cite:
- the exact result claims being combined;
- the dependency or alternative-path structure;
- the domain aggregation rule or model;
- independence, dependence, calibration, and unit assumptions;
- the calculation or ordered comparison;
- the rival rule that would matter if an assumption fails.
Use min only when the cited domain rule makes the weakest input a lower bound or bottleneck for the exact quantity. It is not universally conservative. If no applicable aggregation rule is available, report the inputs separately and return a bounded, non-positive, or unresolved disposition. Do not manufacture one score to make the result look complete.
Several independent evidence lines may strengthen an argument only through the rule that states how their dependence and coverage are handled. Claim-scope intersection or union follows A.2.6 and the relevant evidence model; it is not an assurance arithmetic shortcut.
B.3:4.5 - Choose one of three proof paths
Compact path. Use the six-field result in 4.2. Stop when it decides the named use.
Calculated or model-bearing path. Add the characteristic results, dependency structure, assumptions, aggregation rule, rival, calculation trace, and sensitivity or failure condition actually used.
Replay path. Add Work, performer, Method, application bindings, witnesses, and a reusable note only when those identities change the named assurance use. For any assessment Work, use A.13 to identify the actual performer and A.15.1 to admit the dated occurrence independently. Add F.6 only if the replay must also say exactly under which assignment the Work was performed. The Work, performer, Method, optional assignment check, result, witness, note, and publication remain separate.
Do not select the replay path merely because the use is important. Importance may make more basis necessary, but every added field must change inspectability, contestability, or the decision.
B.3:4.6 - Keep visible authority outside the result
A badge, score, dashboard tile, credential display, provenance mark, model card, datasheet, data card, assurance document, attestation, generated confidence phrase, or publication form can be a cue, source, evidence item, or representation. It contributes to assurance only through an exact claim and basis relation used by the argument.
If the visible item only reports a status, gate decision, permission, warning, or source location, use its direct pattern and produce no B.3 result. If an assurance claim is current, cite the item only for the property it actually establishes. A valid signature or provenance chain can establish origin and integrity without establishing safety, truth, compliance, or readiness.
B.3:4.7 - Leave domain obligations with their direct patterns
B.3 evaluates an assurance claim. It does not define safety duties, access rules, responsibility, affected-party disclosure, contest, redress, people or team status, resource allocation, release authority, or controlled action. Cite each applicable direct rule as a premise or limitation.
When a direct domain rule says a consequential use requires an assurance claim, state that claim and then apply B.3. When the direct rule requires a decision, permission, review, contest route, or redress relation instead, use that result directly. A display that affects behavior does not by itself open B.3.
B.3:4.8 - Preserve time, currentness, and design/run distinctions
State the exact window only when time changes the assurance conclusion. Monitoring, drift, incidents, evidence refresh, version change, policy change, gate change, or a newly discovered defeater can narrow, reopen, or withdraw a result while the target fact and target-claim identity remain unchanged.
Design evidence and run evidence may support different claims. Produce separate results when target use, conditions, scope, or evidence window differs; compare them instead of merging them into one score.
B.3:4.9 - Keep causal-use and method-structure branches direct
When an assurance argument depends on a causal-use claim, consume the exact C.28 result and its stated supported and unsupported uses. B.3 does not re-run causal identification. An unsupported causal-use result narrows, blocks, or leaves the assurance claim unresolved; it does not become a low universal reliability coordinate.
When Method composition, fallback, selection or family organization matters to the assurance argument, first use B.1.5, G.5 or the direct predicate for the relied-on fact. Use A.22 only when a separately selected organization itself changes the assurance question; then recover its selection basis and all four identity discriminators. MethodRelationStructure is a local designator for that selected structure, not a universal kind or a required record for every composition claim.
B.3:4.10 - Use Working-Model declarations only for what they state
An E.14 Working-Model assertion may contribute its declared validation posture and grounding links. A postulate still needs the empirical basis required by the current assurance use; an inferential claim needs its reasoning basis; an axiomatic or constructive claim needs the exact construction and identity basis it relies on. The declaration, grounding link, assessment Work, assurance result, and publication remain different objects.
B.3:5 - Proof obligations
B.3:5.1 - Common obligations
Every positive or narrowed B.3 result:
- identifies the exact target claim and named assurance use;
- cites only basis results and relations that actually bear on that use;
- states assumptions, limitations, and unsupported stronger uses;
- keeps target fact, claim, evidence, assessment, result, record, publication, and later use distinct;
- names a reopen condition;
- uses the direct domain rule for every safety, permission, access, status, release, responsibility, or controlled-action premise;
- avoids aggregation unless its model and assumptions are explicit.
B.3:5.2 - Additional obligations for a calculated result
A calculated result also names every bearer, characteristic, scale, unit, dependency, calibrated mapping, aggregation rule, and calculation. It shows at least one assumption whose failure changes the result. If a rival rule is plausible at comparable effort, show why the selected rule fits the declared dependency structure.
B.3:5.3 - Additional obligations for replay
A replayable result adds only the Work and performance facts needed by the receiving use. Follow the §4.5 replay route for each assessment Work. Add its Method, application binding, witness, timing fact, or separate F.6 assignment check only when competence, independence, reproducibility, contest, or redress actually depends on that fact. No record field stands in for an obtaining relation.
B.3:6 - Worked cases
B.3:6.1 - Fully calculated case: two necessary independent conditions
Target claim: “The protection function succeeds on a demand.” Assurance use: a bounded reliability argument for a named design decision.
The domain model says that both independently tested conditions must succeed: sensor detection and actuator response. Each has estimated probability 0.9 under the same stated demand class and qualification window. Under the declared independence assumption, the joint probability is:
0.9 × 0.9 = 0.81
Using min(0.9, 0.9) = 0.9 would overstate this conjunction. If the conditions are dependent, even the product is not justified; the result must use the applicable conditional model or remain unresolved. The B.3 result therefore cites the two domain results, the series dependency structure, independence basis, product calculation, 0.81 conclusion, limitations, and the observation that reopens the independence assumption.
What changes in practice: the design decision is evaluated against 0.81, not a falsely “conservative” 0.9. No universal B.3 reliability formula is created.
B.3:6.2 - Routed-away case: dashboard status
Starting sentence: “The dashboard approves launch.”
The dashboard is a publication face. Suppose it displays GateDecision GD-17, which records that a named gate passed for release candidate R. The repaired sentence is: “The dashboard shows GateDecision GD-17 for release candidate R; the decision, not the display, records that the gate passed.”
Use A.21 and the release or permission pattern that consumes the gate decision. No assurance claim is present, so B.3 stops. If the dashboard does not resolve an exact gate decision, it is only a cue and launch approval remains unresolved.
B.3:6.3 - Episteme credibility with a compact result
Target claim: “Model edition M predicts response Y within the declared operating region.” Assurance use: whether an engineer may use that prediction as one input to a reversible design comparison.
The engineer cites the exact model claim, its empirical-validation result, A.2.4 first-use classification and the direct support relation actually used, the A.10 provenance path, the operating region, and the expiry condition. No combination of unlike characteristics is needed. The compact disposition is supported-for-use, limited to the reversible comparison; release, safety, and operation are expressly not carried. No dated assessment Work or reusable record is added because the use does not depend on who performed the already cited validation.
B.3:6.4 - Order-sensitive Method case
An assurance argument relies on a manufacturing sequence whose result changes when two steps are reversed. Recover the B.1.5 composition, order and join conditions and any actual A.15.1 Work the argument consumes. Those direct results may answer the assurance question. Use A.22 only if a separately selected organization contributes another needed premise; then identify its constituents, obtaining relations, applied constraints and use frame. The assurance result cites only the results and structure it actually relies on.
B.3:6.5 - Bias annotation
| Risk | Countermeasure |
|---|---|
| Formal prestige | Ask what uncertainty or verification need the formalization closes. |
| One-number preference | Keep unlike characteristics separate unless an applicable model combines them. |
| Visible-authority bias | Resolve the exact claim and property established by the artifact. |
| Record completion bias | Add only fields the named use consumes. |
| Consequence inflation | Use direct domain rules; consequence alone creates no assurance claim. |
B.3:7 - Conformance checklist
| ID | Requirement |
|---|---|
CC-B3-1 | One exact target claim and one named assurance use are stated before measures or records are selected. |
CC-B3-2 | The compact result contains target, use, basis, disposition, limits, and reopen condition; optional fields appear only when they change the conclusion or its replay. |
CC-B3-3 | Every characteristic has one bearer, property, scale and unit where applicable, interpretation, and basis. |
CC-B3-4 | Formality is not treated as monotone truth, empirical adequacy, or warrant. |
CC-B3-5 | Aggregation cites the domain model, dependencies, assumptions, units, calculation, and relevant rival; no default min, mean, penalty, or ordinal arithmetic is used. |
CC-B3-6 | Design and run results remain separate when their conditions or evidence differ. |
CC-B3-7 | Target fact, target claim, evidence use, assessment Work, input results, assurance result, witness, note, publication, and later reliance or decision remain recoverable separately. |
CC-B3-8 | A label, dashboard, card, provenance mark, attestation, or publication contributes only the exact property established through a cited relation. |
CC-B3-9 | Safety, rights, access, responsibility, contest, redress, status, permission, release, and controlled action remain with their direct patterns. |
CC-B3-10 | A causal-use premise cites the exact C.28 result. A Method premise cites its direct composition, selection or other result; add an A.22 structure only when independently selected organization changes the assurance question, with all four identity discriminators recoverable. |
CC-B3-11 | Work, performer, Method, bindings, witnesses, reusable notes, and an optional F.6 assignment check are added only for an actual replay, competence, independence, timing, contest, or redress need. Every Work follows the §4.5 A.13 then independent A.15.1 route. |
CC-B3-12 | A positive result states the unsupported stronger use and exact reopen condition. |
B.3:8 - Common anti-patterns and repairs
| Anti-pattern | Why it fails | Repair |
|---|---|---|
| Universal weakest-link formula | min can be an upper bound for a conjunction and can ignore alternatives or dependence. | Use the exact dependency model and domain rule; otherwise report inputs separately. |
| Ordinal penalty subtraction | An ordinal label is subtracted from a probability or ratio quantity. | Use a calibrated mapping to the same quantity when one exists, or keep the values separate. |
| Formality raises assurance | A more formal wrong model receives a better result. | State the inspectability gain and the uncertainty it closes; keep truth and empirical adequacy separate. |
| Same letter, different property | R names system reliability in one row and evidence quality in another. | Give each characteristic its own bearer and definition. |
| Safety-case inflation | A warning, access value, or consequential display triggers a generic B.3 package. | Use the direct domain pattern; apply B.3 only to an actual assurance claim. |
| Evidence creates truth | New evidence is said to make the target fact obtain. | Revise the warrant or disposition unless the world-side facts changed. |
| Assessment-record collapse | A checklist, trace, witness, or note is treated as the assessment Work or result. | Identify each object separately and add only what the use consumes. |
| Design/run chimera | Blueprint evidence and runtime observations are merged into one score. | Produce separate results and compare them. |
B.3:9 - Consequences
Benefits
- Assurance remains explicit without forcing one cross-domain score.
- A small local claim can stop after six fields.
- Calculations become more trustworthy because assumptions and dependency structure are visible.
- Domain safety, access, responsibility, status, and decision rules retain their own meaning.
- Visible artifacts can contribute useful provenance or evidence without becoming authority.
Trade-offs
- B.3 supplies no convenient universal number. A project must use the domain model that gives its inputs meaning.
- Some assurance questions remain unresolved until a dependency model, calibrated mapping, or direct domain requirement is supplied.
- Reusable replay records cost more than a compact result and therefore require an actual receiver.
B.3:10 - Rationale
Assurance-case practice supports explicit claims, arguments, evidence, and maintenance. Reliability engineering supports calculations tied to dependency structure and assumptions. Neither supports one universal F-G-R-CL score across unlike subjects. B.3 therefore standardizes the boundaries and the minimum result while leaving characteristics and aggregation with the exact models that define them.
B.3:10.1 - Decision-bearing SoTA account
| Practical question | Exact current source | Adopt, adapt, or reject in B.3 | Reopen condition |
|---|---|---|---|
| What makes an assurance case inspectable? | ISO/IEC/IEEE 15026-2:2022, edition 2 specifies assurance-case structure and maintenance. The GSN Community Standard v3 gives current engineering-argument notation and guidance. | Adopt explicit claim, argument, evidence, context, defeater, and maintenance structure. Adapt it to the compact and replay paths. Reject document or diagram appearance as assurance, approval, or permission. This decision shapes 4.1, 4.2, 5, and the dashboard case. | A successor changes the required claim-argument-evidence relation or validated use shows that a compact field is missing or redundant. |
| How may reliability-like inputs be combined? | NASA’s Fault Tree Handbook with Aerospace Applications, v1.1, chapter 6, derives AND-event probability from conditional probability and uses a product only under independence. | Adopt dependency- and assumption-specific calculation. Reject universal min and any claim that it is always conservative. This decision shapes 4.4 and worked case 6.1. | A direct domain model with different validated dependence semantics applies to the current claim. |
| Can one trustworthiness tuple compare unlike AI or system properties? | NIST AI Risk Management Framework 1.0 treats trustworthiness characteristics as context- and use-dependent and recognizes trade-offs and domain metrics. | Adopt named characteristics and use-specific thresholds. Reject same-letter cross-domain comparability and monotone formality. This decision shapes 4.3. | A validated common measurement model supplies shared bearers, scales, units, and interpretation for the exact properties being compared. |
| What can provenance and attestation establish? | C2PA Technical Specification 2.4 distinguishes provenance validity from value judgments. in-toto Attestation Framework 1.2 defines authenticated metadata about software artifacts. | Adopt exact subject, source, binding, and verification claims. Reject a valid credential, manifest, attestation, or display as automatic truth, safety, compliance, readiness, or release. This decision shapes 4.6 and case 6.2. | A successor specification changes the property warranted by the artifact or a direct domain rule makes that property sufficient for the named use. |
Older assurance-case editions and generic weakest-link slogans are lineage, not decision authority. Popularity, formal appearance, and publication recency do not establish the selected architecture.
B.3:11 - Relations
- Builds on:
C.2.1for target and assurance-result epistemes;A.2.4for exact evidence-use classification;A.10andG.6for source-provenance paths and bounded reliance;A.2.6for ClaimScope;C.16andC.16.Qfor characteristic and scale discipline; and the direct domain patterns for every input result. - Coordinates with:
A.15.1andA.6.1only when assessment Work and applications matter;G.11for currentness;F.10for status;A.21for gates; permission, commitment, release, access, responsibility, contest, redress, safety, and controlled-action patterns for their own results; andE.17,E.24.PUB, andC.29for publication and representation. - Coordinates with:
C.28for causal-use results;B.1.5,G.5or the direct pattern for the relied-on Method fact;A.22only for an independently selected organization needed by the assurance argument. - Used by: a pattern or project decision that consumes one exact assurance result. The consumer still applies its own decision, permission, gate, status, or work rule.
B.3:11a - Quantum-like claims
Quantum-like wording does not require assurance by itself. If the wording only prevents a local representation mistake, keep the note with C.26 and ordinary evidence. Apply B.3 only when an actual assurance claim about that exact quantum-like result and use is current. A comparative superiority claim must name the rival model, baseline, claimed mechanism, scope, evidence, and loss. Mathematical novelty or prestige supplies no assurance.
B.3:11b - Mathematical-lens use
When a C.29 mathematical-lens result is an input to an assurance claim, cite the exact lens-result claim, its interpretation and limits, the evidence-use and provenance relations relied on, and the named assurance use. Mathematical elegance or a structure-preserving mapping does not raise assurance by itself. Measurement construction and comparability remain with C.16.
B.3:End
B.3.3 — Assurance Subtypes & Levels
B.3.3:1 - Problem Frame
Use this when. A team must decide whether the available support is enough for a particular claim and receiving use, or what a published assurance level permits a recipient to conclude. Start with that claim, use, relevant conditions, and the warrant the conclusion needs.
A performance test, a proof and a terminology comparison answer different questions. Treating their presence as a maturity recipe can approve a poorly supported performance claim while demanding an irrelevant proof from a well-supported empirical result.
Practical gain. Choose the assurance contribution that can change the receiving judgement, and retain a sufficient qualified result without purchasing evidence merely to raise its label.
Ordinary boundary. A source locator, permission, status report or direct domain result that makes no assurance claim needs no B.3.3 classification. An ordinary assurance judgement can use B.3’s compact result without constructing a level scheme. A domain’s required proof, study or assurance profile applies when its actual claim and use require it.
B.3.3:2 - Problem
How can a recipient distinguish relevant conceptual, logical and empirical support without mistaking a link, evidence type, score or maturity label for an argument that the relied-on claim is adequately supported?
The tension is between comparable reporting and unlike assurance questions. Repeatable criteria help a shared use; a universal ladder hides differences in claim scope, consequences, assumptions and admissible evidence. Formal precision helps inspect an inference, but cannot compensate for an inapplicable premise.
B.3.3:3 - Solution
Use B.3 to identify the target claim and receiving assurance use. Determine which uncertainty or possible failure matters to that use, then examine the support that bears on it. State the supported or narrowed conclusion and the limitations that change reliance. A result need not carry an AssuranceLevel.
B.3.3:3.1 - Assurance subtypes answer different questions
| Subtype | Code | Question answered | Contribution and boundary |
|---|---|---|---|
| Concept-Bridge Assurance | CBA | Do the load-bearing terms and participants correspond across the descriptions being used? | Compare the relevant meanings, referents and conditions through B.5.3 when movement across vocabularies can change the argument. A discovered or repaired mismatch can change the assurance conclusion. Performing a comparison does not itself improve a relation’s congruence. |
| Verification Assurance | VA | Does the claimed consequence follow under the stated specification and assumptions? | Inspect the proof, logical argument or applicable construction. The result supports that consequence under those premises; it does not establish that a running system satisfies its environmental assumptions. |
| Validation Assurance | LA | Does the empirical basis support the claimed performance in the receiving conditions? | Examine relevance, coverage, measurement quality, limitations and contrary results. A simulation supports a claim about its modelled conditions; transfer to an actual system needs the applicable model-to-world warrant. |
Select the contributions needed by the claim, rather than demanding all three types for every judgement. A mathematical consequence may need a proof and no field trial. An engineering performance claim may have sufficient empirical support without an additional formal proof. A safety-related claim needs the actual protective argument and required evidence; neither FV ≥ threshold nor EV > 0 establishes that adequacy by itself.
Terms such as FV, EV or CL can be used only with the bearer, scale and interpretation the receiving argument consumes, as in B.3. A field called verifiedBy or validatedBy identifies a support relation to inspect, not a positive judgement by its mere presence.
B.3.3:3.2 - Use a level only through its justified profile
A domain may define an assurance profile or ordered levels when a recurring receiving decision benefits from that comparison. Its definition states the claim class and use, relevant conditions, meaning of each level, evidence rules, threshold basis and reconsideration conditions. Keep the measure and its scale explicit where a threshold is used. Establish the ordering from these meanings; the numerals in L0–L2 supply no ordering of trust across unlike uses.
Publish AssuranceLevel only with the applicable profile and a result showing why the target meets its criteria. The legacy names Unsubstantiated, Substantiated and Axiomatic do not supply default criteria. In particular, an axiomatic or constructive justification concerns a particular consequence or construction, not a universally higher assurance state than empirical support. A conjecture’s origin in abduction likewise does not assign it L0.
Examine whether a demanded threshold or evidence requirement protects the relevant quantity well enough to justify its cost, delay and displaced work. Keep that judgement distinct from the conditions presently binding the action. A recommendation to amend a requirement does not change it or confer amendment authority.
For a one-off receiving use, stop with the sufficient qualified assurance result. Do not create a profile, fill unused level fields or explain the omission of a level solely to complete this pattern.
B.3.3:3.3 - Preserve scope and inspect the actual grounding
Keep a design-time MethodDescription claim separate from a claim about performed Work or its Trace. Cite evidence with the appropriate conditions and scope. Evidence for a parent claim covers a child claim only through an argument establishing that coverage; a declaration of inheritance is insufficient.
State structural claims as readable Working-Model relations. When a publication choice or current requirement elects B.3.5’s CT2R-LOG profile, follow its relation-specific grounding: structural parthood uses the applicable C.13 sum or slice construction trace; collection belonging uses the collection’s set trace. These elected branches declare validationMode=axiomatic. Other permitted relation claims retain their applicable logical or empirical support. A level label alone does not elect this profile.
A grounding account and the author’s validationMode are inputs to inspect. Neither creates the relation, makes an empirical premise true, nor decides its currentness. Assurance publications remain downstream of the Working-Model surface under E.14.
B.3.3:3.4 - Worked case: a useful empirical result and an irrelevant fresh test
A team is deciding whether a converter can be used for non-safety-critical measurements within a declared temperature and input range. In this example, the receiving task’s justified tolerance is 2%. Calibration results covering that range, an adequate measurement-error account and applicable operating observations support error below that tolerance. The team can return “supported for this measurement use within the stated range,” with its actual limitations. A formal proof of unrelated program properties is unnecessary.
Now replace that basis with a newly passed boot test and a glossary mapping. These establish startup behaviour and the intended term correspondences, not measurement accuracy. The same requested measurement use remains unsupported. Neither fresh evidence nor one link of each required type repairs the missing performance basis.
If the recipient instead needs a mathematical invariant, inspect the proof under its assumptions. If the application introduces a protective function or a different operating range, reopen the affected assurance question under its own threshold and evidence rules. The earlier limited result remains an account of what it supported.
B.3.3:4 - Conformance Checklist
A Target of Assurance (ToA) denotes the claim being assessed for the named use, not an undifferentiated score for its whole system.
- CC-B3.3.1 (Relevant support): A positive assurance conclusion MUST identify the relied-on claim and use and explain how the cited basis supports it. A
verifiedByorvalidatedBylink alone is insufficient. - CC-B3.3.2 (Needed correspondence): Where differing terms or participants can change the argument, the assessor MUST resolve the load-bearing correspondence through the applicable bridge. Other judgements have no general term-mapping prerequisite.
- CC-B3.3.3 (Qualified levels and thresholds): A published level MUST have an applicable profile, interpreted criteria and a supported assignment. Formal, empirical and constructive evidence requirements MUST follow the specific claim and receiving use. A generic score threshold or positive validation score cannot substitute for the required protective argument.
- CC-B3.3.4 (Bridge scope): A required bridge MUST cover the differences on which the conclusion depends. It SHALL NOT demand mapping every mechanism term to FPF as the price of an otherwise sufficient ordinary judgement.
- CC-B3.3.5 (Scope separation): Design-time and run-time assurance claims MUST retain their distinct subjects, evidence and conditions. A design result SHALL NOT be published as evidence that the corresponding Work performed successfully.
- CC-B3.3.6 (CT2R-LOG grounding): When B.3.5’s profile is elected, the structural and collection branches MUST retain their distinct current construction traces and declared modes. A level assignment SHALL NOT replace the required grounding or impose the profile on unrelated claims.
- CC-B3.3.7 (Downward-only dependence): Assurance publications or records SHALL NOT impose vocabulary or layout back onto the Working-Model surface.
B.3.3:5 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Failure in use | Repair |
|---|---|---|
| Tested but referring to different things | Requirements and architecture use “Sensor” for different participants; the test concerns only one. | Resolve that correspondence and re-examine affected claims; more test links do not fix it. |
| Perfect blueprint, unsupported operation | A proof assumes conditions that the actual system has not been shown to meet. | Obtain or use the needed empirical and assumption evidence for the actual claim, or narrow the conclusion. |
| Maturity by receipt | A fresh smoke test and a term mapping receive a positive performance label. | Judge the support for the requested performance, not the receipt count or type combination. |
| Proof as an admission toll | Sufficient empirical support is rejected because an unrelated formal proof is absent. | Apply the receiving claim’s evidence rules; retain formal proof obligations where their contribution is necessary. |
B.3.3:6 - Consequences
Recipients can inspect what an assurance result supports and why a stronger use remains open. Teams direct effort towards relevant gaps and can reuse genuinely covering evidence.
Comparability becomes profile-specific. Defining a useful shared profile takes judgement about consequences, criteria and evidence; routine uses avoid that overhead. Review remains fallible and contestable rather than becoming objective merely because a status is computed.
B.3.3:7 - Rationale
A claim, argument and evidence have different functions. Assurance improves when a contribution closes a relevant gap under applicable assumptions. Counting evidence types or increasing formality cannot guarantee that improvement.
B.3 supplies this claim-and-use structure and its source account. ISO/IEC/IEEE 15026-2:2022 concerns the structure and maintenance of assurance cases. This pattern adapts maintained, inspectable support to a receiving use; its subtype distinction and optional level profiles are FPF choices, not a level ladder attributed to that standard. Reconsider a local profile when its evidence model, receiving decision or threshold basis changes.
B.3.3:8 - Relations
- B.3, A.10 and C.2.1: define the assurance result, evidence-use references and target claim.
- B.5.3 and B.3.5/C.13: supply needed concept correspondence and the elected, relation-specific construction account.
- C.2.1 and E.14: keep the identified Working-Model claim distinct from its assurance publication. A.4 supplies a System design/operation comparison only when that is the actual claim being assured.
- B.3.4 and C.27.TA: qualify currentness by the relied-on use, conditions and temporal reference.
- C.11 and C.19.2: support the choice of worthwhile additional evidence when that decision is live.
- B.4 and Part D: may consume a qualified assurance result in their actual transition or decision rules; this pattern supplies neither an automatic evolution gate nor risk-acceptance authority.
B.3.3:End
B.3.4 - Can Earlier Evidence Still Support This Use? — Evidence Decay and Epistemic Debt
B.3.4:1 - Problem Frame
Use this when. An earlier result is being relied on now, and a changed condition or a due review may change whether it still supports the receiving claim. Begin with the relied-on use and the premise that may have changed.
A bridge’s earlier assessment may remain applicable to its unchanged bounded use, while a new traffic load defeats that assessment before its scheduled review. A library result can remain applicable to unchanged dependencies yet fail to address a newly discovered relevant vulnerability. The age of either report does not distinguish these cases.
Practical gain. Reconsider the affected support in time to change the decision, while retaining useful results whose relevant premises still hold.
Ordinary boundary. Do not open a new assurance procedure solely because a carrier is older. If available information already establishes applicability for the immediate use, continue on that basis without a renewal or skip-refresh certificate. A real licence deadline, calibration qualification or promised-use window remains a condition of the actual use.
B.3.4:2 - Problem
How can a team notice obsolete support without treating elapsed time as automatic loss of truth, measured risk growth or loss of every use of an evidence carrier?
Three failures matter: a changed load-bearing premise remains unnoticed; a fresh but irrelevant result creates false reassurance; or repeated checks of unchanged premises displace protective maintenance that could actually change the outcome.
B.3.4:3 - Forces
| Force | Tension |
|---|---|
| Stable inference and changing premises | A valid derivation remains valid under its premises, while those premises may cease to describe the receiving situation. |
| Needed review and finite capacity | A timely inspection can prevent harm; an unnecessary repeat can displace it. |
| Visible warnings and alert noise | A recipient needs action-changing limits, not a warning for every old carrier. |
| Requirements and their merits | A current institutional condition can bind the action even when there is a justified proposal to amend it. |
B.3.4:4 - Solution
Qualify currentness at the claim and receiving use. Reconsider only the dependency reach for which a changed premise or an applicable review rule can alter the conclusion.
B.3.4:4.1 - Locate the condition that can change reliance
Identify the earlier result being used and the relevant conditions: for example, its configuration, operating envelope, measurement qualification or dependency. Establish whether available information still supports those conditions. An unchanged file is not proof that its environment is unchanged; an older file is not proof that its support has failed.
Use time-based review when an applicable deterioration model or review policy warrants it. Use event-, dependency- or condition-based reconsideration when those define applicability. A newly discovered failure mode may reopen a result before a review date. A calendar reminder may instead find that the result remains applicable without a new experiment.
Keep three judgements distinct: whether the earlier evidence applies, whether it is sufficient for the present claim, and whether the proposed action satisfies its actual conditions. Currentness alone answers neither sufficiency nor permission.
B.3.4:4.2 - Give dates their actual meaning
A valid_until: ISO-8601-date | null field is used only when the receiving claim or applicable rule has a calendar boundary to convey. State what the date bounds. A review-due date requests reconsideration; a qualification, right or resource-use end date can terminate an allowed use. Do not merge these meanings into a global expiry of the carrier.
An absent or null date means that this field supplies no calendar boundary. It asserts neither perpetual validity nor invalidity and creates no mandatory justification for a missing date. Applicable event or condition limits still govern the use.
Where a required review period applies, follow it until it is changed by someone with the necessary authority. Evaluate its protective purpose, threshold basis and displaced cost separately when deciding whether to propose that change. Questioning the policy is not permission to ignore it.
B.3.4:4.3 - Treat epistemic debt as an optional planning indicator
A team may call its outstanding evidence-review or maintenance obligations epistemic debt (ED). If it needs a number, define the counted entities, dependency treatment, scale and unit, policy purpose, and meaning of the action threshold. An epistemic_debt_budget is then a named planning-policy limit, not a universal allowance of harm.
For example, a team may count distinct overdue review obligations to plan assessor capacity. Ten duplicate paths to one obligation do not create ten obligations. Separate obligations consuming the same source may still require different judgements for different uses.
Elapsed days can contribute to a justified priority rule or deterioration model. B.3.4 supplies no default rate, sum or automatic level downgrade. A planning count is not a probability of failure, and zero overdue reviews does not establish an adequate assurance case.
B.3.4:4.4 - Choose the feasible response to the actual change
Determine what the receiving use can support now. The following are possible responses, not a compulsory completion triad:
| Response | When useful | Result for the receiving use |
|---|---|---|
| Continue on applicable support | Available information is sufficient for the unchanged bounded use. A scoped reconsideration, if needed, has found no relevant loss. | Retain the qualified result. No new experiment, waiver or separate no-refresh record is required merely to continue. |
| Narrow or restrict the use | Support remains sufficient for a smaller envelope or less demanding claim. | State the usable boundary and the limitation that changes the recipient’s action. |
| Refresh or inspect | An obtainable check can resolve a material uncertainty or meet a justified current requirement. | Choose that check with regard to what its result can change, its cost, delay and displaced work; perform and assess it only when actually undertaken. |
| Suspend reliance or deprecate the affected result | The necessary support is absent or defeated and no permitted continuation carries the requested use. | Remove or qualify that reliance and communicate the affected reach. A status downgrade does not accept the underlying harm. |
| Apply an authorized exception | An applicable rule permits a bounded exception and a competent authority can grant it for this case. | Follow the actual mandate, scope, conditions and accountability. A senior title alone grants no authority over affected risk bearers. |
C.11 and C.19.2 supply the choice of worthwhile additional evidence. Rechecking available configuration or premise information need not be a new experiment. A possible experiment is not a Work commitment. If the desired check is unavailable, retain any independently warranted bounded action or limitation; do not fabricate an observation.
For an immediate unchanged use, stop with its usable result. When a later receiver needs a warning, limitation or retained reason to avoid unsupported reliance, keep that minimum content with the existing result or publication. A separate DeprecationNotice is useful when something is actually deprecated, not as proof that refresh was skipped.
B.3.4:4.5 - Follow affected dependencies and preserve real expiry
Trace a changed premise to the claims and uses that actually depend on it. Reopen those conclusions under their applicable evidence model. Shared paths do not multiply evidence or risk, and an unaffected use does not inherit a global downgrade from the carrier’s age.
Keep actual physical and institutional conditions intact. Expired calibration qualification, an unavailable configuration, ended resource support or an elapsed rights window can block the corresponding use even when the old report remains an accurate record of an earlier state. A justified deterioration model can make elapsed time material; cite that model rather than inferring universal decay.
A dashboard should distinguish a review due, a defeated premise and a restricted use. Its colour reports the declared indicator or disposition, not the truth of the underlying claim. A failing test is a potentially relevant adverse result to assess now, not merely another overdue date.
B.3.4:4.6 - Worked cases: the same age, different decisions
Bridge. An earlier structural assessment supports a specified load envelope, conditional on its stated condition and inspection regime. For an unchanged limited use, available load and condition information and satisfied required inspections can preserve that support. The assessment’s age alone adds no repeat assessment. In the paired case, proposed traffic exceeds the envelope: the earlier report does not support that use, however recent its cover date. Obtain the assessment or restriction needed for the changed load before relying on the stronger claim.
Suppose the available inspection team can either inspect a suspected load-bearing defect or repeat an already adequate check whose relevant conditions remain established. Examine the protected harm and the basis of the inspection requirement, what each result could change, and the cost of delay. Where the defect inspection can prevent that harm and the repeat adds no useful information, preserve the inspection capacity. If a currently binding repeat requirement prevents that choice, seek an authorized amendment; the resource conflict does not itself remove the requirement.
Library. The verified property of an unchanged library in its qualified configuration remains supported when the relevant assumptions and dependencies still hold. A new vulnerability affecting a dependency used by the security claim reopens that claim even before a review date. An unrelated vulnerability does not. Preserve unaffected functional results and any independently supported restricted service while addressing the security limitation. A release recipient who would otherwise assume the affected security property needs that limitation in the released result.
B.3.4:5 - Conformance Checklist
- CC-ED.1 (Use-qualified currentness): A currentness conclusion MUST identify the relied-on claim/use and the conditions or temporal boundary that change it. A carrier’s age or absent date SHALL NOT alone establish loss of support.
- CC-ED.2 (Interpreted planning measure): A numerical ED or debt budget MUST define its counted entities, dependency treatment, scale/unit, purpose and threshold meaning. No project has a default obligation to adopt one.
- CC-ED.3 (Affected reach): Reconsideration MUST follow the actual support dependencies. Any aggregation MUST use an applicable interpreted model and avoid counting duplicate paths as additional evidence or risk.
- CC-ED.4 (Qualified disposition): A trigger MUST be interpreted for the receiving use; it SHALL NOT automatically downgrade a level or require Refresh/Deprecate/Waive. Preserve a sufficient current result without a separate renewal or no-refresh certificate. Preserve real qualification, rights and resource-use expiry.
- CC-ED.5 (Actual exception authority): A waiver, when used, MUST have the authority and scope allowed by the applicable rule, a rationale, affected risk bearers and accountability, and its actual ending or reconsideration condition. Keep the auditable exception with the decision that uses it; a title or lowered assurance status does not confer risk-acceptance authority.
B.3.4:6 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | Failure in use | Repair |
|---|---|---|
| Old therefore invalid | An unchanged qualified library result is discarded because its report crossed a generic date. | Check the condition that matters; retain applicable support without automatic renewal. |
| Unchanged file therefore safe | A newly relevant dependency vulnerability is ignored because the library bytes are unchanged. | Reopen the affected security claim and communicate its unsupported reach. |
| Green therefore assured | Fresh reports or zero overdue reviews hide an unresolved performance failure. | Assess relevance and adverse results for the target claim; report dashboard meaning honestly. |
| Status as risk acceptance | Lowering a badge or obtaining a senior signature is treated as permission to expose others to harm. | Establish the actual rule, authority and permitted response; restrict unsupported use where needed. |
| Maintenance by forced experiment | A repeat test consumes the only opportunity for a protective inspection without changing any relevant conclusion. | Compare marginal contribution and displaced cost; retain binding conditions while seeking any justified amendment. |
B.3.4:7 - Consequences
Teams can retain applicable support and direct review towards changed premises, reducing needless repetition without losing actual maintenance obligations. Later recipients receive the warnings that change their decisions.
This requires judgement about dependency reach and review policy. An optional queue or dashboard helps allocate capacity but cannot replace that judgement. Sparse evidence about a relevant condition may leave the current use unresolved even when the carrier itself is unchanged.
B.3.4:8 - Rationale
An earlier result can remain valid for its earlier claim while no longer supporting a changed use. Conversely, elapsed time need not defeat an unchanged premise. Maintenance therefore follows the assurance argument and its conditions rather than a universal entropy metaphor.
B.3’s source account and ISO/IEC/IEEE 15026-2:2022 place maintenance with assurance cases. C.27.TA supplies the use-relative temporal qualification. This pattern adapts those distinctions to continued reliance and planning; it attributes no universal decay equation or mandatory expiry date to the standard. A validated domain deterioration model or an applicable review rule can justify a particular time-based policy and its reconsideration conditions.
B.3.4:9 - Relations
- B.3 and B.3.3: define the assurance claim, receiving use and any justified local level profile.
- A.10 and C.27.TA: supply evidence-use dependencies and qualified temporal claims.
- G.11: schedules justified reconsideration or refresh over the affected dependency slice and conveys needed limitations to later recipients.
- C.11 and C.19.2: support the choice of obtainable evidence work when its contribution can change the decision.
- B.4: uses actual transition conditions; a debt indicator does not constitute its evolution gate.
- Part D and applicable domain rules: govern protected interests, authority and exceptions; an assurance status change does not decide them.
B.3.4:End
B.3.5 - Assurance Grounding for Working-Model Relation Claims (CT2R-LOG)
Status: Stable Type: Pattern
At a glance. Use B.3.5 when a human-facing structural relation or a collection’s own belongs-to relation has been selected for an additional assurance account without exposing constructive machinery as the public vocabulary.
Use this when. Use this assurance profile only when a publication choice or named current requirement elects it for a direct relation claim. State the readable relation first. After election, structural parthood and collection belonging follow separate trace and validationMode obligations. The trace reports independently grounded facts for inspection; it creates neither the relation occurrence nor the entity it describes.
What goes wrong if missed. The readable relation and its assurance account collapse: authors either lose usable relation sentences, treat collection belonging as parthood, prohibit separately grounded parthood by label, or make a trace look like the cause of the claim.
What this buys. Working-Model relations stay readable, while an elected assurance branch supplies the right inspectable account without changing the direct relation kind.
Not this pattern when. Not this pattern when a direct relation claim is sufficient and no publication choice or current requirement elects this assurance profile. Also not this pattern when the current question is how to construct the trace (C.13), which mereology relation kind is intended (A.14), whether a whole must be reidentified (B.2), or whether a candidate name deserves durable U-kindhood (E.24.UK).
One‑line summary. CT2R-LOG keeps ComponentOf, ordinary belongs-to sentences, PortionOf, and AspectOf readable while respecting their different relation kinds. When this assurance profile is elected, structural parthood uses its applicable construction account; collection belonging uses a current
C.13 settrace. Neither branch changes what makes the direct relation obtain, and neither trace decides whether a separate part relation is possible.
B.3.5:1 - Intent
Provide a single, human-facing family of Working-Model relations as the public relation layer, with explicit hooks for (G) grounding and (R) reliability, without exposing constructor jargon or overloading day-to-day authors.
What you get (manager/engineer view). The same relations you already know (e.g., ComponentOf) remain the public relation vocabulary.
What changes when the profile is elected (auditor/ontologist view).
-
Each covered published edge carries two additional commitments:
tv:groundedBy→ points to the support required by the relation’s branch: the applicablesumorslicetrace for structural parthood, one currentC.13 settrace for the collection’s belongs-to relation, or an admissible argument or evidence object for another permitted claim.validationMode ∈ {axiomatic, inferential, postulate}→ declares how the author justifies the assertion.
The pattern that defines the relation still decides when it obtains. CT2R-LOG records the public alias, the branch-specific support link, and the declared assurance posture; Lang-CHR supplies the labels.
B.3.5:2 - Problem Frame
B.3.5 exists where a readable Working-Model relation must remain usable by practitioners while assurance readers still need a grounding relation and declared validation stance. The EntityOfConcern is not a notation, trace file, or tool output. It is the relation-use discipline that keeps the public relation layer and assurance grounding layer distinct.
B.3.5:3 - Problem
Working-Model relations such as ComponentOf and an ordinary belongs-to sentence are easy to use but not self-justifying. Their declarations alone do not show which participants and occurrences obtain, which rule defines the relation, or what identifies the whole or collection. Conversely, exposing construction traces everywhere makes the graph unreadable to non-specialists.
We need: a stable public relation layer for relations and, where this profile is elected, a required, reconstructible grounding channel plus a visible validation intent that downstream assurance can reason about. The direct relation layer does not depend on electing the profile.
B.3.5:3.1 - Forces
- Two audiences, one dial. Project managers want one relation family and stable views; assurance readers want an inspectable construction account with explicit direct facts and identity conditions.
- Parsimony constraint. The Kernel stays minimal; construction is outside the Kernel.
- Unification inside FPF. We already unify external vocabularies; the same discipline is applied internally so patterns that publish structural claims can reuse one three-form construction-account discipline and one readable relation façade without making that account a second ontology.
B.3.5:4 - Solution (thumbnail)
CT2R‑LOG introduces a two‑link discipline and a validation flag around each canonical edge:
-
Alias link (concept‑level). Working-Model relations (e.g.,
ut:ComponentOf) are the public names for their exact direct relation principles.tv:AliasOfmay point from the public relation kind to that principle for comparison and reuse; the alias defines neither an occurrence nor a whole. -
Grounding link (assurance level). Each relation assertion covered by this elected profile carries
tv:groundedByaccording to its direct relation kind:- Structural parthood (
ComponentOf,PortionOf, orAspectOf) requires one current C.2.1 construction-trace episteme in the applicablesumorsliceform andvalidationMode=axiomatic.postulateis not available for this branch. - Collection belonging under the collection’s own rule requires one current C.2.1
C.13 settrace andvalidationMode=axiomatic. The trace reports the collection, the entity, the already established relation, the rule for belonging, and the identity conditions. It does not make the entity a constructive part, make belonging obtain, or prove that separately grounded parthood is impossible. - Other epistemic or constitutive edges may use an admissible evidence object or logical argument under
validationMode ∈ {inferential, postulate}when no constructive trace is appropriate.
- Structural parthood (
-
Validation flag (author intent). Every relation or aggregation rule covered by this profile carries
tv:validationModewith one of:postulate— pragmatic working claim backed by observations;inferential— reasoned consequence with a followable argument; oraxiomatic— one inspectable construction account is the declared assurance basis.
The direct branch above selects which modes and grounding targets are allowed. The flag is an assurance posture, not a species of world-side relation and not an identity or timelessness guarantee.
F–G–R alignment. F (the published relation claim):
:PumpA ut:ComponentOf :Skid12. G (its inspectable grounding account): the assertion links to:trace_Γm_sum_456, a C.2.1 episteme about the exact direct construction facts. Assurance posture:tv:validationMode=axiomaticis the author’s declaration. B.3.3 assesses the actual grounding for the receiving claim and use; a level is published only through an applicable justified profile. The declaration does not alter formality or establish empirical adequacy.
B.3.5:4.1 - Structural CT2R Typing-Grounding Unfolding Structure Block
When a constructive trace, working-model relation, and target kind or logical representation must be carried together across contexts, use this block or cite an equivalent A.22.CGUS specialization. The block is useful when the reader must see the passage from constructional material to a typed or logical claim without treating a readable relation label as proof.
StructuralCT2RTypingGroundingUnfoldingStructureBlock:
unfoldingStructureRef: exact independently selected A.22 structure, when needed
workingModelOrConstructiveRepresentationRef:
targetKindOrLogicalRepresentationRef:
bridgeRef?:
constructiveTraceRef?:
preservedStructure:
lostOrCollapsedStructure:
CL_or_CLk?:
admissibleReuse:
blockedSubstitution:
evidenceOrProofLinkageRef?:
unfoldingStructureRef names an independently selected A.22 structure; this block is a record describing its use. Recover the exact constituents, obtaining relations, applied constraints and named selection/use frame. StructuralCT2RTypingGroundingUnfoldingStructure is a local designator for the selected structure used to inspect this construction-to-typed/logical projection. Any A.22.CGUS qualification is tested separately under its potential-continuation rule; a local name or record does not establish it. C.13 supplies constructive-trace content and C.3 the kind intent, extent and subkind content actually used. The record creates no proof, empirical evidence, Work plan or decision.
When an inadequate working account requires general diagnostic recovery of the exact subject construction, use A.7.1. That return may stop at a direct relation, system-role assignment, state or capability, Work occurrence, holon recognition, or the pattern for another subject without opening this structural CT2R specialization.
workingModelOrConstructiveRepresentationRef names the relation, trace, model, or representation being carried. targetKindOrLogicalRepresentationRef names the typed or logical target. bridgeRef is required when this use actually claims or consumes an obtaining semantic Bridge under F.9 or a kind correspondence under C.3.3. CL_or_CLk is required when the consumed assurance/calibration account requires that value. Entity, scheme, plane or notation changes alone establish no crossing; a same-sense unit conversion requires neither invented endpoints nor a Bridge. CL does not by itself authorize use. preservedStructure and lostOrCollapsedStructure state what survives the passage and what the published relation no longer carries. Evidence linkage remains with B.3 evidence and assurance subject patterns; proof linkage remains with the proof or mathematical subject pattern that is current. The unfolding block only makes the structure of the passage inspectable.
B.3.5:5 - Vocabulary & notation (normative)
-
Working-Model relations (front‑stage).
ut:ComponentOf,ut:PortionOf, andut:AspectOfare publication-grade structural relations under their direct A.14 rules. A collection uses the belongs-to predicate defined by the pattern for that collection; FPF has no public genericut:MemberOfrelation. Belonging is not a sub-property ofut:PartOf,ut:StructPartOf, orut:EpiPartOf, but the same entities may separately stand in a constructive part relation when its own rule and all six A.1 matters pass. -
Alias principle (lexical).
tv:AliasOflinks a public relation type to the exact direct relation principle whose reading it carries (for example,ComponentOfpoints to the direct structural-component principle). The alias supports comparison; it neither defines an occurrence nor says that asumexpression produced the relation. -
Grounding (per‑edge). When this profile is elected for structural parthood,
tv:groundedBypoints to the applicable current C.2.1 construction trace andvalidationMode=axiomatic. When elected for collection belonging, it points to one currentC.13 settrace under the collection’s own rule and also usesvalidationMode=axiomatic. Other epistemic or constitutive claims may use a logical argument or evidence object under their permitted mode. Every target supports replay of the assertion’s basis; it creates neither the direct occurrence nor entity identity. -
Trace family.
Γ_m.sum,Γ_m.set, andΓ_m.sliceare the C.13 forms used by the covered branches.sumandslicereport structural-parthood constructions;setreports an already grounded collection and the belongs-to occurrences established under its own rule. No form creates the facts it reports, and no temporal or workflow form is added. -
Validation flag.
tv:validationMode ∈ {postulate, inferential, axiomatic}is required on every claim covered by this elected profile. Structural parthood and collection belonging useaxiomaticwith their branch-specific current trace. A direct relation outside the profile has no B.3.5 field obligation.
B.3.5:6 - Archetypal Grounding - Running example
Story. A refinery team publishes
:PumpA ut:ComponentOf :Skid12.
-
Publication — Working-Model relation layer. They publish one assertion using the Working-Model relation ComponentOf and declare its
U.Formality(typically F≈F3, controlled narrative). Only the Working-Model relation is visible to readers. -
Constructive grounding (Γₘ). In the background, the published assertion links to
:trace_Γₘ_sum_456, a C.2.1 episteme that names the exact pump and skid, the direct fastening, coupling, enclosure, terminal, flange, and seal occurrences that obtain, the applicable skid assembly rule, and the skid reidentification rule. An auditor replays that account to inspect the assertion’s basis. The same listed parts under a different assembly can form another whole, while a permitted pump replacement can preserve Skid12; the direct relations and reidentification rule, not the trace or input list, decide. -
Assurance stance & R-lane. Because the assertion is linked to the construction account required by its elected branch, authors set
tv:validationMode=axiomatic. The account makes the relation’s basis inspectable; the declaration does not strengthen that relation, fix identity or make it timeless. B.3.3 considers the actual grounding and its currentness for the receiving claim and use. -
Contrast (epistemic). When the same team asserts
:MassFlowRepresentation RepresentationOf :FlowModel, they declarevalidationMode=postulateand attach a calibration dataset instead of a Γₘ trace. Judge that empirical basis for the claimed representation and receiving use; the declared mode alone does not establish lower confidence. Under B.3.4, a changed configuration, calibration qualification or other relevant premise can reopen the claim. The dataset’s age alone does not defeat still-applicable support.
Result: one visible relation for engineers, a grounding reference and a validation-mode declaration for reviewers.
Collection case — Fleet North. First publish the ordinary sentence: “Vehicle 12 belongs to Fleet North under its registration rule.” Under that rule, the occurrence begins when Fleet North accepts the vehicle’s registration, ends on withdrawal or transfer, and a later accepted registration begins another occurrence. If no current publication choice or requirement elects this profile, the direct sentence is sufficient and the author stops.
Here the fleet publication elects the profile. It links the assertion to one current C.13 Γ_m.set trace that names Fleet North and its identity rule, Vehicle 12, the obtaining registration occurrence, the registration rule, and its ending and recurrence conditions; it declares validationMode=axiomatic. If a vehicle enters or leaves the fleet, or the rule changes, the earlier trace remains an account of its earlier state but is not current support for the later assertion. The register and trace report the relation; neither creates it. They prove neither ComponentOf nor that a separately grounded constructive part relation is impossible.
B.3.5:7 - Author Standard (at a glance)
When you add or import a relation edge:
-
Pick a Working-Model relation sentence such as “Impeller ComponentOf Pump” or “Vehicle 12 belongs to Fleet North under its registration rule”; avoid raw
ut:PartOfunless you are drafting meta-level axioms. If no current publication choice or requirement elects CT2R-LOG, publish that direct claim and stop. -
When CT2R-LOG is elected, attach
tv:groundedBy:- Structural parthood → the applicable current construction trace and
validationMode=axiomatic. - Collection belonging under the collection’s own rule → one current
C.13 settrace andvalidationMode=axiomatic. - Another permitted epistemic or constitutive claim → the branch’s logical argument or evidence object and allowed mode.
- Structural parthood → the applicable current construction trace and
-
Declare the selected
tv:validationModefor every covered claim.
What managers see: nothing new in the graph picture. What auditors get: a reliable trail from every edge covered by the elected profile back to its inspectable construction or evidence account.
B.3.5:8 - Compatibility & cross‑references
- B.3 and the direct proof or mathematical pattern. CT2R-LOG makes the relied-on construction or support account inspectable; B.3 judges its contribution to the current assurance claim. State the actual logic and proof basis when a formal conclusion is used.
- B.3.3 (Assurance subtypes and levels). The declared
validationModeand actualtv:groundedByaccount contribute only what they establish for the receiving assurance claim. They do not compute a universal L0–L2 progression; a published level requires an applicable justified profile. - B.3.4 (Evidence ageing and currentness). A relation assertion, its construction-trace episteme, and the warrants or evidence used for it retain their own editions and currentness.
validationMode=axiomaticdoes not freeze a trace or make described world-side facts timeless; changed participants, relations, rules, or identity conditions require direct reinspection.
B.3.5:9 - Rule‑set — CT2R‑LOG (conceptual, human‑first)
Intent (one line). Make Working-Model relations the canonical relation vocabulary for authors, while providing a clean, purpose-selected bridge to assurance through aliasing and grounding semantics; the bridge is required only for the published assertions covered by an elected B.3.5 profile or named current requirement.
B.3.5:9.1 - Vocabulary and meanings in this pattern
-
Working-Model relation. A human-oriented direct relation statement using a public name such as
ut:ComponentOf,ut:PortionOf, orut:AspectOf, or an ordinary sentence such as “this edition belongs to this product series.” It is the canonical public layer for readers; the direct pattern keeps the relation meaning fixed. -
Assurance Layer. Three complementary grounding modes an author MAY attach:
- Constructive grounding: an inspectable account in one of the three C.13 forms (
Γ_m.sum | Γ_m.set | Γ_m.slice). It names independently grounded participants, direct relation occurrences, the applicable construction rule, and identity or reidentification conditions. No formal notation is required, and the account does not create the relation it reports. - Logical grounding: a reasoned chain (think KD‑CAL style arguments) that shows why the relation follows from stated premises.
- Mapping grounding: a relation-label alignment that shows the domain label truly denotes the intended Working-Model relation (Kind-CAL / Lang-CHR stance). These three grounding modes are complementary, not exclusive.
- Constructive grounding: an inspectable account in one of the three C.13 forms (
-
Empirical Validation. How a published relation meets reality (observations, calibration scenarios). It lives beside, not inside, the relation. (See B.3 family.)
-
Grounding vocabulary (
tv:).tv:AliasOf— declares that a Working‑Model relation is the canonical projection of a more general pattern (its “principle of use”).tv:groundedBy— points to the author’s grounding account (Constructive, Logical, or Mapping, as applicable). When a construction trace is recorded, it is a C.2.1 episteme with its own edition and currentness. Thetv:namespace is part of the Core conceptual lexicon; it is notation‑agnostic and tool‑agnostic.
-
tv:validationMode ∈ {postulate, inferential, axiomatic}. A declaration by the author of the confidence stance for a relation instance: postulate — a pragmatic working claim; inferential — a reasoned consequence; axiomatic — the author declares that a constructive account is the assurance basis for this assertion. The mode does not classify the world-side relation and guarantees neither identity nor timelessness.
Authoring note. This pattern defines meanings, not formats. The words above SHALL be used consistently and without reference to any specific notations or execution environments (Guard‑Rails: Notational Independence).
B.3.5:9.2 - Normative rules (MUST/SHALL clauses for thinking‑and‑writing)
S‑1 (Working-Model first). Authors SHALL state each covered direct relation claim in Working-Model form. Assurance accounts remain below that public layer. Electing this profile adds branch-specific trace and mode obligations; it is not a precondition for direct use.
S‑2 (Alias declaration).
If a Working‑Model relation follows a known general principle, the author SHOULD declare tv:AliasOf <Principle>, thereby making the intended use‑pattern explicit for reviewers and future readers. (This improves comparability without introducing extra formality.)
S‑3 (Grounding by mode).
For every relation instance covered by an elected B.3.5 profile, the author MUST set validationMode and follow the corresponding grounding stance:
-
S‑3.a
postulate. For a branch that permits it, the author may omit constructive grounding, state the working scope, and give the empirical cues that would challenge the claim. -
S‑3.b
inferential. For a branch that permits it, the author gives a short reasoned chain from admitted statements that a peer can follow. -
S‑3.c
axiomatic. The author links the assertion to the current C.2.1 trace episteme required by its branch. A competent peer can recover the exact participants, direct relation occurrence, applicable rule, and identity or reidentification conditions. The account supports inspection; it creates none of those facts. -
S‑3.d Structural parthood. A covered
ComponentOf,PortionOf, orAspectOfassertion requiresvalidationMode=axiomaticand the applicable current C.13 construction account;postulateis not available. -
S‑3.e Collection belonging. A covered belongs-to assertion uses the rule defined for that collection and requires
validationMode=axiomaticand one current C.13settrace. The trace reports already established belonging and collection identity. A logical argument or evidence object may support the inclusion decision separately, but neither substitutes for the elected set trace, turns belonging into parthood, or prohibits a separately grounded part claim.
S-4 (Relation-kind sense-making).
-
For structural
ComponentOf,PortionOf, andAspectOfclaims, the elected profile requires the applicable current construction account andvalidationMode=axiomatic. -
For collection belonging, the elected profile requires one current
C.13 settrace andvalidationMode=axiomatic. The collection’s own rule still decides whether the occurrence obtains. -
For other epistemic or constitutive links, constructive grounding remains optional and the branch may prefer inferential or postulate reasoning with empirical cues.
S‑5 (Order and time do not establish parthood). Execution order, parallelism or interval inclusion alone SHALL NOT establish a part-whole relation. State Method composition under B.1.5 and temporal facts under C.27; use B.1.4 when those recovered relations must be aggregated. Independently established A.15.1 Work-part relations and A.14 proper-phase relations for unchanged non-Work carriers remain admissible under their own rules.
S‑6 (Unidirectional dependence). CT2R‑LOG may consume Compose‑CAL and KD‑CAL conceptually; it SHALL NOT redefine them. Meaning flows downward only (Kernel → Extension → Context → Instance).
S‑7 (Register discipline).
When naming principles in tv:AliasOf, authors SHOULD use Tech/Plain twin labels where available and obey minimal‑generality and rewrite rules (LEX‑BUNDLE), so that aliases are recognisable across contexts of meaning.
S‑8 (No tool talk). Core prose MUST NOT introduce CI/CD terms, file formats, APIs, or machine‑oriented notations in place of concepts. If examples are needed, they MAY be plain‑language narratives or domain vignettes. (This pattern is conceptual by Standard.)
B.3.5:9.3 - Scope & Non‑Goals (to keep the plane clean)
-
In scope. Canonical publication of relations for humans; alias‑to‑principle clarity; conceptual grounding stories; author‑declared validationMode; separation of structure vs order/time.
-
Out of scope. Any machinery that executes checks; any binding to specific notations; any process/workflow mechanics; any discussion of file formats. (Those belong to tooling publications, pedagogy publications, and companion records; they SHALL NOT be imported by the Conceptual Core.)
-
Edge placements. When a claim is chiefly about naming fit across Contexts, prefer Mapping grounding (Kind-CAL/Lang‑CHR stance). When it is chiefly about why it follows, prefer Logical grounding. When it is about what the whole is, from its parts, prefer Constructive grounding. (Authors MAY combine them.)
B.3.5:9.4 - Author’s working moves (micro‑playbook, notation‑free)
M‑1. State the relation in Working‑Model form (e.g., “Impeller ComponentOf Pump”).
M‑2. If a publication choice or named current requirement elects this profile, pick validationMode; otherwise keep the direct relation claim and stop:
- For a permitted exploratory claim, choose postulate and state scope plus challenge cues.
- For a permitted conclusion from known statements, choose inferential and list the short argument.
- For structural parthood covered by the profile, choose axiomatic and link the applicable current construction account.
- For collection belonging covered by the profile, choose axiomatic and link one current
C.13 settrace that reports the already established relation under the collection’s own rule.
M‑3. Add tv:AliasOf only when a named direct relation principle helps reviewers recognize the intended reading; do not alias the relation to a constructor result.
M‑4. If assembly uses two parallel lines, state the actual Method/Work and temporal facts. Add any independently obtaining part relation under its own rule; parallelism alone does not establish it.
M‑5. Stop when the selected readable relation and remaining non-use boundary are clear and, if this profile is elected, its validation mode and required current support are recoverable without guessing.
B.3.5:10 - Bias-Annotation (auditable, human-first)
The purpose of this section is to make typical cognitive slips visible and name the counter-moves an author or assurance reader should apply in thought—not with tools. These biases are generic; the remedies point to neighboring FPF guard-rails and patterns.
| Bias (name) | Symptom in the model | Cognitive counter‑move (conceptual only) | Where to check |
|---|---|---|---|
| Formalism capture | A trace, constructor expression, or validationMode is treated as the source of the direct relation or whole identity. | Recover the exact participants, direct relation occurrences, construction rule, and identity or reidentification rule first. Treat the trace as a current C.2.1 account and the mode as the author’s assurance posture. | CC‑CT2R‑1, CC‑CT2R‑2, CC‑CT2R‑3; C.13 trace separation. |
| Canonical inversion | B.3.5 fields are demanded before direct use, or one assurance branch is imposed on every relation. | Use the direct claim first. After election, use the applicable branch: structural parthood or collection belonging takes its required axiomatic trace; other permitted claims may use inferential or postulate support. | CC-CT2R-2, CC-CT2R-3, CC-CT2R-5. |
| Order/time leakage | Inferring parthood from sequence, parallelism or interval inclusion alone. | Recover the independent part relation under A.15.1 or A.14 when it obtains, and keep Method/order/time claims separate. | B.1.5, C.27 and B.1.4; A.15.1 or A.14 for the exact part/phase claim. |
| Notation lock‑in | Letting a diagram or syntax define the meaning (“it’s true because the diagram says so”). | Enforce Notational Independence: meaning is defined in prose/maths; renderings are illustrative only. | Part E guard‑rail on notational independence. |
| Unexamined mapping fit | A composed claim relies on a mapping without inspecting preserved and lost distinctions. | State the exact mapping, its applicability and loss. Use a numeric reliability consequence only when the receiving model establishes its meaning and calculation; ordinal CL alone is insufficient. | B.3 and the direct mapping or representation pattern. |
| Collection/composition swap | A belongs-to predicate is used as PartOf, or a part claim is used as collection belonging, and reliability is carried over as if both were one construction. | State collection belonging and constructive parthood separately under A.14. When both obtain, keep both claims and their different set and sum accounts. | A.14 and C.13. |
| DesignRunTag chimera | Mixing design‑time and run‑time evidence into one “assurance” line. | Split the scope of the claim: S ∈ {design, run}; compare side‑by‑side rather than merging. | B.3:4.8 and its “Design/run chimera” anti-pattern. |
Reader reminder. Bias audit is a reading aid. It never licenses tooling talk in Core; use the guard‑rails in Part E to keep semantics primacy and unidirectional dependence of layers.
B.3.5:11 - Conformance Checklist (normative, author-facing)
The following obligations regulate how to think and write CT2R content. They are notation‑agnostic and purely conceptual.
| ID | Requirement | Purpose |
|---|---|---|
| CC-CT2R-1 (Canonical-first). | A relation published for readers SHALL be stated in Working-Model terms (ut:*Of) as the canonical form; any constructive or logical justification is recorded as grounding (not as the definition). | Preserve human-first canon and didactic primacy. |
| CC‑CT2R‑2 (Mode declaration). | For every relation or rule covered by an elected B.3.5 profile, the author SHALL declare tv:validationMode ∈ {postulate, inferential, axiomatic} in prose. A direct relation outside the profile needs no B.3.5 mode. | Make elected assurance intent explicit without taxing ordinary direct use. |
| CC‑CT2R‑3 (Structural axiomatic grounding). | A covered structural parthood assertion uses validationMode=axiomatic and links to its applicable current C.2.1 sum or slice construction trace. The account reports independently grounded participants, occurrences, rule, and identity conditions; it creates none. | Make elected structural assurance inspectable without turning it into a truth-maker. |
| CC‑CT2R‑4 (No parthood from order/time alone). | Authors SHALL NOT infer parthood from sequence, parallelism or temporal slicing alone. Any Work-part or proper-phase claim satisfies A.15.1 or A.14 independently; Method order and temporal relations use their direct patterns. | Preserve distinct relation meanings while allowing independently established temporal parts. |
| CC‑CT2R‑5 (Collection vs part). | Authors keep collection belonging under the collection’s own rule distinct from every PartOf branch. A direct claim needs no profile fields; after B.3.5 election it uses validationMode=axiomatic and one current C.13 set trace. If constructive parthood also obtains, state and support that claim separately. | Prevent category errors without taxing ordinary belongs-to prose or prohibiting a stronger independently grounded claim. |
| CC‑CT2R‑5a (Set trace reports). | The elected set trace names the collection, the entity said to belong, the already established occurrence, the collection’s own belongs-to rule, and the identity conditions. It creates none of them and supplies no structural-composition reliability. | Keeps optional assurance from becoming ontology. |
| CC‑CT2R‑6 (Fit is explicit). | Where a claim relies on a mapping or alignment, the author SHALL state its actual applicability, preserved/lost distinctions and consequence for this claim. Any quantitative reliability adjustment needs a justified receiving model, compatible Scale and calculation; a CL label alone supplies none. | Keep integration limits inspectable without invented reliability arithmetic. |
| CC‑CT2R‑7 (Notational independence). | Core meaning MUST NOT hinge on any specific diagram or syntax; illustrative renderings, if present, are labelled informative. | Ensure longevity and cross‑discipline portability. |
| CC‑CT2R‑8 (Layer direction). | Grounding flows downwards from Working‑Model to Assurance layers (Mapping/Logical/Constructive). Authors SHALL avoid back‑defining the canonical relation by its Mapping, Logical, Constructive, or Empirical grounding. | Preserve unidirectional dependence of layers. |
| CC‑CT2R‑9 (Scope split). | When assurance is discussed, authors SHALL state the typed claim and scope S ∈ {design, run} and keep them distinct in reasoning. | Prevent DesignRunTag chimeras. |
B.3.5:12 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | What goes wrong | Repair |
|---|---|---|
| Trace as relation or truth-maker | A Gamma_m trace is treated as the public relation, as proof that the relation obtains, or as the source of whole identity. | Keep the Working-Model relation canonical; recover the direct relation facts and reidentification rule independently; attach the trace only as their inspectable C.2.1 account. |
| Unchecked relation label or mode | A familiar relation label or axiomatic flag is published as though either settled relation obtaining or identity. | State and test the direct relation first. When B.3.5 is elected, add the branch-specific mode and support account. Stop when a fact required by the direct pattern is missing. |
| Order/time leakage | Sequence, phase labels or parallel timing are treated as sufficient evidence of parthood. | Recover each direct relation separately: A.15.1 for Work parts, A.14 for a proper phase of an unchanged non-Work carrier, and B.1.4 for aggregation of recovered order or temporal relations. |
| Assurance by notation | A diagram, graph display, or data format is treated as if it made the relation true. | Use the diagram, graph display, or data format to present the relation claim; keep the grounding relation and validation mode explicit. |
B.3.5:13 - Consequences (benefits, trade-offs, mitigations)
Benefits
- Cognitive clarity for authors and readers. Working-Model relations remain canonical while assurance accounts stay beneath them. Every claim covered by the elected profile carries only its branch-specific support account; ordinary direct claims remain lightweight. CT2R preserves a path to higher assurance while keeping collection belonging distinct from constructive parthood and order and time outside structure.
- Use-specific assurance without tooling commitments. Teams choose the grounding that the relation’s elected branch and receiving claim require. The declared modes distinguish justification postures; they are not an ascending scale of empirical confidence.
- Explicit fit management. Inspect the mapping and its losses before relying on a composed claim. Its actual limitations can qualify, narrow or block that conclusion; a quantitative effect requires the declared receiving model.
- Cleaner separation of concerns. Distinguish collection belonging, parthood, Method composition and temporal relations by their direct rules. Their separate meanings can coexist in one inspected account without inferring one relation from another.
Trade‑offs & mitigations
- Extra prose discipline. Declaring
validationModeand writing a short grounding narrative (when axiomatic) adds authoring effort. Mitigation: reuse local templates; keep narratives concise and Γ_m‑oriented by idea rather than notation. - Insufficient grounding for the receiving use. An empirical or logical account can omit a premise or fail to satisfy the elected branch. Use B.3.3 to identify that gap and the worthwhile repair; retain sufficient support without demanding a more formal mode merely for its label.
- Inspecting mapping limits costs effort. Recover the correspondence, align units where lawful, and verify the links needed by the claim. Retain a qualitative limitation when no justified numerical reliability model is available.
One‑line takeaway for managers. CT2R lets you talk in natural, domain‑meaningful relations while preserving a clear, optional path to formal grounding and empirical checking—so confidence can grow deliberately without dragging your model into tooling or syntax.
B.3.5:14 - Rationale (informative)
14.1 Why canonical‑first?
CT2R-LOG treats the human-readable, task-appropriate relation (e.g., ut:ComponentOf) as the canonical publication form because that is what engineers and managers actually use to reason, decide, and communicate. The formal layers ground that form; they do not replace it. This is consistent with the authoring Standard in Part E (pattern template and style guide), which privileges clarity, purpose and didactics over premature formalism in the body text. Authors write for people first, then point to the kind of assurance they are invoking.
14.2 Why two tv: links—and why concept‑only?
tv:AliasOf and tv:groundedBy name conceptual bridges from a public Working-Model relation to its direct principle and assurance account. They mandate no notation. They keep authors explicit about the relation reading, the support being invoked, and when that support must be current, without letting an alias, trace, or mode define the world-side occurrence.
14.3 Why a triad of validationMode?
The triad {postulate, inferential, axiomatic} distinguishes permitted justification postures, not stages of formality or increasing confidence. The direct relation kind and elected profile determine which posture and support are appropriate for the receiving claim and use. A sufficient calibration account in a branch permitting postulate needs no mode promotion; an elected structural-parthood or collection-belonging claim still requires its respective current construction trace. Where a load-bearing claim needs stronger proof or an empirical check, select that contribution for the assurance gap it can resolve, not to advance through the three labels. The mode declaration changes neither the canonical relation nor the strength of its support.
14.4 Why recover parthood independently of order and time? Order and temporal coverage answer different questions from parthood. A chronology or diagram supplies no part relation by itself. A.15.1 can independently establish a Work temporal part, and A.14 a proper temporal phase of an unchanged non-Work carrier. Preserve those relations alongside the applicable Method and temporal claims; B.1.4 aggregates only the relations already recovered.
14.5 Why point to Γ_m.sum | set | slice (Compose‑CAL) for constructive grounding?
The three C.13 forms—sum, set, slice—are sufficient to report the recurring construction accounts for integrated assemblies, collections, and aspects without expanding the kernel. They are not identity functions. A truthful account carries exact participants, direct relation occurrences, the applicable rule, and identity or reidentification conditions: the same inputs under another assembly can form another whole, while a permitted replacement can preserve one whole.
14.6 Why mental obligations rather than process mandates? Part E requires that patterns define or constrain thinking and authoring; enforcement and automation, if any, are external concerns. CT2R-LOG therefore states obligations as self-contained cognitive checks: for a claim within an elected profile, declare a permitted mode and supply the support required by that branch; use the respective current trace for structural parthood or collection belonging; keep order/time in their places. The requirements concern the claim’s justification, not attainment of an axiomatic strength level. This keeps the core specification evergreen and tool-agnostic, as required.
B.3.5:14.7 - SoTA-Echoing
The assurance profile uses the three contributions below.
| Source line | Adopt, adapt, or reject | Change in B.3.5 |
|---|---|---|
| A.14’s current constructional comparison | Adopt construction and identity before relation choice. Reject both a universal collection-membership predicate and any inference from belonging either to parthood or to the impossibility of parthood. | S-3.d/e, CC-CT2R-3/5/5a, and the Fleet North case keep collection belonging and a separately grounded part claim distinct. |
| ISO/IEC/IEEE 15026-2:2022, Assurance case | Adapt its separate, maintained assurance-case structure: an elected support account stays inspectable and current beside the claim it supports. Reject a mandatory full assurance case for every direct relation. The FPF-specific validationMode triad is only the author’s declared posture; the standard is not cited as its source. | The Solution, S-2/S-3, B.3.4 currentness relation, and conformance rows require support only after profile election and keep claim, support, and posture separate. |
| NIST’s current Digital Thread for Manufacturing programme | Adapt traceable model-based information, validation, and conformance across engineering, manufacturing, and quality. Reject a shared model, thread, exchange, or passing syntax check as proof of a world-side relation. | tv:groundedBy, the trace-family rule, and the two worked cases keep the support account versioned and inspectable while the direct relation and its own rule decide what obtains; a trace or evidence item creates neither the relation nor its identity. |
At comparable correctness and currentness, always exposing the heavier account costs more to write and read, while a bare direct sentence cannot meet an elected assurance need. B.3.5 therefore starts with one readable relation and adds one branch-specific account only when the publication elects the profile. The cost is that the relation assertion and its support must be checked for currentness separately.
Reopen only the affected source row and rule if A.14 changes the construction/belonging decision, a later ISO 15026-2 edition changes assurance-case structure or maintenance, or newer model-based-engineering evidence demonstrates a lower-effort way to retain direct meaning, declared posture, traceability, and independent currentness. A changed member, rule, trace, or evidence item instead reopens the affected assertion; it does not by itself reopen this architecture.
B.3.5:15 - Relations
Builds on
- A.14 Advanced Mereology — supplies direct structural relations and the discipline for collection belonging under each collection’s own rule and separately grounded parthood; B.3.5 adds only the assurance branch elected for the relation.
- A.11 Ontological Parsimony (C‑5) — constructive grounding lives in a calculus; the kernel remains minimal.
- B.1 Universal Γ — shared invariants and the placement of order/time in their respective Γ‑flavours.
- Part E authoring rules — canonical pattern template and notational independence, which CT2R‑LOG explicitly follows.
Coordinates with
- Compose-CAL (
Γ_m) andC.13— supply current construction accounts for structural parthood and thesetaccount for elected assurance of collection belonging. Each trace reports facts whose meanings and conditions come from the pattern that defines the relation. - A.22.CGUS / StructuralCT2RTypingGroundingUnfoldingStructureBlock — provides the local structural CT2R unfolding block when a constructive trace, working-model relation, target kind or logical representation, bridge, preserved structure, and loss must be inspected together;
A.7.1is the pattern for general diagnostic return to a subject construction. - KD‑CAL — provides the logical shoulder (inferential justification) when authors pick
validationMode = inferential. - Kind-CAL / Lang-CHR — provide the mapping shoulder (kind and relation-label alignment) governing alias policies without altering Working-Model relations.
Constrained by
- Notational Independence (E.5.2) — CT2R‑LOG refuses to prescribe formats, keeping all obligations conceptual.
Specialises / feeds
- B.3, B.3.3 and B.3.4 — supplies the publication discipline (Working-Model relations, declared relation kind and validationMode; F per C.2.3 where relevant) that B.3’s trust calculus expects; interacts with ageing and assurance-level assessments without changing the relations themselves.
Non‑relations
No introduction of order/time — CT2R‑LOG does not define SerialStepOf / ParallelFactorOf / temporal phases; use B.1.5 for Method-order claims, A.14 and B.1.4 for same-carrier temporal phases and their aggregation, and A.15.1 for Work parts and occurrences.
B.3.5:End
B.4 - Coordinate Repeated Adaptation (Canonical Evolution Loop)
Status: Stable Type: Pattern
Use this when. Use this pattern when repeated adaptation must keep one exact subject’s current identity, an observed basis, a proposed or actual successor, the Systems and dated Work that make the change, and renewed use connected. Name the subject kind first: System, episteme, Method, MethodDescription, or a sequence of distinct Work occurrences.
What goes wrong if missed. Teams treat drift, learning, release, and improvement as unrelated events. Specifications become stale, operational surprises lose their evidence relation, and changes appear without a clear predecessor, successor, performing System, or dated Work. At the opposite extreme, one generic loop is imposed on every subject: a description edit is called a Method change, completed Work is said to be revised, or an internal adaptation is rejected because its acting System is not external.
What this buys. A compact, reviewable adaptation cycle whose identity rule comes from the subject pattern. It keeps observed basis, design-time change, run-time use, acting Systems, dated Work, evidence, publication, acceptance, and responsibility distinct while connecting only the facts needed by the receiving use.
Not this pattern when. Not this pattern when one direct subject-pattern claim answers the change question without a repeated adaptation cycle. Use the direct relation pattern for relation grounding, adding B.3.5 when its working-model assurance profile is required. Use B.4.1 to publish candidate routes from a stabilized cue, B.5.2 for abductive hypothesis work, C.27 for temporal status, or A.15 for method/work alignment without an adaptation-loop claim.
B.4:1 - Problem Frame
The FPF is built on the Principle of Open-Ended Evolution (P-10): continued use can reveal reasons to adapt a System, an episteme, a Method, or a description. The useful commonality is a repeated move from use through an observed basis and an explicit change back to use. The identity question is not common. The same subject may continue through a change, a successor may be identified, or later dated Work may be a distinct occurrence rather than a revision of earlier Work. B.4 therefore supplies a shared cycle only after the relevant subject pattern has supplied that distinction.
B.4:2 - Problem
Without a canonical, shared model for evolution, projects fall into predictable and costly failure modes:
- Design-Reality Divergence (The “Drift”): The run-time subject in use slowly diverges from its design-time account. Formal models become elegant fictions, assurance cases become irrelevant, and the project loses the ability to reason reliably about what it uses.
- Learning Stagnation (The “Ivory Tower”): Observation produces valuable findings, but no explicit change path carries them into a revised design or renewed use. “Lessons learned” remain static documents.
- Chaotic Change (The “Whack-a-Mole”): Reactive patches have no stated observed basis, identity decision, or return-to-use condition. Hidden dependencies and unintended consequences accumulate.
B.4:3 - Forces
| Force | Tension |
|---|---|
| Stability vs. Change | How to adapt continuously while retaining the identity and assurance commitments that still hold. |
| Learning vs. Operating | How to keep use stable enough to serve its purpose while gathering and acting on evidence. |
| Top-Down Intent vs. Bottom-Up Reality | How to connect intended improvement with what actual use reveals. |
B.4:4 - Solution
Use the Canonical Evolution Loop as a coordinating cycle, not as a universal identity rule. First recover the exact subject and what continuity means for it. Then name the actual Systems and dated Work, traverse only the phases that occurred, and connect the result to renewed use.
B.4:4.1 - Name the subject and continuity question
| Subject kind | State before using the shared cycle |
|---|---|
| System | Name the current System and the relevant continuity or transformation rule. State whether the changed System remains the same System or whether a successor System is identified. Use A.1 for System recognition, A.3.4 for an actual bounded change of the continuing System, and A.15.PROD when the claim concerns first existence through production Work. |
| Episteme | Identify the earlier and later epistemes under C.2.1. Assert an EpistemeEditionRelation only when its historical-continuation conditions obtain; otherwise state replacement or another direct relation. |
| Method | Identify the current Method under A.3.1. If intended results, participant meanings, admissible conditions, safety bounds, semantic basis, acceptance criteria, or composition change, state whether the result is a refinement, substitute, or distinct successor Method. Use B.1.5 when order-sensitive composition is current. |
| MethodDescription | Identify each exact claim-bearing episteme under A.3.2 and C.2.1, and any obtaining edition relation. A later description does not by itself change the Method it describes. |
| Work | Identify each dated occurrence under A.15.1. Completed Work is not revised: later review, repair, deployment, or follow-up is other Work, even when the occurrences belong to one longer effort. |
Not every holon is an adaptation-loop subject, and the five branches are not interchangeable. If the continuity or successor relation is still open, keep that question explicit rather than hiding it behind the word evolution.
B.4:4.2 - Separate the changed subject from the acting side
The subject does not observe, refine, or deploy itself by grammatical convenience. A System performs each actual piece of Work. The changed subject, performing System, dated Work, Method enacted by that Work, and result remain distinct. Practitioner prose can still say “the engineer refined the design” or “the controller adjusted the valve” when that recognizable actor and action are enough. If that ordinary sentence is all the receiver needs, do not open a technical Work account. If B.4 identifies one particular dated U.Work occurrence, first recover every actual performer’s A.13 core and independently admit the Work under A.15.1 from its performance history, enacted Method, temporal extent, and containing System. Add F.6 only when the receiving claim also needs precise assignment-bound attribution. A short B.4 account may omit an unused assignment identifier or classification only when every relation it consumes remains recoverable.
The performing System need not be external to the larger holon. For internal adaptation, apply the A.12 reflexive split: identify the changed subsystem or part and the acting subsystem or part as exact, distinct participants, and establish their parthood in the containing holon independently. Use an external System when that is what the case actually has. For any particular dated U.Work, recover every performer’s A.13 core and independently admit the occurrence under A.15.1; add F.6 afterward only when precise assignment-bound attribution is current. Name an assignment in the short B.4 account only when the receiving claim uses its identity. State authority, responsibility, permission, acceptance, or admission through its own direct predicate, actual participants, and applicability basis; neither a phase label nor Work supplies them.
B.4:4.3 - Keep the four phase claims distinct
These phases distinguish questions and results, not necessarily disjoint clock intervals. Operation and observation can overlap; state the actual Work occurrences and any result dependencies needed by the transition.
| Phase | Current question | Output and boundary |
|---|---|---|
| 1. Operate | How is the current subject actually operating or being used? | Name the current use or operation and any records that actually exist. Monitoring may occur, but a record does not by itself establish an observation, comparison, or change. |
| 2. Observe | What do records, measurements, testimony, or other evidence show for the named use? | Name the observation, comparison, or interpretation Work. Separately identify the observed basis, finding, hypothesis, or still-unclear cue through the direct result or evidence rule that actually applies; Work has no generic result field. Observe does not yet choose a change. |
| 3. Refine | What change should be developed and tested in response, and what identity relation would that change have? | Name the design, revision, selection, and testing Work. Separately identify the selected candidate and the subject-specific identity question or intended treatment. State a continuity, successor, substitution, refinement, or edition relation only when its exact endpoints exist and its own conditions obtain. Refine does not make the candidate available for renewed use. |
| 4. Deploy | What concrete deployment Work occurred for the selected candidate? | Name that Work. Then state separately what actually happened—for example, a changed or produced entity, publication, configuration, release, or availability—using the rule that establishes that fact. Acceptance, admission, and actual later use remain separate facts. |
Use explicit transition conditions:
- Operate -> Observe: a named cue, question, monitoring result, or review need requires interpretation.
- Observe -> Refine: the receiving use has an observed basis or a routed cue from which a change question can be formed.
- Refine -> Deploy: one candidate is selected and its subject-specific identity question or intended treatment is explicit. State an obtaining continuity, successor, substitution, refinement, or edition relation here only when both endpoints already exist; otherwise keep the question open until the relevant change or production has occurred.
- Deploy -> Operate: actual renewed operation or use begins; availability alone does not close this transition.
Evidence is not a fifth phase. Evidence relations warrant the observed basis, candidate choice, transition, or renewed-use claim when a receiver relies on them. Evidence can be produced or used during several phases without duplicating those phases.
B.4:4.4 - Connect neighbouring cycles without collapsing them
The Canonical Reasoning Cycle (B.5) can supply reasoning Work within Observe and Refine. The B.5.1 development states and B.4 phases coordinate, but they are not a one-to-one implementation: a finding may reopen Exploration or Shaping, evidence use can support Evidence, and renewed use can enter or return to Operation.
When Observe finds only a weakly articulated cue, use the optional B.4.1 sequence Notice -> Stabilize -> Route. Its routed result can return to Refine or enter another subject pattern. That sequence does not replace the four B.4 phases.
Keep the account proportional. A local repair can name only the current subject, observed basis, actual Work, resulting identity relation, and next use. Expand to a complete cycle trace when a named relying decision, assurance case, audit, or later replay needs it. Never invent phases merely to make the record look complete.
Didactic Note: four practical questions
- Operate: What exact subject is operating or being used now?
- Observe: What has actual use shown, and through whose Work?
- Refine: What change is being considered, and would it continue or replace the subject?
- Deploy: What deployment Work occurred, and what separately established fact now supports the next use?
The gain is a readable connection from an observed basis to a real change and back to use, without losing subject identity, performers, Work, or evidence.
B.4:5 - Archetypal Grounding
The phase names can be shared, but each subject branch keeps its own identity and return-to-use rule.
-
B.4.1 - Observe -> Notice -> Stabilize -> Route (optional pre-abductive route):
- Context: A fleet of autonomous delivery drones (
U.System) is in operation, and operators begin to notice that winter deliveries feel “off” before a clean anomaly statement exists. - Loop Example:
- Operate: The drones perform deliveries.
- Observe: The monitoring service and named operators perform observation Work and find recurring cold-weather battery strain, but the cue still has low articulation.
- Optional B.4.1 route inside Observe: A named team performs stabilization Work. Under
A.16.1, aPreArticulationCuePackpreserves the cue nucleus, primary witness traces, and current language-state position without pretending that a final anomaly or action record exists; when the pack is made available for this use, name the separate publication occurrence underE.24.PUB. The same or another team performs routing Work. UnderB.4.1, aRoutedCueSetkeeps multiple continuations visible—for example, battery-chemistry investigation or route-planning adjustment; again, name its publication occurrence underE.24.PUBwhen availability matters. - Continue the loop: The selected route enters Refine or another fitting subject pattern. Only a selected and tested change proceeds to Deploy and renewed drone operation.
- Context: A fleet of autonomous delivery drones (
-
Knowledge-instantiation slice (theory refinement loop):
- Context: A scientific theory of protein folding (
U.Episteme) is used to predict structures. - Loop Example:
- Operate: Named researchers perform theory-application Work using the current theory episteme.
- Observe: A research lab performs observation Work. A separately identified
C.2.1finding episteme states that the current theory fails to predict the structure of a protein class; name separately anyE.24.PUBpublication occurrence that makes this finding available. - Refine: A research team performs revision and testing Work. A later theory episteme, identified under
C.2.1from its changed claim content, includes a term for the new protein class. Assert an edition relation between the two theory epistemes only if that relation obtains. - Deploy: The team performs publication Work for the later theory. The publication occurrence, journal acceptance, admission into a configured knowledge base, and later community use are separate relations. Note. If a chart or CG-frame readings are derived from this episteme, they MUST cite the
MethodDescriptionof the measurement protocol actually used (per A.19.CN CC-A19.D1-3) to keep comparability auditable.
Adaptive-specialization note. When the knowledge-instantiation slice carries a bounded-specialization claim for one declared task family, that claim SHALL name the prior basis being refined from, the named work-measure threshold being pursued, the adaptation budget being spent, and the freshness or provenance basis for claiming the specialization is reusable. If the refinement is claimed as one specialization step, it SHALL also cite the declared
TaskFamilyorTaskSignatureanchor consumed byC.22.1,G.5, andG.9. This keeps the refinement legible as contextual task-family specialization rather than vague general capability growth. - Context: A scientific theory of protein folding (
-
Method-instantiation slice (adaptive method loop):
- Context: A field-maintenance organization uses a declared inspection-and-repair Method (
U.Method) described by one currentU.MethodDescription. - Loop Example:
- Operate: Maintenance teams perform dated maintenance Work that enacts the current Method.
- Observe: A reviewer performs review Work and records that the time from fault detection to safe restoration repeatedly exceeds the allowed window.
- Refine: Method maintainers perform revision and testing Work. A wording clarification can yield a later MethodDescription while the same Method remains current. Adding an earlier isolation action or changing a classification checkpoint can instead change identity-bearing Method semantics; decide under
A.3.1whether the result is a refinement, substitute, or distinct successor Method, and useB.1.5if its composition changes. Then identify the MethodDescription episteme that describes the chosen Method. - Deploy: A named publishing team performs publication or release Work for the later MethodDescription and, where needed, configuration or training Work for renewed Method use. Decision results, authority, acceptance, admission, and later Work that enacts the Method remain separate. Completed maintenance Work is never revised.
Adaptive-specialization note. When the method-instantiation slice carries a bounded-specialization claim for one declared task family, that claim SHALL name the narrower higher-fit specialist method or specialist portfolio being activated, the refinement budget being spent, the escalation or commit checkpoints, and the fallback when that method fails. If the method update is being used as evidence of specialization, the note SHALL keep the bearer of that specialization explicit: the holder, dyad, team, or scoped portfolio carries the claim; the method is only one selected vehicle. This keeps method evolution reviewable as bounded specialist acquisition rather than as hidden budget inflation.
- Context: A field-maintenance organization uses a declared inspection-and-repair Method (
B.4:6 - Bias-Annotation
| Bias | Symptom | Correction |
|---|---|---|
| Self-evolution bias | The subject is said to observe, refine, or deploy itself, so the performing System and its Work disappear. | Name the changed subject and distinct acting side. Ordinary actor wording can remain short. When one particular dated U.Work is identified, recover each performer’s A.13 core and independently admit the occurrence under A.15.1; add F.6 only when precise assignment-bound attribution is current. A short account may omit an unused assignment identifier only when every relation it consumes remains recoverable. The acting side may be external, or it may be an exact distinct subsystem or part established through the A.12 reflexive split. |
| Design-time/run-time smear | A live operational change is treated as if it had already updated the design-time episteme, or a design-time edit as if it had already changed the System in operation. | Keep the design-time episteme, run-time System or use, deployment Work, evidence relation, and renewed use distinct. |
| Method/description smear | A MethodDescription edit is called a Method change, or a changed Method is hidden as a documentation update. | Test Method identity under A.3.1 and composition under B.1.5; identify MethodDescription editions separately under A.3.2 and C.2.1. |
B.4:7 - Conformance Checklist
- CC-B4.1 (Proportional loop integrity): Record the actual path from observed basis through change to renewed use. A complete phase-by-phase trace is required only when a named relying decision, assurance case, audit, or replay needs it. Do not invent a phase or claim completion merely to fill a loop.
- CC-B4.2 (Subject identity): Name the exact subject kind and apply its direct continuity rule: System continuity or transformation; episteme predecessor, successor, or edition; Method identity, refinement, substitution, or successor; MethodDescription edition; or separate dated Work occurrences.
- CC-B4.3 (Acting-side distinction): Work that observes or changes a subject MUST have an identified performing System distinct from the changed subject in that Work account. Internal adaptation is permitted when
A.12establishes exact distinct subsystems or parts and their independently obtaining parthood. Every particular datedU.Workreuses each performer’s A.13 core and is independently admitted under A.15.1; F.6 is added afterward only for precise assignment-bound attribution. Its short B.4 account may omit an assignment identifier unused by the receiver only when every consumed relation remains recoverable. - CC-B4.4 (Adaptive-specialization anchoring): When the knowledge-instantiation or method-instantiation slice carries a bounded-specialization claim, that claim MUST name the declared
TaskFamilyorTaskSignature, the work-measure threshold target, the adaptation budget, and the freshness or provenance basis for reuse. - CC-B4.5 (Adaptive-specialization boundary): The knowledge-instantiation and method-instantiation slices SHALL NOT silently re-govern selector or parity semantics. If transfer, retention, downstream exploitation efficiency, corridor entry, or downside cost are comparison-relevant, the pattern-local note MUST leave those fields recoverable by the downstream
C.22.1,G.5, andG.9patterns. - CC-B4.6 (Phase and transition separation): Operate, Observe, Refine, and Deploy MUST have the distinct outputs and transition conditions stated in B.4:4.3. Evidence use and optional B.4.1 cue routing do not become duplicate phases.
- CC-B4.7 (No success inference): Deployment or publication establishes neither acceptance nor successful renewed use. Record failure, reopening, fallback, or another iteration when that is what occurred.
B.4:8 - Common Anti-Patterns and How to Avoid Them
| Anti-Pattern | Observable symptom | How FPF prevents it conceptually |
|---|---|---|
| The “Immaculate Conception” | A feature or design appears with no observed basis or identity decision. | CC-B4.1 and CC-B4.2 connect the change to an observed basis and state whether the subject continues or has a successor. |
| The “Self-Healing Illusion” | “The system automatically improves itself” hides who or what performed the Work. | CC-B4.3 requires a distinct acting-side System. An internal control or adaptation loop is valid when exact internal participants, their parthood, the Work, Methods, and phase transitions are identified; physical externality is not required. |
| The “Perfect Hotfix” | A quick run-time repair is reported as a complete successful loop, although design repair, evidence, or renewed-use confirmation did not occur. | Record only the urgent observation, change Work, deployment, and immediate result that actually occurred. Later description repair, testing, assurance, and follow-up operation are separate Work and may reopen the loop. A hotfix can compress time, not truth. |
B.4:9 - Consequences
| Benefits | Trade-offs / Mitigations |
|---|---|
| Creates a learning architecture: The loop gives repeated adaptation a readable structure and connects learning to actual change. | Record overhead: A full trace is too heavy for many local changes. Mitigation: keep the account proportional to the receiver and expand it only for reliance, assurance, audit, or replay. |
| Exposes design-reality divergence: Separate phase outputs make stale descriptions, failed deployment, and missing renewed use visible. | No automatic success: The loop cannot guarantee reconciliation. Deployment can fail, evidence can overturn a candidate, and renewed use can reveal another problem. |
| Makes evolution auditable: Named subjects, Systems, Work, identity relations, and evidence let a reviewer reconstruct why a change was made. | Several patterns remain necessary: B.4 coordinates their results; it does not replace the subject’s identity, Work, evidence, publication, or acceptance patterns. |
B.4:10 - Rationale
This pattern operationalizes the Open-Ended Evolution Principle (P-10) by connecting use, observation, explicit change, and renewed use. It does not supply one generic ontology of evolution. Subject patterns decide identity and continuity; Systems perform dated Work; evidence supports relied-on claims; and B.4 makes their repeated coordination inspectable.
B.4:10.1 - SoTA-Echoing
The phase rhythm has historical lineage in iterative cycles such as Plan-Do-Check-Act and Observe-Orient-Decide-Act. B.4 adapts that lineage rather than treating those labels as an ontology: it distinguishes design-time accounts from run-time use, applies a kind-specific identity rule, identifies actual Systems and dated Work, admits internal acting-side splits, and keeps evidence, deployment, publication, acceptance, and renewed use separate.
The result is a practical review language for repeated adaptation. It avoids both agentless “self-evolution” stories and the opposite mistake of requiring every acting System to be external. Canonical means the four questions recur; it does not mean every subject or project follows one identical history.
B.4:11 - Relations
- Operationalizes:
P-10 Open-Ended Evolution. - Uses:
A.4when Observe needs a comparison of a System’s intended design with its actual operating conditions;A.12for external or reflexively split acting sides;A.15.1for dated Work; and the direct subject patterns named in B.4:4.1 for identity and continuity. - Coordinates with:
B.5 Choose the Next Reasoning Contribution (Canonical Reasoning Cycle),B.5.1development states, andB.3 Is This Claim Supported for This Use? — Trust and Assurance Calculus. B.4 does not implement the B.5.1 states one-for-one, and evidence is not a B.4 phase. - Is detailed by:
B.4.1 Publish Candidate Routes for a Stabilized Cue (RoutedCueSet)for optional early cue routing, together with B.4.x instantiation patterns for specific subject families.
B.4:11.1 - Pre-abductive seam compatibility
For early language-state routing, Observe does not have to jump directly into anomaly or hypothesis forms. Observe may publish a PreArticulationCuePack and a RoutedCueSet through B.4.1; a selected route then enters Refine or another fitting pattern. A downstream loop consumes the routed cue publication directly or a later typed publication such as U.AbductivePrompt, as appropriate.
B.4:End
B.4.1 - Publish Candidate Routes for a Stabilized Cue (RoutedCueSet)
Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative
Plain-name. Observe-to-route seam.
B.4.1:1 - Problem frame
Observation rarely yields a ready anomaly, articulated action claim or question, or hypothesis in one step. Between low-articulation cue preservation and endpoint assertions under exact subject predicates, the cluster needs one explicit route-bearing seam that can publish route plurality or route selection without pretending that the cue already satisfies an endpoint predicate.
That seam begins after cue stabilization, with PreArticulationCuePack or an equivalent early form under A.16. Cue preservation may exist before routing. B.4.1 begins only when route publication itself becomes worth making explicit.
B.4.1:2 - Problem
Without a pre-abductive seam, early cue publications are either lost, prematurely forced into late forms such as AnomalyStatement, Characteristic, ActionOption, or requirement language, or they smuggle route selection into cue-pack prose with no explicit route-subject assertion, predicate, and pattern locator.
B.4.1:3 - Forces
| Force | Tension |
|---|---|
| Early capture vs endpoint discipline | Preserve low-articulation cues without collapsing route discipline. |
| Plural route set vs explicit selection | Permit multiple candidate routes while still requiring an explicit selection record when selection occurs. |
| Seam clarity vs new-type inflation | Add a real seam without creating an uncontrolled zoo of new publication kinds. |
| Form vs face precision | Keep route-bearing publication form distinct from the MVPK face on which it is rendered. |
B.4.1:4 - Solution
Use this seam to make the candidate continuations and any selected route explicit after cue stabilization. The pre-abductive route-bearing seam sits inside the language-state cluster, between observation/cue preservation and endpoint subject-pattern entries:
Observe -> Notice -> Stabilize -> Route
Publish the route package as a RoutedCueSet, normally downstream of PreArticulationCuePack.
A robust route package should identify:
- the originating cue pack, if any, or the equivalent early form preserving the stabilized cue,
- the candidate route set,
- the route decision state,
- the selected route, if any,
- the grounds for each live route,
- the conditions that would change route ranking,
- and any typed downstream publication already published.
This keeps later handoff reviewable while leaving downstream claims and results under their applicable subject patterns.
For specialization-sensitive routes, the package should also make explicit the declared task family or utility target, the current budget window, the missing discriminator still needed, and the downstream subject pattern that would become applicable if that discriminator and that pattern’s other entry conditions are satisfied.
B.4.1:4.1 - RoutedCueSet shape
A conforming routed cue set may publish:
sourceCuePackRefcandidateRouteSetrouteDecision?selectedRoute?routeRationale?routeSelectionStatus?multiRoutePolicy?publicationFaceRefs?articulationThresholdStatus?closureStatus?scope?GammaTime?
RoutedCueSet is not itself the late endpoint. articulationThresholdStatus and closureStatus report guard state only; their governance remains with C.2.4 and C.2.5, and route discrimination may additionally cite C.2.6 or C.2.7 when anchoring or representation-factor differences are load-bearing.
candidateRouteSet is the load-bearing core here. routeDecision, selectedRoute, routeRationale, and routeSelectionStatus belong here when route selection is explicit. They do not belong in PreArticulationCuePack. The status says only whether plurality remains open or a route has been selected; endpoint admission, publication availability, current use or retirement, and any actual authority relation remain separate claims under A.16 and their direct patterns. Use sourceCuePackRef when the originating early form is a cue pack; otherwise identify the equivalent early form and the stabilized cue it preserves.
publicationFaceRefs names MVPK faces only when face typing matters for publication or review. Faces are renderings of the routed cue set or of later typed projection publications; they are not the route-bearing form itself.
A multi-route RoutedCueSet is still one governed member. A lineage fork requires distinct successor epistemes or project records under their applicable identity and lineage rules. Use C.2.1 for episteme identity; publication availability remains separate under E.24.PUB.
B.4.1:4.2 - Starter route family and conditional extension species
The candidate route set may contain, among others:
- starter canonical routes:
EvaluativeRouteActionInvitationRouteProblemAbductionRouteMethodWorkRouteRequirementCommitmentRoute
- conditional extension routes for bounded specialization or corridor discovery:
TaskFamilySpecializationRouteAdaptationProbeRouteNonHumanUtilityRouteSubstrateDiversificationRoute
B.4.1:4.2.1 - Specialization-sensitive extension route family
These four routes are not part of the starter canonical core. Use them only when the cue already carries explicit bounded-specialization pressure, corridor-entry pressure, or substrate-fit doubt that subject patterns must be able to recover by value.
Use TaskFamilySpecializationRoute when the cue points toward acquiring one narrower higher-fit specialist lane for one declared task family under budget, where that lane may later resolve into one specialist method, portfolio, or competence bundle. Use AdaptationProbeRoute when the honest next question is whether threshold-reaching specialization is actually attainable under the current budget. Use NonHumanUtilityRoute when the cue suggests a promising utility target outside the current human-default solution corridor but still tied to one declared task family or utility target. Use SubstrateDiversificationRoute when the cue says the current method substrate may be too narrow and a broader or different substrate should be tested before commitment.
Contexts may refine the route family locally, but they shall keep the distinction between early route publication and endpoint governance.
B.4.1:4.3 - Projection discipline
Here projection names route-bounded partialization. The resulting content must be published in a typed publication form, rendered, when needed, on an existing MVPK face. The applicable subject pattern governs the downstream claim.
A routed cue set may support these continuations:
- publish
U.AbductivePromptunderB.5.2.0, - apply
A.6.P,A.6.A, orC.16.Qunder its own entry conditions and produce the sentence, record, or other result that the selected pattern calls for, - or publish another explicitly typed upstream projection.
For a proposed downstream projection, if no typed publication form can yet be named honestly, keep the content in RoutedCueSet; an MVPK face alone supplies no such form.
B.4.1:5 - Archetypal Grounding
Tell. Observation alone is not yet routing. A route requires at least a stabilized cue plus a declared candidate route set.
Show (System). An operator alarm may route toward intervention, rollback, or anomaly investigation without yet becoming work or a requirement.
Show (Episteme). An inquiry cue about a model-vs-observation discrepancy may route toward anomaly framing, opportunity framing, or probe design before a hypothesis exists.
B.4.1:6 - Bias-Annotation
The pattern favors preserving low-articulation cues and publishing route plurality explicitly. The counter-bias is explicit as well: routing must still state why one route is live and why one route was selected if selection occurred.
B.4.1:7 - Conformance Checklist
CC-B.4.1-1Observe output SHALL NOT be forced directly intoAnomalyStatementwhen articulation threshold is not yet met.CC-B.4.1-2A routed cue set SHALL name itscandidateRouteSet.CC-B.4.1-3When route selection occurs,routeDecision,selectedRoute, androuteRationaleSHALL be explicit.CC-B.4.1-4publicationFaceRefsMAY be named, but route-bearing form and publication face SHALL NOT be collapsed.CC-B.4.1-5RoutedCueSetSHALL NOT be treated as establishing a late endpoint result.CC-B.4.1-6When a specialization-sensitive route is kept live, the route package SHALL name the declared task family or utility target, the current budget window if known, the missing discriminator still needed, and the downstream subject pattern that would become applicable if the discriminator and that pattern’s other entry conditions are satisfied.
B.4.1:8 - Common Anti-Patterns and How to Avoid Them
- Anomaly inflation. Treat every early cue as already an anomaly statement.
- Cue-pack route smuggling. Hide route decision or route rationale upstream in
PreArticulationCuePack. - False single-route certainty. Pretend one route is obvious when multiple candidate routes are still live.
- Projection capture. Treat a typed downstream projection publication or its MVPK face as if it already governed the endpoint family.
B.4.1:9 - Consequences
The benefit is an admissible early seam for language-state trajectories and a cleaner bridge from cue preservation to later patterns. The trade-off is one more explicit publication form and one more explicit route declaration.
B.4.1:10 - Rationale
B.4.1 provides the route-bearing seam between cue preservation and endpoint or abductive entry. It keeps route publication explicit without forcing cue packs to become route records.
B.4.1:11 - SoTA-Echoing
This matches practice in incident triage, exploratory design, model probing, and embodied cue work, where routing follows stabilization rather than appearing fully formed at first observation.
B.4.1:12 - Relations
- Builds on:
B.4,C.2.2a,A.16,A.16.1,C.2.LS. - Coordinates with:
A.16.0,C.2.4,C.2.5,C.2.6,C.2.7,B.5.2.0,B.5.2,A.6.P,A.6.A,C.16.Q,A.15,F.9.1. - Constrains: pre-abductive route publication.
B.4.1:13 - Worked Route Sets
B.4.1:13.1 - Multi-route operator case
An operator alert note records a service-latency rise after a configuration change and a response-time clause whose applicability to this service is unresolved. The operator may admissibly publish a route set containing:
ActionInvitationRoute,ProblemAbductionRoute,- and
RequirementCommitmentRoute.
Keep the plurality explicit until a selected route is justified. The missing discriminator for RequirementCommitmentRoute is whether the clause covers this service and incident window. If it does, use A.2.8 for the question of an actual duty; the latency cue can still support intervention and explanatory inquiry.
B.4.1:13.2 - Inquiry case
A conceptual mismatch may route simultaneously toward:
- explanatory inquiry,
- probe design,
- and later lexical repair.
This is admissible only if the route rationale makes the plurality explicit rather than hiding it under vague prose.
B.4.1:13.3 - Invalid direct jump
It is invalid to treat a routed cue set as if it were already a hypothesis, a gate, or a work plan. The route-bearing publication form records candidate continuations; the applicable subject pattern governs the downstream result.
B.4.1:13.4 - Specialization-route and nonhuman-utility split
A routed cue set for a new task family may admissibly keep ProblemAbductionRoute, TaskFamilySpecializationRoute, and NonHumanUtilityRoute live together. The point is to preserve the declared task family, utility target, current budget window, missing discriminator, and possible corridor-entry load without laundering those routes into a premature prompt, selector, or policy choice.
B.4.1:14 - Keeping route plurality useful
A routed cue set stays useful only when route plurality, route grounds, selection status, and any current-use or retirement claim remain explicit.
B.4.1:14.1 - Minimal route package
Use the minimal route package in §4 (Solution).
B.4.1:14.2 - Selected route is not endpoint governance
Even when one route is selected, the routed cue set remains a seam publication form. Apply a downstream subject pattern when its entry conditions are met; that pattern governs the next claim or result.
B.4.1:14.3 - Review prompt and threshold reminder
A reviewer should check whether the selected route is justified by the published cue pack or equivalent early form and whether suppressed alternative routes were genuinely considered rather than silently erased. If the articulation threshold required for a proposed late prompt, requirement, or work claim is not yet met, keep the publication early.
B.4.1:14.4 - Deferred selection and route splitting
Deferral is admissible when route plurality and missing discriminators are published. It is not admissible when one route is silently assumed while the publication still speaks as if the question were open.
One cue cluster may also split into several routed cue sets if different sub-cues support different destinations. The split should be published explicitly so that later readers do not assume that one route exhausted the whole original cue complex.
B.4.1:15 - Migration and worked continuation boundaries
B.4.1 governs route publication. Use the applicable subject patterns for abductive reasoning, lexical repair, deontic commitment, and work execution when their entry conditions are met.
B.4.1:15.1 - Migration from anomaly-first prose
Older anomaly-first language should be migrated into route publication when the publication does not yet meet anomaly-governance entry conditions.
B.4.1:15.2 - Intervention vs inquiry split
An operator-facing disturbance may legitimately support both:
- an immediate intervention-oriented route,
- and a slower explanatory route.
B.4.1 preserves both continuations with their own grounds and selection conditions.
B.4.1:15.3 - Requirement-route overreach
A route set that includes RequirementCommitmentRoute should not be read as if the requirement already exists. The route is one admissible continuation; the requirement or commitment claim is decided under its own subject pattern.
B.4.1:15.4 - Leaving the seam
Continue under a later subject pattern when its own entry conditions are met. Typical questions and entry requirements are:
- relation-bearing wording whose direct relation, participants, direction, or required detail remain unresolved:
A.6.P; - evaluative wording with enough articulation to name the bearer, effective scheme, probe/model frame, comparison frame or
none, ClaimScope, and at least one candidate evaluative family:C.16.Q; - affordance-like or action-first wording with enough context to compare its consequential meanings:
A.6.A; recover the supported claim or question, or the exact fact that would distinguish the alternatives, then apply its subject rule; - a declared prompt species, stable open question, scope, and provenance, with the articulation and closure conditions for rival answers to remain live:
B.5.2.0; - an explicit requirement or commitment claim over its actual subject: its requirement-facing pattern; use
A.2.8for a question about an actual individual duty; - or an alignment question involving Method, intended WorkPlan, or actual Work:
A.15; useA.3.1,A.15.2, orA.15.1directly when only the Method, WorkPlan, or dated Work is in question.
ActionInvitationRoute names the route to this wording-recovery use; it does not require an invitation occurrence. A.6.A can return an open question without settling its answer. If the selected next-use entry conditions cannot yet be established, keep the governed publication in this seam with its route plurality visible.
B.4.1:20 - Route Evidence and Discrimination Package
B.4.1:20.1 - Evidence-per-route rule
Each live route in a routed cue set should cite the cue grounds that actually support it. Where those grounds are not yet published, complete the route account so readers can assess the support.
B.4.1:20.2 - Discriminator publication
When a route set remains plural, authors should name the discriminator they are waiting for: a missing anchor, contrast, measurement, witness, articulation threshold, closure condition, or other explicit facet transition. This tells later readers which fact or facet change would justify reconsidering the route set.
B.4.1:20.3 - Multi-route state is not yet a lineage fork
One routed cue set may keep several candidate routes live without yet forking lineage. A fork occurs only when distinct successor epistemes or project records are identified under their own identity rules and their preserved and lost content and any exact lineage relations that obtain are stated. Publication availability and any responsibility or authority handoff remain separate claims.
B.4.1:20.4 - Projection restraint
A typed downstream projection publication or prompt may be shown as one admissible continuation; the other live routes and their grounds and discriminators shall remain readable.
B.4.1:20.5 - Review test for false single-route certainty
Ask: if the selected route were denied, would the publication still contain enough information to explain the other live routes and the discriminator that would separate them? If not, the route set is under-published and has collapsed too early into one favored continuation.
B.4.1:End
B.5 - Choose the Next Reasoning Contribution (Canonical Reasoning Cycle)
Type: Method-description pattern Status: Candidate Normativity: Normative unless marked informative
B.5:1 - Problem frame
Use this pattern when an engineer or researcher has a question, surprising result or promising construction, but the next useful contribution is unclear. They may need to formulate a better question, construct something, prove a claim, explain an observation, or test a consequence. Reasoning is the broader activity; this pattern governs the choice and connection of those contributions in an inquiry.
When work continues without a question because its outcomes are treated as ordinary, B.5.PI provides an earlier entry. An ordinary handover or demonstration can yield a question or an early cue without an already recognized anomaly. Use that contribution here when reasoning can take it further.
First useful move. State what you want to understand or make possible. Ask whether an available result already answers that question. If it does not, name the missing result and try one operation that could obtain it. Return what that operation established and the next question, if one remains.
For example: “We need the highest component temperature, but our model reports a mean. Two states with the same mean can have different maxima. Next, determine which temperature differences this arrangement admits.” This already redirects the inquiry before another model fit.
The practical gain is a useful answer or a better-founded next question. A correct answer to an inadequate formulation can otherwise consume the inquiry’s effort.
Use a known calculation, proof, observation or qualified Method directly when it already answers the question. A separate cycle description adds nothing in that case. Detailed mathematical techniques, physical modeling and domain validation remain with their disciplines.
B.5:2 - Problem
A hypothesis-led inquiry has a productive structure: propose an explanation, derive consequences and compare them with observations. Trouble begins when this structure is made the only permissible form of reasoning. Constructing a mathematical object, finding a counterexample, exploring a phenomenon or discovering that the intended quantity is not recoverable can change the question before an explanatory hypothesis is appropriate.
A second difficulty survives even when result production becomes cheap. More proofs, simulations or candidate designs do not by themselves say which questions matter, what an argument explains, or which construction should be developed. The inquiry needs ways to inspect and change its own formulation and repertoire while retaining adequate results.
B.5:3 - Forces
| Force | Tension |
|---|---|
| Purpose and discovery | A question directs effort, while a useful result may reveal a better question. |
| Construction and justification | A new object or conjecture opens possibilities; its properties and applicability still need the appropriate argument. |
| Abstraction and use | A simpler representation saves effort, while its lost distinctions can decide the intended use. |
| Rigor and affordability | Formalization, computation and observation can expose errors, but their whole burden must serve the question. |
| Current result and future possibilities | A sufficient answer deserves a stop; a retained construction may enable a different worthwhile inquiry. |
B.5:4 - Solution
Choose reasoning by the result the current question needs. The abductive–deductive–inductive loop remains the canonical route for hypothesis-led empirical inquiry. Its short mantra is Propose → Analyze → Test: propose a conjecture, derive consequences that make a test interpretable, and compare them with relevant observations. Construction, exploratory observation and question formation can precede, interrupt or follow that route. A mathematical inquiry may finish with a construction, counterexample or proof.
B.5:4.1 - Form or recover the question
Say what an answer would help someone understand, construct, explain, decide or investigate. An epistemic aim, such as exposing an obstruction or finding a more informative theory, can justify inquiry without an immediate product application. Recover an adequate existing answer before commissioning new work.
Separate the subject from its description, the intended result from a convenient proxy, and established premises from assumptions. Use ordinary language, a sketch or a small mathematical example at the precision needed to expose the difficulty.
If there is no current question, B.5.PI can connect one ordinary work occasion with the use of its result, including adjustments that made the work succeed. It may produce a question, preserve an early cue, or justify continuing without change. This entry does not require a monitoring duty or turn every action into an audit.
If a participant senses that an account misses something but cannot yet express what, B.5.EA helps develop a correctable distinction from their experience. Use the resulting question or contrast here; a better expression does not by itself establish a claim about the world.
An expressible account can still omit a consequential relation. B.5.FM:4.2.1 uses a small conceptual scheme to find a question through that relation, while distinguishing an unknown contribution from an inapplicable scheme. Use an already adequate answer directly.
When the current formulation is inadequate, vary a consequential element. Useful operations include:
- change the quantity or distinction that the answer must preserve;
- restrict or widen a domain, scale, boundary or assumption;
- construct a small case that defeats the current claim;
- introduce a new object, relation, operation or representation and ask what it makes expressible;
- ask what observation or argument would distinguish the remaining possibilities.
Keep a changed formulation when it changes the construction, evidence, explanation, comparison or next action.
C.22.2 helps make a problem-side claim and its next use inspectable. C.29 helps when choosing a mathematical lens or its mapping is the live question. Use their supplied actions at those boundaries; an ordinary mathematical problem need not acquire a separate card.
When you can follow a concept’s explanation but cannot yet interpret the situation through it, use B.5.4 to construct and test the correspondence. Return with the interpreted participants and relations, then choose the reasoning contribution the question needs.
B.5:4.1.1 - Propose a first model
When the situation has no usable model yet, begin with the contrast the answer must resolve. Inspect one case or the actual arrangement. Describe what happens and which proposed change or comparison matters. Separate observations from the explanation you are about to try.
- Choose what must remain distinguishable. Identify participants, states or quantities whose differences could change the answer. Use observed differences and possible interventions to propose a boundary: what can vary separately, what connects those parts, and what surrounding conditions affect them? Keep a distinction when you can explain its consequence for the question.
- Propose how they are connected. Draw or state a dependency and explain how it could produce the observed behavior. Use the relevant subject account to identify the interaction and what it preserves or changes. If that account is unfamiliar, use §4.3 to recover its concept of use. Mark the assumptions that let you omit other interactions or treat a quantity as fixed. For a physical model, use physical knowledge to choose the law that the mathematical account will express.
- Obtain a cheap consequence. Follow the proposed relation far enough to answer a useful part of the question. A direction of change, limiting case or rough bound may suffice before parameter fitting or detailed computation. Show which premise makes that consequence follow.
- Challenge a consequential choice. Ask what observation, omitted interaction or changed condition could defeat the answer. Compare a plausible alternative when the observations leave materially different explanations. Revise the model or obtain the missing observation when that difference matters.
Return the provisional model and what follows under its assumptions. If a missing domain account or formal construction prevents the next contribution, use A.15.9 to request that specific help from the working description. Section 5.6 shows this entry before a heat-transfer calculation has been formulated. B.5.FM shows how to choose the model’s participants and relations and use them to derive a consequence, in physical and formal problems.
B.5:4.2 - Perform the contribution that is missing
The following are common alternatives, not an exhaustive classification or a sequence to complete.
| Missing result | Useful operation | What the result can establish |
|---|---|---|
| An object, procedure or structure with desired properties | Construct it from stated elements and permitted operations; test examples and counterexamples; prove the relevant properties or expose the obstruction. | A construction, existence or impossibility result under its mathematical premises. |
| A consequence or a mathematical justification | Make premises explicit and derive the consequence. Identify the step that carries the argument and the conditions on which it depends. | The implication or theorem within the stated domain and inference rules. |
| An explanation of an anomaly, opportunity or probe result | Use B.5.2 to generate serious rival conjectures and compare their explanatory fit, constraints and prospects for criticism. | A qualified explanatory conjecture, with its grounds and unresolved rivals. |
| A better description of an insufficiently understood phenomenon | Make a purposeful observation or exploratory measurement; vary a condition and inspect what becomes distinguishable. | Observations and possible regularities that can generate or change questions. |
| An empirical consequence of a conjecture | Derive the expected contrast, obtain relevant observations and compare the actual result with it. | Bounded corroboration, a discrepancy or a qualified basis for rejecting or revising the claim. |
Recover a construction before trying to execute it. Use this continuation when the source names a desired object or property but you cannot yet obtain the result needed by the question. B.5.RC expands the method below with worked cases and explanations of shared prerequisites, alternative constructions and missing operations.
- Identify the starting objects or data that are available. State what must be produced and which property the receiving use needs.
- Find the source’s operations for producing or combining those objects. For each needed operation, recover its inputs, application conditions and output. Keep a statement that an object exists with certain properties as an existence claim; seek a way to obtain an instance when the next use requires one.
- Work backward from the desired result to the required intermediate results and starting inputs. Preserve joint dependencies and alternative ways where the source supplies them. A missing operation is a question for the source or the relevant specialist; a rule you propose is an addition to be tried and justified.
- Work a small instance from the available inputs, applying each recovered operation when its conditions hold. If the notation prevents the operation, use A.6.3.RT to prepare and compare a more usable expression. For a mathematical account, use its formation and equality rules; identify where a proposed identification changes the operations or property being used.
- Establish the needed property by the appropriate argument or test. Return the construction and what follows under its premises, or the input, rule or unsupported transition that still prevents the result. Stop when this supplies the receiving use.
For example, a stand specification calls for a portable display. Its assembly rules allow a compatible upright to be joined to a base and a compatible panel to be attached to that upright. Those rules yield the assembly order and the connections to check. Portability remains a requirement to check on the resulting design. If the supplied panel does not fit, the next contribution is a compatible panel, an adapter with its connection rules, or another assembly design. The construction result here is the assembly design; whether the erected stand is stable needs its physical-design argument.
Construction and deduction can work together: an auxiliary object can make a proof possible, and a theorem can suggest a new construction. Novelty does not belong exclusively to one inference type.
For a hypothesis-led test, derive the consequences needed to interpret the test. Check whether those consequences conflict with retained premises, and follow their implications through the part of the model relevant to the question. Return inconsistent premises for revision before relying on their joint prediction. Keep the prediction, observations, measurement conditions and inference recoverable before treating the outcome as corroboration. A simulation establishes a result of the simulated model; applying it to the physical target needs a supported model–world correspondence.
An exploratory finding can supply a hypothesis. Its subsequent empirical assessment must account for how that hypothesis was obtained and for the dependence or selection involved. Use the domain’s appropriate design and inference; merely relabeling the same data as a later test does not create independent evidence.
A bounded result may be sufficient at any of these contributions. Assurance belongs to the particular claim and receiving use under B.3 and B.3.3, including the applicable domain proof or validation obligations.
B.5:4.3 - Make the result understandable for its use
Explain what was obtained, why the decisive step works, and where the result can be used. The needed depth depends on whether the receiver will apply, criticize, extend or teach the argument.
Recover the argument needed for that use. Begin with the conclusion or proposed change the receiver needs to understand. B.5.RA develops both the main reason for the result and the local transitions needed to use it.
- Read the claim with its domain and conditions. For a mathematical statement, recover the meanings of its objects and quantifiers.
- Work backward from that conclusion through the intermediate claims or constructions it uses. At each needed transition, identify the premises, the operation or inference, and what it establishes. Follow a shared premise wherever the conclusion depends on it; keep jointly needed premises together.
- Reconstruct a transition the receiver cannot follow from the source’s definitions, rules or worked cases. Obtain the missing explanation or specialist contribution when those do not suffice. A conditional argument can be useful while one premise remains to be established; state that premise and the consequence its failure would have for this use.
- If a premise or requested result changes, use B.5.RR to follow the affected reasoning and derive what still follows. Preserve joint prerequisites and sufficient alternatives. Stop at a sufficient argument for the receiving use or a named unsupported transition. An unchanged, adequately supported part can be reused; a full reproof is needed only when the question calls for it.
For instance, a team expects to recover a drawing because a backup exists. Recovering that conclusion requires the needed data in a readable format and an available way to decode it. If the backup is encrypted and its key is unavailable, the next question concerns access to that key or another copy of the drawing. Repeating the fact that a backup exists leaves that prerequisite unresolved.
When beginning with an unfamiliar theory, reconstruct its concept of use for one working question. State what the practitioner wants to explain, predict, construct or decide; which objects and relations the theory lets them describe; what information and operations the application needs; and how its result answers that question. Use a source application when it answers the question. Otherwise propose a small application from the theory’s stated objects and operations, work it through and test the correspondence. Keep that constructed trial distinguishable from an application already supported by the source. The first result is a usable explanation of that application, or the particular missing premise or operation that prevents it. Use the intended application to choose what to learn next. Study the construction deeply enough to perform or change the contribution the work requires. B.5.TU develops this application-construction method, including recovery of the needed operations and use of a correct result that answers only part of the receiving question.
To compare theories or ways of using them, ask the same question of each account. Preserve each source’s meanings while comparing what is given, what operations are allowed and what answer follows. If the results differ, identify whether the difference comes from the question, assumptions, mathematical structure, inference or proposed physical mechanism. If one account answers a different question, state that complementary use. Choose or change an account for the distinction the receiving work needs. Use C.29 for a proposed mathematical-lens transfer or local candidate choice; domain prediction and intervention claims still need their applicable Methods and evidence. B.5.TC develops the comparison: reconstruct both applications, work a common case, distinguish theoretical differences from approximation or execution, and return the use or inquiry that follows.
When the correspondence between a formal account and its intended use is the difficulty, reconstruct one small instance. Name the variables and their domains, the given inputs, the assumptions and permitted operations, and the statement the calculation or proof establishes. Relate the decisive quantities and conditions to the intended use. A source’s worked case can supply this reconstruction; recover the omitted step if the receiver cannot yet carry it out.
Challenge the correspondence with a case that could change the answer. Look for a formally admissible answer that the intended use excludes, or two situations identified by the representation that require different answers. If this exposes a mismatch, repair the domain, constraint, quantity or correspondence, or use the existing result for a weaker question that it does answer. A relaxation can remain useful as a bound even when its optimizer cannot be enacted. The worked case below makes both uses explicit.
For a physical application, connect the mathematical objects and quantities to the phenomenon, measurement and operating conditions. Ask which approximation, omitted interaction, scale or uncertainty could change the conclusion. A rigorous derivation from a model and evidence that the model applies answer different questions.
Use the explanation to test the formulation: does the result answer the intended question, or only the conveniently formalized one? If a distinction was lost, determine whether the use can tolerate that loss, whether a bound suffices, or whether another representation is needed.
B.5:4.4 - Settle the question or change the next inquiry
Return the result at its supported scope. Stop when it answers the current use. Continue only for a remaining question whose possible answers could change understanding or action and whose investigation is worthwhile under the available conditions. Account for the effort of learning, obtaining, explaining, checking and maintaining the result as well as calculation cost.
When the result exposes a limitation, identify what must change:
- The answer or construction for the same question: repair it or investigate a serious alternative.
- The formulation: revise the target, assumptions or boundary and state which earlier results still apply.
- The available Methods or ways of constructing candidates: compare retaining, modifying or extending that repertoire. E.23 supplies improvement under an appropriate evaluation; C.18 applies when generation rules, retained alternatives or the effective space of possibilities are the question.
- A participant’s ability to contribute: distinguish the capability question from missing access or support; use E.23.CAE and E.23.CDI where their conditions hold.
Use B.5.QD when the next question is still unclear. Recover a failed dependency or a newly available construction, specify the answer it makes worth seeking, and work a revealing case. This can develop the inquiry after a success as well as a counterexample.
Use E.10.DEV if “development” hides the intended subject and C.36 for an actual cultural-generation, transmission or selection question.
Retain a construction or unresolved alternative when a named future inquiry makes keeping it worthwhile. C.17 can characterize novelty, value and diversity on a declared basis; C.18 distinguishes the archive from a comparison front and a new point from a change in admissible possibilities.
B.5:4.5 - Organize human and AI contributions around the work
Calculation, conjecture, proof, explanation, criticism and question formation may be performed with different combinations of people, AI and other tools. Choose that allocation from their actual capabilities, available support, constraints and the evidence needed for the receiving use. Revisit it when those conditions change.
When the question depends on a result from another practice, use A.15.9 to use the available answer or select a worthwhile missing contribution. State the working question, available inputs, result needed and intended use in terms the receiver can check. If the formal formulation is itself missing, ask the mathematician, physicist or supported AI for that formulation and its correspondence to the working question.
For an engineer, derive the needed capability from representative later work: what must this person be able to understand, ask, construct, criticize or arrange with the assistance that will actually be available? The answer can include interpreting a proof’s central idea or recognizing that a measured proxy omits the intended quantity, even when a tool performs most calculations. It can also justify deeper mathematical study when constructing or modifying the theory is the required contribution.
When assessing that capability, use representative work under the declared support and inspect the person’s relevant contribution. A completed AI-assisted report alone leaves that contribution underdetermined.
B.5:5 - Archetypal Grounding
B.5:5.1 - A counterexample becomes a constructive mathematical question
An engineer models pairwise incompatibilities with a finite simple undirected graph and asks, “Does connectedness let us divide the vertices into two groups with every edge crossing between groups?”
A triangle is a counterexample: putting the first two adjacent vertices in different groups forces the third to conflict with one of them. This refutes the universal statement but leaves a useful question: which obstruction prevents such a partition, and can we construct either the partition or a witness of failure?
Build the tree by keeping an ordered waiting list. The neighbours of a vertex are the vertices joined to it by an edge.
- Choose any unseen vertex as a root, mark it seen, give it depth 0 and put it on the waiting list.
- Remove the first waiting vertex. For each of its unseen neighbours, mark that neighbour seen, record the removed vertex as its parent, give it the parent’s depth plus 1, and append it to the waiting list. A vertex already seen keeps its first parent and depth.
- Repeat step 2 until the list is empty. If an unseen vertex remains, start a new root and repeat; this covers disconnected components and isolated vertices.
This is breadth-first search: a discovered vertex waits behind the vertices already waiting. The recorded parent edges form a tree in each component. Assign even-depth vertices to one group and odd-depth vertices to the other. If every graph edge joins opposite parities, these groups give the partition. If an edge joins equal parities, write each endpoint’s chain of parents back to the root. Keep the two paths up to their common vertex of greatest depth, discarding the shared part beyond it. The retained paths have an even total length; the extra edge closes a simple odd cycle. An odd cycle cannot alternate between two groups all the way around. Thus the procedure returns either a two-colouring or an odd-cycle witness.
For a worked traversal, take vertices A–F and edges AB, AC, BD, CE, DF and EF. Start at A and inspect neighbours alphabetically. The waiting list changes as follows; the processed vertex is the parent of each newly found vertex in that row.
| Processed vertex | Newly found vertices and depth | Waiting list after processing |
|---|---|---|
| A | B, C at depth 1 | B, C |
| B | D at depth 2 | C, D |
| C | E at depth 2 | D, E |
| D | F at depth 3 | E, F |
| E | None; F was already seen | F |
| F | None | Empty |
A has depth 0, so the groups are {A,D,E} and {B,C,F}; each of the six edges crosses between them. Now add DE. Its endpoints both have depth 2. Their parent paths D–B–A and E–C–A, joined by DE, give the five-edge cycle D–B–A–C–E–D. The added edge therefore prevents the requested two-group partition.
The decisive idea is parity plus a tree-path construction, not the enumeration of many successful examples. The result answers a mathematical question without an empirical test. To use it for allocation, separately establish that vertices represent the relevant items and edges the actual pairwise incompatibilities. If three-way constraints matter, that application question must change.
The concrete practice targets are to explain the obstruction, construct a partition or failure witness for another finite graph, and handle disconnected components. Assess those capabilities on a changed graph with the references and assistance permitted in the intended work.
B.5:5.2 - A physical question changes the representation
In a constructed engineering case, a cabinet contains two components. The intended question concerns the hottest component, but a proposed lumped model reports only their arithmetic mean temperature.
Let the modeled component temperatures be T1 and T2, with mean m = (T1 + T2)/2. The states (20,80) and (50,50), in degrees Celsius, both give m = 50. Their maxima are 80 and 50. A stipulated threshold of 60 therefore gives different classifications. On a state set containing both pairs, no function of m alone can recover the maximum or that classification.
A constructive repair retains the signed contrast d = (T1 − T2)/2. Then T1 = m + d, T2 = m − d, and max(T1,T2) = m + |d|. If an independently supported bound |d| ≤ Δ holds for the physical conditions, m + Δ is an upper bound within that model. Otherwise the contrast has to be estimated or measured, or the inference restricted.
The next physical inquiry is concrete: which temperature differences are possible under the actual loading, coupling and time window; how well does one temperature represent each component; and what measurements and error bounds cover the hottest relevant region? Compare a direct measurement, a two-state model and a qualified conservative bound by the evidence each requires and the decision each can support. Use existing adequate physical knowledge before selecting another experiment.
The mathematical argument exposes the lost information. For physical use, justify the two-temperature approximation. A more accurate fit to the same mean cannot settle that lost distinction. The first useful return is the changed quantity and representation question plus the physical premise that would distinguish the continuations.
B.5:5.3 - The hypothesis-led route remains short
A service has unexplained latency spikes. B.5.2 supplies a qualified backup-interaction conjecture and serious rivals. Derive an observable contrast between backup and comparison intervals, accounting for traffic and other relevant conditions. If the requisite observations exist, compare them under the domain’s inference Method. If they do not, the result can finish as a qualified conjecture and a specified missing test.
A separately qualified operational workaround may already answer the immediate service question. Using it does not require pretending that the causal explanation is established or rerunning a sufficient result through every reasoning contribution.
B.5:5.4 - A relaxed problem supports a different use
A planner must choose whole jobs for one worker’s four-hour window. At most one A-job is available; it takes three hours and has stipulated value 5. At most two B-jobs are available; each takes two hours and has stipulated value 3. For this constructed problem the values and durations add, and the question is which choice satisfying the stated availability and time limits has greatest value. The reader needs elementary algebra and can enumerate the few integer choices.
Let x and y count A- and B-jobs. The intended constraints are x in {0,1}, y in {0,1,2}, and 3x + 2y <= 4; maximize V = 5x + 3y. An AI-assisted calculation instead allows real x and y with 0 <= x <= 1 and 0 <= y <= 2. It returns x = 1, y = 0.5, V = 6.5.
Recover what that calculation establishes. From the relaxed time constraint, y <= (4 - 3x)/2, so V <= 6 + 0.5x <= 6.5. The returned real-valued pair attains this bound. This is an optimum of the relaxation. The proposed half B-job is excluded by the intended whole-job condition.
For the whole-job question, x = 0 permits at most y = 2 and value 6. With x = 1, the remaining hour permits y = 0 and value 5. Two B-jobs therefore attain the integer optimum 6. The human or tool doing this reasoning can check both feasibility and the comparison directly.
The relaxation still answers a useful question: can any permitted whole-job choice reach value 7? Every integer choice is also feasible for the relaxation, whose proved upper bound is 6.5, so the answer is no. Choosing a realizable assignment needs the integer result; ruling out value 7 needs only the upper bound. With five hours instead, the same argument gives V <= 7.5 + 0.5x <= 8. The choice x = 1, y = 1 attains value 8 in both formulations. The planner can use that relaxed optimum as the whole-job answer because this returned choice satisfies the integer conditions.
Here the human–AI division follows the contribution being sought. A planner can use assisted optimization while being able to state what counts as a whole job, recover the constraints actually solved, and distinguish an attainable choice from an upper bound. If the required work is to develop the optimization Method, its construction and proof become additional capability targets. An exercise can change the time window or divisibility condition and ask the learner to choose the formulation and explain which result answers the question.
B.5:5.5 - Understand which composition a theory permits
A practitioner wants one input to feed two operations. Let X, Y and Z be distinct atomic types, with available operations f: X → Y and g: X → Z. A cartesian account supplies copying, Δ_X(x) = (x,x). The composite (f × g) ∘ Δ_X returns (f(x),g(x)) from one input.
Compare an account generated only by f, g, identities, serial composition, tensoring and exchange of factors. Here f ⊗ g runs the two operations on separately supplied inputs, X ⊗ X. Every permitted generator preserves the number of atomic factors; composition and tensoring preserve that property. Therefore those operations cannot construct X → Y ⊗ Z. The missing contribution is a second input or an additional copying operation.
The receiving work determines whether copying its input is admissible. The comparison exposes that requirement before selecting an implementation. Baez and Stay, §2.3, supplies the cartesian/monoidal distinction; the generated-operation case above makes its use explicit.
B.5:5.6 - Choose a first physical model before commissioning a calculation
An engineer is asked whether a stronger external fan can bring an overheating component below 65 °C. In this constructed case, inspection finds the component attached to a metal case through a pad; the fan blows over the outside of the case.
Begin by tracing where heat is generated and how it could leave. The pad suggests a path from component to case, followed by transfer to the surrounding air. Keep the component, the case at the attachment and the air distinguishable: they can have different temperatures, and the proposed fan change acts at the case–air part of that path. Treating the whole device as one temperature would hide the difference relevant to this decision.
Try a steady heat-transfer account first. Assume constant component heating and approximate all generated heat as passing through the pad to the case, with an unchanged linear conductance along that path. The physical premise is that, for a fixed conductance, carrying the same heat per second requires the same temperature difference. OpenStax, University Physics volume 2, §1.6, equation 1.9 explains that relation for a uniform conducting layer. Approximating this assembly by such a path is the engineer’s model choice; inspect bypass paths and contact behavior when assessing it.
Model the case as losing heat only to that air through temperature-driven transfer. At equal case and air temperatures this outward transfer is zero, so a steady case receiving positive heat must remain warmer than the air. The fan increases exchange with the air; air temperature is the ideal lower limit for the case in this model. The same OpenStax section, introduction and “Convection” explains the temperature-difference dependence and fan-driven exchange.
Suppose the steady readings are 80 °C at the component, 25 °C at the case attachment and 20 °C in the surrounding air. Take these values as exact for the first conditional calculation. The component–case difference is 55 °C. Under the proposed model it remains 55 °C when only external cooling changes. Even ideal cooling of the case to the 20 °C air therefore leaves the component at 75 °C. Improving only this part of the heat path cannot meet the 65 °C target under those assumptions.
This result redirects the design question toward the component–case path, a new direct heat path or reduced heating. It also identifies what could invalidate the estimate: direct airflow onto the component changes the assumed path, while temperature-dependent heating or conductance changes the fixed-difference argument. For the real device, check measurement uncertainty and those assumptions before relying on the bound. A useful specialist request is now: ‘Given this assembly and load, can the component stay below 65 °C after improving its contact to the case; which additional observations would settle that?’ The engineer can request that model and calculation without first specifying its equations.
B.5:5.7 - Recover an argument, then change its starting point
A reader can use elementary algebra and wants to understand and adapt the claim that the sum of the first n positive odd integers is n squared, for a nonnegative integer n. Let S(n) denote that sum, with S(0) = 0.
Work backward from the formula. It is enough to establish its initial value and how it changes when one term is added. The next odd integer after the first n terms is 2n + 1, so S(n + 1) = S(n) + 2n + 1. The proposed value has the same change: (n + 1) squared - n squared = 2n + 1. Both start at zero. Repeating that step establishes S(n) = n squared for every finite n.
A square of n by n unit cells makes the same step visible. Add one row of n cells and an adjoining column of n + 1 cells; the resulting square has side n + 1. The added cells give 2n + 1. Counting the cells and the algebraic recurrence explain the same increase in different expressions.
Now the requested sum has n terms beginning at 3: 3 + 5 + … + (2n + 1). Recover which premise changed. These are the first n + 1 positive odd integers with the initial 1 removed. The retained argument therefore gives S(n + 1) - 1 = (n + 1) squared - 1 = n squared + 2n. For four terms, 3 + 5 + 7 + 9 = 24; the old n-squared formula would give 16.
The reusable contribution is the initial-value and increment argument. It lets the reader obtain the changed sum by identifying the changed range and reusing the already established result. A different progression would require recovering its increment before selecting another formula.
B.5:6 - Bias-Annotation
The examples favor discrete construction and a simple physical representation. Other fields may need probabilistic, interpretive, historical or other arguments with different criticism demands. Select the contribution by the actual question and discipline.
Easy-to-produce outputs can dominate attention. Recover the intended epistemic or practical purpose when speed, proof count, a convenient measurement or the current favorite tool starts determining which question is asked.
B.5:7 - Conformance Checklist
- CC-B5.1 — Question and contribution. The practitioner SHALL identify the question, intended useful result and selected reasoning contribution. A conjecture SHALL retain its grounds, rivals and limits; a construction and its asserted properties SHALL remain distinguishable.
- CC-B5.2 — Interpretable hypothesis-led testing. Before claiming empirical corroboration, the practitioner SHALL derive the consequences needed to interpret the test and account for how the tested hypothesis was obtained.
- CC-B5.3 — Claim-specific support. A support claim SHALL identify the actual argument or result, its relevance, scope and limitations. An assurance level, when needed, SHALL follow B.3.3 and the applicable domain criteria.
- CC-B5.4 — Result and continuation. For a performed empirical test, the practitioner SHALL keep its actual outcome, including a failed or inconclusive result, recoverable through A.10. A further inquiry SHALL use the actual result with its limitations and name the remaining question; a sufficient answer may finish the use.
- CC-B5.5 — Development-state use. When B.5.1 is used, an actual transition SHALL meet its project and domain conditions. A reasoning result alone does not establish a development-state transition.
- CC-B5.6 — Application and change. The practitioner SHALL distinguish a mathematical result from its physical application and a change of answer, question, Method or capability when that distinction changes the intended use.
- CC-B5.7 - Recoverability for the receiving use. When recovering a construction or argument, the practitioner SHALL identify the required inputs and the operations or inferences needed by that use. A missing rule or unsupported transition SHALL remain explicit. A conclusion reused after a premise changes SHALL state which argument or construction still supports it.
B.5:8 - Common Anti-Patterns and How to Avoid Them
| Recognizable failure | Repair |
|---|---|
| Repeatedly improve the fit of a model that omits the intended quantity. | Test the representation against a small action-changing counterexample; recover the missing distinction or qualify a sufficient bound. |
| Treat exploratory regularities as if they were independently predicted and tested. | Preserve their origin and use a design and inference that account for the selection and dependence. |
| Produce an argument whose receiver cannot identify what the crucial step establishes. | Work backward from the needed conclusion and recover the decisive transition and its premises. If a premise changes, follow its effect through the argument. |
| Generate more answers after the important question has changed. | State the changed formulation and which prior results still answer it before selecting further production. |
B.5:9 - Consequences
The Method preserves cheap use of adequate results while making constructive and question-changing work available. It connects mathematical reasoning, physical interpretation and epistemic criticism without imposing one proof or empirical regime on them.
The cost is attention to purpose, premises and continuation. Keep that effort proportional: one counterexample or a short explanation can settle the question. A difficult theorem or consequential physical inference can demand specialist work and substantially stronger evidence.
B.5:10 - Architectural Rationale
Inquiry connects different kinds of useful results. A construction supplies an object or procedure; a deduction establishes an implication; a conjecture offers an explanation; observations supply evidence about a phenomenon. Their value depends on what question they answer and what further use their support permits. Treating every result as an explanatory hypothesis would obscure these differences.
Question formation belongs here because the result of one reasoning contribution can alter the premises or aim of the next. Detailed object identity, mathematical-lens use, evidence, search and capability development retain their own Methods. Their results can enter an inquiry without turning each PatternID into a required stage.
B.5:11 - SoTA-Echoing
Which reasoning remains useful as result production becomes cheaper? Adapt Tao’s Mathematics in the age of AI (2026), §§2–8: select the contribution by mathematical and practical purposes, rather than problem-output count alone. Compared with continuing the same production task faster, §§4.1 and 4.4 make a changed question or repertoire available. This accepts the cost of purpose and interpretation work when it can change the next inquiry. Tao’s strong-capability premise is conditional.
What makes a produced proof useful to its receiver? Adapt Klowden and Tao (2026), §§4.2, 4.4, 6.3–6.4: recover the intended statement and the explanatory structure that enables reuse. Section 4.3 explains how to recover the needed transitions and follow a changed premise through their dependencies. Formal correctness suffices for some formal questions; application or extension can require this further account. Compared with rechecking the whole proof, the selected recovery spends effort on the receiver’s unresolved use. The paper provides a conceptual rationale for this recovery; the odd-sum example applies it to a small argument.
Must reasoning always begin with an explanatory hypothesis? Retain hypothesis-led inquiry where it fits and adapt Rodin (2023), §§3–6 for constructive work: recover object-forming operations as well as propositions about their results. Section 4.2 recovers inputs and rules before performing a construction; the graph case shows construction and justification together. An existence statement may answer the question of existence. When the next use needs an instance or procedure, recovering its construction supplies a further result. This accepts the cost of reconstructing only the needed operations, while leaving the choice of mathematical foundation to the question and subject practice.
How can an inquiry begin before equations are available? Adapt the qualitative entry described by Etkina and Brookes in the ISLE method explanation: observations can lead to proposed mechanisms, consequences and discriminating tests before quantitative formalization. Section 4.1.1 makes a first provisional account available; section 5.6 works an engineering model choice. ISLE supplies an instructional method in a supported learning setting.
Reopen these choices when a better method at comparable effort changes the attainable result, a receiving use needs a different explanation or criticism regime, or changed tools alter the useful division of contributions.
B.5:12 - Relations
- B.5.2 supplies the explanation-led abductive Method; B.5.1 coordinates development states when that separate question is current.
- C.22.2 supplies an inspectable problem formulation and next use. C.29 supplies mathematical-lens selection and correspondence, including preserved and lost structure.
- A.15.9 supplies bounded use or acquisition of another practice’s result, including help with a missing formulation.
- A.6.3.RT prepares and compares an expression when its representation hinders the needed operation. The construction or argument obtained through that expression remains the result of the applicable subject Method.
- B.3, B.3.3 and A.10 govern claim-and-use-specific assurance and evidence reliance.
- C.17, C.18 and C.19 supply novelty/value/diversity characterization, archive/front and possibility-space distinctions, and live-pool treatment when those questions arise.
- E.23, E.23.CAE and E.23.CDI distinguish object improvement, capability-expression questions and development of a named capability holder. E.10.DEV recovers ambiguous development claims; C.36 governs the cultural-evolution question.
- B.4 can use these reasoning results in an actual evolution inquiry. A sufficient reasoning result does not itself require another evolution cycle.
B.5:End
B.5.EA - Articulate a Working Distinction from Experience
Type: Method pattern Status: Stable Normativity: Normative unless marked informative
B.5.EA:1 - Problem frame
Use this pattern when a participant recognizes something consequential in their experience but cannot yet express what it is. A familiar phrase keeps replacing the point they are trying to make. The participant can return to an episode, an impression of the work or a partly expressed concern; a colleague needs a contribution they can understand and use.
The result is a provisional distinction, relation or question with enough explanation to continue the work. The method can be used alone or with a listener. A listener, including an AI assistant, needs access to the participant’s corrections; generating a fluent account cannot supply those corrections.
Use an already adequate answer directly. If the relevant contrast is expressible and a model is needed, B.5.FM can develop it. If you understand an available concept but cannot yet connect it to the situation, B.5.4 helps construct that correspondence. Articulation is useful while it can reveal a consequential part of the question.
B.5.EA:2 - Problem
A practitioner says that a meeting was “unproductive”, a movement felt “blocked” or a construction was “wrong”. The usual meaning of the word invites a familiar remedy, but the practitioner cannot yet explain why that remedy misses the difficulty.
Asking immediately for a definition can repeat the same label. Asking only for justification can suppress the still-forming contribution. Yet leaving the concern as an unexplained feeling gives other participants little they can work with. They need a way to develop its meaning and then decide what follows.
B.5.EA:3 - Forces
| Need | Difficulty |
|---|---|
| Return to what prompted the concern | A polished retrospective account can replace details the participant has not yet expressed. |
| Let a contribution develop | The resulting distinction may become possible during formulation, rather than exist beforehand as a complete hidden sentence. |
| Make joint work possible | The listener needs a usable expression while the participant retains the ability to correct it. |
| Use the result responsibly | An expression can capture the intended meaning without establishing its cause or wider applicability. |
| Keep the attempt worthwhile | Further clarification consumes time that might be better spent on the work itself. |
B.5.EA:4 - Solution
Alternate between returning to the experience and trying a formulation. Let the person with access to the experience correct the formulation. Continue into modeling or inquiry once the distinction is sufficiently expressed for that use.
B.5.EA:4.1 - Recover a place from which the participant can speak
Ask for a particular occasion connected with the concern: where the person was, what they were doing and which moment now matters. Begin with a fragment when a whole account is unavailable. A gesture, sketch, sound or rough phrase may help them return to it.
For human first-person work, allow time to attend to the experience before asking for an interpretation. Ask what comes back at the relevant moment and how it changes. Preserve an uncertainty such as “I remember the pause, but not which sentence preceded it.” An imagined reconstruction remains a reconstruction.
A listener may repeat the participant’s phrase and ask what needs to be retained. Ask a question whose answer can develop the concern, rather than supply a diagnosis for agreement. “What happened just before that pause?” leaves a different opening from “Were you afraid to disagree?”
B.5.EA:4.2 - Develop what the familiar wording leaves unsaid
Try expressing the point without the word that keeps ending the explanation. A sentence, comparison or demonstration may work where a single term does not. Ask which part of the new expression helps the participant continue and which part misleads them.
Keep a productive tension long enough to unfold it. “I was invited to choose, but I could not choose” might concern incompatible options, lack of information, an unaccepted responsibility or something else. Ask the participant to describe the occasion; do not decide among these meanings from the phrase alone.
First give the participant room to develop their own expression. A listener can then offer a tentative reformulation when it helps, making it easy to reject, amend or leave unfinished. If agreement merely repeats the listener’s words, ask what the participant can now add or correct. Return to their words and the occasion when the suggestion prevents that contribution. Record a phrase when it prevents losing the developing point or supports another participant’s use; no separate form is required for an ordinary conversation.
Test a proposed interpretation or remedy on the originating episode. If following it would leave the participant’s concern untouched, reopen the interpretation. Use the dialogue, document or work already available before asking the participant to supply more material. Ask for a genuinely missing fact when it could change the next move; do not make the participant prove a diagnosis that neither party has yet developed. Their correction can identify the limit of the listener’s account without establishing a rival explanation. B.5.PI keeps that opening connected with inquiry into the work.
B.5.EA:4.3 - Let concrete episodes change the candidate distinction
Return to the details that now matter. If another relevant episode is available, examine what each one contributes. One can reveal a relation the other made difficult to notice. Try the relation on the other episode and inspect both its contribution and its failure to fit.
A shared generic label is only one possible result. The useful finding may instead be a contrast, an exception, a previously unnoticed participant or a distinction between two conditions. Keep recalled events, available observations and hypothetical changes distinguishable.
Ask what the formulation now allows someone to notice, ask or do. When a relation can be stated, B.5.FM can develop its consequences. When the result is an explanatory question, B.5.2 can develop candidate explanations. Use the contribution that is missing; a full inquiry is unnecessary when the new distinction already settles the current use.
B.5.EA:4.4 - Separate intended meaning from the claim made with it
Distinguish three questions:
- Can the participant use this expression to continue what they were trying to say?
- Can the intended recipient recover the relevant distinction?
- What grounds support a conclusion about the situation beyond that expression?
The first can be answered through the participant’s continued account. For the second, invite a relevant interpretation or next move when shared use still needs checking. For the third, use the grounds appropriate to the claim and its consequences. C.11.DUA helps decide whether obtaining more information could change the action enough to warrant its cost.
If a new observation defeats the account, B.5.RR revises the affected reasoning. Preserve what remains useful. A formulation can be faithful to a person’s experience while their diagnosis of its cause is mistaken.
B.5.EA:4.5 - Carry the contribution into the work
Return the distinction, the conditions that make it meaningful and the next use it supports. A short statement may suffice. Preserve the original episode or phrase when later interpretation would otherwise lose the point.
Stop when the contribution is usable, when further articulation cannot improve the current decision, or when the participant cannot recover enough to continue. An unresolved but better located question is a legitimate result.
For joint work, the participant supplies experiential correction, the listener supports expression, and a subject specialist may supply the account needed for a subsequent inference. One person may perform several contributions. An AI can help formulate, compare and reason from available material; the participant’s private experience is not made accessible to the AI merely by assigning it that role.
B.5.EA:5 - Archetypal Grounding
B.5.EA:5.1 - A meeting that was “open” but left no room to contribute
In this constructed dialogue, a designer says, “Everyone could speak, but the review was closed.” The listener’s first interpretation is that someone interrupted. The designer rejects it.
Returning to the occasion, the designer recalls a pause after their suggestion. The chair thanked them and continued comparing the two options already on the screen. “There was no room,” the designer says, but rejects “not enough time”: the discussion continued for half an hour.
Asked whether another occasion helps explain that phrase, the designer recalls submitting a design note. Its form allowed long comments, but the decision fields still offered only the same two alternatives. “No room for comments” fails in that episode too: there was a comment box.
The listener asks, “What does the form help you notice about the meeting?” The designer answers, “Both accepted what I said as a comment. I wanted my proposal to become another option, not another comment about those two.” The second episode changes the meaning of “room” in the first; it does not just add another instance of an unproductive meeting.
The initial contradiction separates into two conditions: permission to speak and the possibility of changing the set being considered. The designer can now request consideration of a third option. The listener has not established that the chair intended to exclude it.
If the chair explains that the third option was already considered and was excluded by a constraint, the next question concerns that constraint and whether it still applies. Repeating the claim that speaking was ineffective would lose the new condition.
B.5.EA:5.2 - A teacher’s “they do not understand”
A teacher can repeat this judgement but cannot identify the missing contribution. The listener asks for the moment when it became noticeable. The teacher recalls that learners waited for the name of a method, then carried out its steps correctly.
The next formulation distinguishes selecting a method from executing it when named. It makes a different teaching question possible: what in a situation should help the learner choose?
If the teacher later notices that the waiting learners lacked a diagram supplied to the others, the interpretation changes again. Unequal access to a representation may explain this episode. The original distinction remains useful, but the episode no longer supports the same capability judgement.
B.5.EA:5.3 - A familiar gesture points beyond the available term
A craft practitioner describes an operation by tracing a brief path with one hand and saying “it catches here”. A colleague interprets this as a property of the finished shape. Repeating the gesture while describing the encountered resistance reveals that the practitioner means a transition during the operation.
The colleague asks which change in the work occurs at that point and can now inspect that transition. The gesture helped develop the description; it did not by itself establish a physical cause. The applicable craft or physical account supplies that later explanation.
B.5.EA:5.4 - A clearer help form misses the concern
A reader objects to guidance that begins “when you notice a difficulty, ask for help”. The listener offers a more visible help form. The reader rejects this but cannot name a better method. The available exchange already permits one test: would the proposed form change the situation of a worker who regards the result as ordinary and never seeks help? It would not.
The listener preserves that difference and examines how the work could first become a question, using B.5.PI. If the reader can only point to the passage and cannot continue, the passage and unresolved concern can remain as an early cue in the existing conversation. A polished paraphrase does not close the concern, and a new explanation is not yet established merely because the first one failed.
The cases are constructed; their supplied subject details are the basis for the illustrated conclusions.
B.5.EA:6 - Bias-Annotation
The listener’s expertise can make a premature explanation attractive. Preserve the participant’s opportunity to reject it. Conversely, a personally satisfying phrase can resist correction; another use or observation may expose a limitation even when the phrase still feels fitting.
B.5.EA:7 - Conformance Checklist
- A participant can return to the experience or identify the limit of that return.
- The expression develops through recoverable corrections rather than an imposed diagnosis.
- The resulting distinction changes a question, interpretation or possible action.
- The recipient can obtain the meaning needed for the selected use.
- Experiential fit, shared understanding and warrant for a world-directed claim retain their different grounds.
- Continuation uses the result or identifies the remaining difficulty without requiring an entire research programme.
B.5.EA:8 - Common Anti-Patterns and How to Avoid Them
The listener completes the story too soon. Return to the participant’s account and ask which part of the offered explanation fits or fails.
Novel wording is treated as discovery by itself. Show the new distinction and its consequence. An existing concept may already explain it.
An apparent contradiction is tidied away. Recover the situation before deciding whether the words refer to different conditions or the account is inconsistent.
Every concern is turned into an introspection exercise. Use an already adequate description directly. This method addresses an expression difficulty, not every unanswered question.
B.5.EA:9 - Consequences
Previously unusable experience can contribute to joint reasoning. The participant may discover what they mean while the listener obtains something more useful than agreement with a vague label.
The method requires attention and, in its human experiential branch, the participant’s willingness and ability to return to the experience. It offers no guarantee that the account will become clear. Use accessible observations or another contribution when that return is unavailable.
B.5.EA:10 - Rationale
The operation between noticing and reasoning is often left implicit. Preserving a cue prevents loss; forming a model requires distinctions with which one can work. Articulation connects these contributions without treating a preliminary expression as either worthless or already established.
Meaning can change during formulation. Retaining the ability to revisit the originating experience allows that change to be examined. The practical aim is a contribution to inquiry or action, including a better question.
B.5.EA:11 - SoTA-Echoing
The question is how to develop a useful contribution when the participant cannot yet express what their experience makes consequential. B.5.FM is a serious alternative: it can recover a contrast, compare cases and construct a relation. Use it directly when those questions let the participant supply usable distinctions. The extra operation here is returning to experience when familiar wording blocks that contribution, trying a different expression and letting the participant correct it before reasoning from it.
Adopt those operations from Gendlin’s account and appendix, steps 3–8, 2009: fresh phrasing and the reading of one episode through another can develop meaning that a stock label loses. They change §4.2–4.3 and the two-episode comparison in §5.1. Reject the stronger inference that a shared felt origin guarantees a logical connection among terms; §4.4 keeps intended meaning, public interpretation and grounds for a further claim separate.
Schoeller’s account, §3.1–3.2, 2022/2023, develops the human experiential and listening branch. Its listener initially refrains from adding suggestions. Preserve that first opportunity in §4.2. Adapt the later interaction for joint work by allowing a tentative reformulation that the participant can amend or reject. The possible gain is a usable expression sooner; the cost is a greater risk that the listener’s interpretation displaces the participant’s contribution. Continued agreement alone cannot resolve that risk. Return to reflection of the participant’s words when they cannot develop or correct the suggestion.
The complete Thinking at the Edge practice is another appropriate choice when the person wants sustained experiential inquiry and theory development. This shorter method stops at the contribution needed for the current work and leaves the complete practice’s training and later development outside its promise. It preserves return to experience and correction while accepting that narrower result. The sources motivate this choice; they do not establish comparative speed or effectiveness of the combined method. Reopen it if the participant repeatedly loses their meaning through suggestions, the needed result exceeds ordinary articulation, or another elicitation method supplies the same contribution with less interference or effort.
B.5.EA:12 - Relations
A.16.1 can preserve an early cue; C.2.4 characterizes articulation. Neither assessment nor a preservation record is a prerequisite for an ordinary attempt.
B.5.FM develops a model from an available contrast. B.5.4 interprets a situation through an available concept. B.5.2 develops explanatory conjectures; B.5.RR revises affected reasoning; B.5.QD develops further questions.
C.2.8 concerns the structure a reader can recover. C.11.DUA governs whether an additional inquiry is useful enough to undertake. These later questions use the articulated contribution under their own conditions.
B.5.EA:End
B.5.WN - Develop Lines of Thought with Working Notes
Type: Method pattern Status: Stable Normativity: Normative
B.5.WN:1 - Problem frame
Use this pattern when useful observations, reading or tentative thoughts recur across occasions, but keeping them has not yet made them available for developing a question or argument. You remember an interesting distinction without its grounds, find a relevant note without knowing why it matters, or repeatedly start an explanation whose missing connection remains hidden.
This is a branch of reasoning practice: developing thought through addressable notes and meaningful relations between them. Its material is an evolving formulation, the grounds it uses and the connections through which another occasion of reasoning can continue it. A note can be handwritten, an addressable block or a separate file. The method concerns what the practitioner does with that material; storage and retrieval engineering remain further work when the available means are inadequate.
First useful move. Take one available observation, source passage or rough note. Say what it lets you claim or ask, then compare that formulation with one relevant earlier thought. Write the consequential relation, including an unresolved difference when that is what the comparison produces.
The first result can be a better question, a counterexample, a missing premise or a usable continuation. A final publication topic need not be known. An assigned topic also provides an entry: follow the part of its argument that the available material cannot yet support.
Use a sufficient project record directly when it already supports the next action. A longer-lived note network is worthwhile when later comparison, recombination or development warrants the work of keeping it usable. Routine recording, factual retrieval and recovery of an already specified interrupted action can end without building such a network. Learning to reason independently and obtaining a useful argument with assistance are different purposes.
B.5.WN:2 - Problem
Chronological capture preserves occasions but can hide relations between them. A topical folder can collect similar material without explaining what one contribution changes in another. Extensive linking can make navigation possible while leaving the actual inference unwritten.
The opposite repair also fails: demanding a polished, correctly classified permanent note before its thought has developed removes the provisional material from which a question could emerge. The task is to give thought enough stable form to be compared and carried forward while allowing its meaning, connections and intended use to change.
B.5.WN:3 - Forces
| Force | Tension |
|---|---|
| Capture and present work | A short cue can prevent loss, while recording and processing everything can displace the work that supplied it. |
| Stable arrangement and changing thought | Familiar placement and addressable units reduce repeated setup; an inherited classification can suppress a newly useful distinction. |
| Recombination and connected reasoning | A separable thought can enter several arguments; excessive fragmentation removes the premises needed to understand it. |
| Retained observation and revised interpretation | Later understanding can improve a claim without changing what was originally observed. |
| Deferred inquiry and timely reliance | An unanswered question can wait until useful; a premise consumed by today’s decision cannot. |
| Personal use and another reader | An abbreviated cue can serve its author now but fail after delay or transfer. |
B.5.WN:4 - Solution
Develop the note through its use in reasoning. Recover its meaning, formulate the thought, test a meaningful connection, follow what that connection changes, and leave a usable way to return. These operations can recur in a different order as the work reveals another gap.
Recover a thought → make one useful connection → follow what it changes → leave a usable return.
A collection becomes useful through these continuations. Its size and number of links do not establish them.
B.5.WN:4.1 - Enter through available material
Begin where something is available: an observed episode, a passage, an objection to a draft, an existing question or a rough phrase. Recover enough of its context to tell what the thought concerns and why it attracted attention. If a cue no longer permits that recovery, return to the episode or source when available. Otherwise retain the uncertainty or discard the cue when no needed use depends on it.
A short capture serves the current interruption. Develop it while its meaning is still recoverable when later work warrants retaining it. Ask what the next occasion would need to know. “Bench slow” may remind its author of a conversation today; later comparison needs the job, the observed intervals and which result was called slow. The useful repair supplies those distinctions, without expanding every cue into the same form.
Keep a simple stable place and means of addressing notes. A known capture place, a source return and compatible small units can make comparison and rearrangement routine. Start with current material that matters. Processing an entire old archive is unnecessary when the present question can be developed without it.
B.5.WN:4.2 - Formulate a thought with its grounds
Write the claim, question or conjecture in terms you can use in reasoning. For a source-derived note, recover the source’s question, conditions and actual contribution before stating what follows for your own work. Distinguish the source account from your inference. A useful paraphrase preserves the source’s limits; a quotation still needs its context when that changes its meaning.
Keep the reason with the thought. “These jobs have different total delays but equal bench occupation” needs the event choices and calculation that support it. “Delay comes from waiting” is a stronger explanation and needs another basis. Let the note retain the weaker result when that is what the material establishes.
Choose a unit that can participate in a later argument. Split two thoughts when each needs independent use or revision. Keep a short derivation together when separating its steps would make the inference hard to recover. One sentence, one screen and one file are possible conveniences, not definitions of a thought.
An unresolved question can have a stable address. Its address makes it referable; its formulation states what remains unknown. Where a later use depends on an earlier formulation, retain that formulation or an exact return to it before changing the note. An observed event, a claim about it and a project-specific restatement may require different change treatment.
B.5.WN:4.3 - Make the connection do reasoning work
Find an earlier thought that could change the new one or be changed by it. Search by the working problem and possible contribution as well as by subject vocabulary. A note about obtaining a usable result may matter in testing, review and delivery although their local words differ.
Read the two thoughts with their grounds. Try the relevant operation:
- compare their meanings and conditions before treating them as agreement or contradiction;
- use one as a premise and attempt the inference the other needs;
- use a contrary case to test a general claim;
- carry a relation into another case and identify what makes that transfer applicable; or
- expose an unresolved dependency that neither thought presently supplies.
State the relation that survives this attempt. “Related to note N” can be enough for a familiar return; otherwise add the reason for the connection. For example, “This second attempt defeats the earlier assumption that one job has one occupation interval; the earlier two-job calculation is unchanged.” The relation now tells the later reader what to reconsider.
A resemblance can propose a question before it supports an explanation. Keep that difference in the note. If two cases lack the same result, their causes may still differ. A consequential counterexample narrows or rejects the proposed relation; it need not erase the observations that prompted it.
Use B.5.QD when the result changes the question and B.5.RR when a changed premise must be carried through dependent reasoning. Use the relevant subject method for the inference, experiment or construction itself. A new arrangement can make a missing premise visible without supplying it.
B.5.WN:4.4 - Provide entries for future occasions
Give a retained thought a route from a question in which it may help. A subject label can be useful, but an entry such as “apparent speed differences with different completion events” names a future reasoning use more directly than “bench notes”.
A small overview can state how several notes currently connect. It can distinguish an established inference from a promising analogy and expose an open question. Revise that account when the relationships change. Its purpose is to make a line of reasoning findable and inspectable, not to establish a final taxonomy.
A journal preserves sequence and contemporaneous context. A note network can expose relations across episodes. A project file holds what one undertaking uses. They may refer to the same observation. Keep one observation’s identity and grounds recoverable across these uses; displaying it in several views creates no additional observation.
Use the access arrangement actually available. A link that only the author can open does not supply another reader with the note. When a collection becomes too difficult to find or maintain, the relevant knowledge-access, notation or integration method can improve that arrangement. A working pair of notes does not require that engineering work in advance.
B.5.WN:4.5 - Develop or defer the emerging question
Follow a connection while it can yield a useful next result under the available means. The result may be a refined question rather than an answer. Ask what evidence or construction could now distinguish the live possibilities. Continue with that contribution, or leave the question in a form that a later occasion can use.
Two kinds of return are useful. A known deferred intention can be recalled at its next occasion. A semantic entry can expose a relevant thought while following a different question, including when its author has forgotten that it exists. Saving the note supplies neither return automatically.
For a deliberate deferral, retain the open question, the basis already obtained and what would make continuation worthwhile or necessary. Use a concrete reminder when there is a known occasion. Use a meaningful entry when the future occasion is not known. No invented deadline is needed merely to make an unfinished thought look managed.
Compare deferral with the present reliance. If today’s choice consumes the missing premise, obtain it, choose a supported alternative or withhold the dependent conclusion. If no current use consumes it, the question may remain open. This is the useful resemblance to lazy evaluation: work can wait until its result matters, provided the later use can recover the dependency and initiate the needed work.
B.5.WN:4.6 - Compose an argument for a recipient
When a project becomes useful or an assigned question needs an answer, select the notes that can contribute to it. State the proposed conclusion and arrange the reasons in the order the recipient needs. A visible outline can keep the whole argument available while one passage is being written.
Turn the selected material into that argument. Supply missing transitions, examine contrary material, remove repetitions and distinguish a useful example from evidence for a general claim. A chain of links is not yet the written inference. Composition often exposes a premise that seemed present only because the author knew the collection.
A project may develop copies or selected passages differently from the retained notes. Keep a source return where it matters; the new use need not rewrite every original formulation. Conversely, if new evidence defeats a retained claim still used elsewhere, return that change to the affected reasoning. Follow the actual dependency rather than synchronizing every sentence merely because it was copied.
A useful collection can remain incomplete. An argument offered for reliance must supply the premises and inferential steps its conclusion needs, or state its bounded unresolved result. Use the subject method to obtain what is missing. Stop polishing the surrounding wording when an unsupported premise is the obstacle.
B.5.WN:4.7 - Leave a usable continuation
At a useful stopping point, leave the result that was obtained and the next live question or operation when one remains. The later user should be able to recover why that continuation follows. A completed argument, a narrowed question and a deliberately abandoned conjecture have different further uses.
Retain long-lived notes when their future use warrants it. Processed fleeting cues and completed project material can have other dispositions. Apply the relevant retention, confidentiality and access rules before sharing or discarding material. The method supplies no authority to preserve or expose restricted information.
For a handoff, select what the recipient needs to continue the particular reasoning: its present question, obtained result, consequential uncertainty, usable source returns and next contribution. Make abbreviated personal relations explicit where that reader cannot recover them. The whole private collection need not travel.
Assess a stronger claim with the evidence it requires. A coherent note connection supports its stated inference. A reader’s successful recovery supports that use under that reader’s preparation and help. Independent capability, learning and improved production performance require their own assessment.
B.5.WN:5 - Archetypal Grounding
B.5.WN:5.1 - From a duration note to a new cross-case question
A practitioner is investigating reports that a bench is slow. Job Q41 is received at 09:05 and has a usable result at 10:00; the bench is occupied from 09:30 to 10:00. Q42 is received at 11:00, occupies the bench immediately and has a usable result at 11:30. The comparison developed in A.6.3.RT.OE distinguishes 55 versus 30 minutes until a result from equal 30-minute occupation.
A rough cue says “same bench time, different speed”. Before its context disappears, the practitioner writes a usable thought:
Compare the same beginning and result events. Q41 and Q42 both occupy the bench for 30 minutes. Their receipt-to-result durations differ because Q41 begins occupation 25 minutes after receipt. These observations distinguish waiting from occupation; they do not explain why the wait occurred.
The note returns to the two jobs’ observed times. An entry for “apparent speed differences” makes it available beyond a folder devoted to this bench.
Q43 later occupies the bench from 13:00 to 13:30 unsuccessfully, then from 13:50 to 14:20 successfully; its receipt is at 13:00. Time to the usable result is 80 minutes, occupation is 60 and the interval between attempts is 20. The practitioner adds:
One job can require several attempts. Relating one job directly to one occupation interval would lose Q43’s history. Keep the attempt and its outcome available when comparing time to a usable result.
The connection to the earlier note states the changed assumption. Q41/Q42’s observations and calculation remain valid. The new distinction changes the construction needed for Q43. The practitioner places this note under an entry for time to a usable result, with a return from the earlier speed-comparison entry.
In another project, all reviews are reported as completed, but the receiving comparison still lacks a common basis: the reviews evaluated different configurations. While asking whether completed activities supplied the usable result now needed, the practitioner follows the usable-result entry and retrieves the duration notes. Juxtaposition produces a new question:
Which event makes a result available for its next use? Ending the producing activity and obtaining a usable receiving result can differ. Investigate the required relation in each case; equal words such as “completed” do not establish it.
This note is an own cross-case conjecture and question. Its links name the bench and review contributions and preserve their different grounds. It proposes an inquiry; it does not establish a common cause.
Now change the review facts: all reviewers used a common valid basis, but the recipient has not opened their results. The missing-basis explanation fails in that case. The practitioner narrows the connection to the distinction between a result’s availability and its actual use, retaining the original bench observations. If no current project needs this question, the semantic entry is a sufficient continuation. If a delivery decision needs it today, the project must establish which result is actually available before acting.
B.5.WN:5.2 - Develop an assigned explanation from mathematical notes
A writer must explain what can be inferred about sums of irrational real numbers. The writer already understands rational numbers and the usual proof that sqrt(2) is irrational. One note contains a proved statement: adding a rational number to an irrational number yields an irrational number. If the sum were rational, subtracting the rational addend would make the other addend rational.
A rough second note asks whether adding two positive irrational numbers must also yield an irrational number. Keeping the quantifiers in the formulation makes a counterexample searchable. The writer tries sqrt(2) and 2 - sqrt(2). Both are positive. The second is irrational, since making it rational would make sqrt(2) rational by subtraction. Their sum is exactly 2.
The new note retains the two values and that short justification. Its link to the first says: “The first proof requires a rational addend; replacing that condition by an irrational addend permits a rational sum.” Separating the counterexample from its positivity and irrationality grounds would make later use require reconstruction. A small connected note is sufficient.
The assigned explanation also needs a case where two positive irrational addends have an irrational sum. Using sqrt(2) + sqrt(2) = 2sqrt(2) supplies it: if that sum were rational, division by the nonzero rational 2 would make sqrt(2) rational. The two cases now support the bounded answer that the sum can be rational or irrational. They do not classify products, limits or other operations.
The writer’s outline becomes: distinguish the rational-addend theorem; present the rational-sum counterexample; present the irrational-sum case; state the resulting limit of inference. Rewriting the notes into that order produces an explanation for the assigned question. The earlier theorem remains in the collection, with its actual condition.
A later question about squares can enter through the same concern with what an operation preserves. The present note does not answer it. The writer either develops that question through the relevant mathematics or retains the possible connection for another occasion.
B.5.WN:5.3 - Carry a developing question into operational case work
An engineer has the notes in :5.1, including their corrected question about availability and actual use. They do not establish that every delay has the bench’s cause. The engineer keeps an entry for “completed activity, receiving result still unavailable”.
At an already authorized support handover, a case note says: “Nightly exports finish on time; the senior analyst removes duplicates every morning. The customer proposes buying faster workers.” Private row contents remain in the customer’s system. The engineer’s permitted work is to examine the support question, not to change that system.
The engineer follows the entry and brings the earlier question to this episode: which result must “finished” supply to the analyst, and what work remains after that event? The comparison produces a new working note:
A recorded completion can leave a receiving contribution to be performed. Here the export has ended, but producing a usable report still includes duplicate reconciliation. Faster export has not yet been shown to remove that contribution. The bench and review cases helped pose this question; they do not identify the export’s cause.
The connection states its limited transfer. The support case remains the source of this observation. A return to that case lets the engineer distinguish the customer’s proposal from the proposed explanation. The note also leaves a question: under which receiving protocol is reconciliation needed, and what contribution could replace the manual work?
Now use the subject information available in this constructed case. The current manual distinguishes protocol v1, which requires manual receipt reconciliation, from v2, which permits idempotent resend after absence of a receipt has been confirmed. The installed protocol is unknown. The engineer’s useful support result is a conditional explanation and a request for that configuration fact through the authorized local service. Neither the resemblance to the earlier cases nor the finished note selects automatic resend.
A later signed configuration report says v2. The retained case question makes its contribution recognizable: it supplies the missing protocol fact. At the next permitted handover, the engineer reads the governing manual and the current case basis. Under the stipulated v2 rule, absence of the relevant receipt must still be confirmed before the proposed resend. The configuration result has answered one question; it has not performed that check or the action. The recipient receives the case-specific explanation and needed next contribution, not the engineer’s entire note collection.
Compare the full construction with the smaller incumbent. The ordinary case record already retains the duplicate episode, the protocol question and the eventual report. It is sufficient to resume this same support case; copying those facts into a second case ledger adds no needed capability. The longer-lived note contributes a separately developed question, its grounds and its limits across the bench, review and export occasions. Making that thought available costs the formulation and maintenance of the note and entry. When a practitioner can obtain the same question directly from the present record, no advantage of the additional network is established for that use. Keep the network contribution only for continuations that actually use it.
Finally change the governing source. A new manual still describes v2 but additionally requires destination certification. The available report identifies v2 and says nothing about certification. Preserve that observation, the original duplicate episode and the question that connected them. Revise the conditional advice: the former basis is insufficient for this proposed resend. Obtain the certification contribution through an authorized route or withhold the action; the current protocol fact need not be collected again merely because another premise is missing.
The note has helped construct and carry a question into work. The allowed encounter, configuration read, interpretation of the manual and controlled operational action remain actual contributions with their own conditions. A saved connection performs none of them by itself.
B.5.WN:5.4 - Keep the simpler project record when it suffices
An operator records a replacement part, installation time and required follow-up in an existing maintenance case. The next technician can find the current state and perform the scheduled check through that case. Copying those facts into a separate personal note network supplies no identified continuation.
Use the case directly. If several cases later expose a recurring unexplained relation, formulate that question with returns to the relevant observations. The later inquiry can justify a connected note without replacing the operational record.
B.5.WN:6 - Bias-Annotation
The method favors work in which thoughts can be expressed, compared and revisited. Tacit performance can supply observations, but written description does not by itself teach the performance. Source familiarity affects how much context a useful note needs.
The examples are constructed reasoning cases. They establish their explicit calculations and inferences, not a measured advantage of one note system. Assistance may produce a useful formulation while leaving the user’s own ability to formulate and connect unchanged.
B.5.WN:7 - Conformance Checklist
- CC-WN-1 — Recoverable thought. A retained formulation states a usable claim or question and the grounds its next use needs.
- CC-WN-2 — Source and continuation. Source meaning, observation and own inference remain distinguishable where reliance depends on them.
- CC-WN-3 — Consequential connection. A connection supplies a reason, contrast, counterexample, transfer question or other stated contribution to reasoning.
- CC-WN-4 — Appropriate unit. Separation supports independent use without losing a required inference.
- CC-WN-5 — Available return. A relevant future occasion can find and interpret the retained contribution under its actual access conditions.
- CC-WN-6 — Changed condition. Contrary evidence or a changed question revises affected reasoning while preserving still-valid observations and results.
- CC-WN-7 — Use-relative closure. Deferral, a completed argument and a blocked reliance retain their distinct requirements.
- CC-WN-8 — Proportionate support. Capture, connection and maintenance contribute enough to the intended use to warrant their burden.
B.5.WN:8 - Common Anti-Patterns and How to Avoid Them
| Failure in these situations | Consequence | Repair |
|---|---|---|
| Save a phrase after its context becomes unrecoverable | A later reader cannot identify the thought or its grounds. | Recover the source or episode, retain the uncertainty, or discard a cue whose loss defeats no required use. |
| Add links without examining the relation | Navigation grows while the argument remains missing. | Perform the comparison or inference and state its result. |
| Force every thought into one sentence | A claim loses the condition or derivation required for another use. | Keep the needed reasoning together; split only independently usable contributions. |
| Turn a new interpretation into an old observation | The record seems to show something never observed. | Preserve the observation and change the dependent account. |
| Keep a missing premise deferred while relying on its conclusion | The apparent continuation has no adequate basis. | Obtain the premise, choose a supported alternative or stop that reliance. |
| Publish the note sequence as the argument | The recipient must invent transitions and supply missing grounds. | Select and rewrite for that recipient’s question; repair the uncovered dependencies. |
B.5.WN:9 - Consequences
A useful thought can remain available across occasions without a finished project or final classification. Connections become operations that develop reasoning, and composition can reveal what the collection still does not supply.
The practitioner spends time on recoverable formulation, meaningful entries and occasional revision. The return depends on later use. A sufficient immediate record can remain the better choice when that further work has no identified contribution.
B.5.WN:10 - Architectural Rationale
A retained expression and a line of reasoning have different continuity conditions. An observation can remain unchanged while an interpretation is corrected; a question can retain its address while its proposed answer changes; a project argument can select and rewrite only part of the collection.
Stable addresses and compatible units make those changes manageable. The reasoning comes from the operations on their content and relations. The collection therefore supports inquiry without determining the subject truth or requiring a uniform lifecycle for every note.
B.5.QD develops a question from a result, B.5.RR revises dependent reasoning, and A.6.3.RT.OE prepares an expression for an operation. The present method connects such work across retained formulations and later occasions, including the passage from a developing network to a recipient’s argument.
B.5.WN:11 - SoTA-Echoing
Practice question. How can retained material develop thought across occasions without making capture and organization the whole activity?
Selected line. Adapt the connected practice in Sönke Ahrens, How to Take Smart Notes, revised and expanded edition (2022): source understanding and own formulation, meaningful connections, questions that develop through work, and composition that exposes missing argument. Chapter 2’s overview, chapters 10–12’s reading and connection work and chapter 13’s development of a written contribution supply that account. The appendix qualifies historical practice: an addressable note can remain abbreviated or unresolved. Stable routine arrangements enable comparison without making substantive classification final.
Comparable alternatives. Compare a sufficient chronological project record, a persistent note network and direct drafting for a fixed question. In :5.1 the project record already preserves the bench events and supports its immediate calculation. The additional note and problem-based entry cost formulation and maintenance; they make the later cross-case comparison available without requiring the writer to remember the bench episode. If no such continuation is needed, retain the project record alone. In :5.2 an assigned question starts the work directly; the existing theorem and two constructed cases suffice. Building a larger collection before writing would add no needed premise. In :5.3 the case record already supplies same-case resumption, while the connected note carries a question developed across unlike episodes. The comparison retains both the useful transfer and the no-network alternative; changed operational conditions still require their own qualification.
Luhmann’s 1981 account, Kommunikation mit Zettelkästen, is a historical example of sustained practice. Andy Matuschak’s daily working log and writing strategy provide inspectable digital-practice alternatives. Their descriptions are method accounts, not controlled efficacy comparisons.
Decision and cost. Adopt stable addressability and recoverable source returns when later reasoning uses them. Adapt note unity to independent use and connected inference, and retain temporary project views when their argument develops differently. Reject a universal promotion ladder or note-count target: neither selects the useful result in these cases. The accepted burden is selective formulation and connection in exchange for an available later continuation. The comparisons establish these constructed uses; learning and general productivity remain empirical questions.
Reopen the arrangement when useful thoughts repeatedly remain unfindable, mandatory structure suppresses a needed distinction, maintenance exceeds the contribution to actual work, or a simpler available practice supports the same continuation with less effort.
B.5.WN:12 - Relations
- B.5.PI and B.5.EA help initiate inquiry and articulate a working distinction from experience.
- B.5.QD develops a new question from a result or construction; B.5.QD.CF examines conflicting assumptions when that is the obstacle.
- B.5.RA and B.5.RC recover an argument or construction needed to understand and continue a source.
- B.5.RR revises reasoning after a premise or question changes.
- A.6.3.RT.OE constructs an expression for the next operation; A.6.3.RT preserves content through a representation change.
- A.15.10 and A.15.11 supply resumption of interrupted work and an occasion where a relevant contribution can be used.
- C.39.RO develops a reusable operation when the successful local construction needs that further result.
- C.2.8 qualifies what a recipient can recover under stated preparation, access and assistance.
B.5.WN:End
B.5.MPC - Connect Physical, Mathematical and Computational Reasoning
Type: Method pattern Status: Stable Normativity: Normative unless marked informative
B.5.MPC:1 - Problem frame
Use this when a physical question needs contributions from mathematics and computation, and their results do not yet form an interpretable answer together. You may be choosing a robot command, determining whether a gear arrangement can turn, or organizing entry to a room with a finite stock of cards. The difficulty is to connect what the physical arrangement does, what the mathematical result establishes, and what the procedure and its execution actually produce.
Begin with the difference the answer should help you understand or make possible. Take one available contribution and explain what it would have to mean, and what else would have to hold, for that contribution to answer the question. Work the first missing connection far enough to obtain a consequence or locate the next missing contribution. For a motion command, this might already reveal that the supplied count concerns motor revolutions while the distance model concerns wheel revolutions.
The result is a connected solution, a useful conditional consequence or bound, or a particular missing connection that directs the next inquiry. This pattern specializes B.5’s choice and connection of inquiry contributions for this joint physical, mathematical and computational difficulty. It governs the reasoning that connects those contributions. Physical laws, mathematical constructions, algorithm design and the engineering of an executing arrangement supply their respective subject content.
This is an epistemological and methodological synthesis. The epistemological question is what the connected contributions allow us to know: what follows from the constructions and premises, and how those consequences bear on the physical situation. The methodological question is how agents obtain and apply that knowledge, divide the work and change their methods. A result can support a physical change, expose a limitation or make a further question worth pursuing.
A practitioner needs enough preparation to recover the question, follow the meanings of the important quantities and operations, and recognize where specialist help is needed. The worked cases explain their elementary algebra, graph and counting constructions. A more demanding application can require additional physical theory, mathematics, computation or measurement expertise; obtain that contribution with its explanation when it is missing.
Use an already adequate calculation, implementation or operating procedure directly when its connection to the intended physical use is settled. A proof or bound can answer a physical design question before implementation is worthwhile. For an actual performance claim, add the observations, measurement relation and evidence needed for that claim; a conditional construction alone answers only what follows under its assumptions.
B.5.MPC:2 - Problem
Individually correct contributions can fail to support a joint result. A physical model may concern accumulated wheel rotation, a mathematical variable may represent orientation modulo one turn, and a program may accept an absolute target. Each account can be consistent while their composition loses the displacement that the user requested.
The same difficulty occurs without numerical approximation. A graph can correctly encode a chosen contact list, and a program can correctly colour that graph, while the contact list omits an actual mesh. A count invariant can be proved while the proposed admission procedure creates two independent stocks of cards. Improving the proof or the program leaves the missing physical correspondence untouched.
A simple division into “physics first, mathematics second, implementation last” also fails when a later contribution exposes an earlier omission. The interface may require initial state that the first model discarded. A measurement may distinguish fewer cases than the calculation assumes. A mathematical obstruction may make further computation unnecessary. The practitioner needs a way to construct the dependencies, use an available contribution at its point of need, and return a failure to the contribution that can change it.
B.5.MPC:3 - Forces
| Force | Working tension |
|---|---|
| Shared answer and distinct expertise | Specialists can work independently on contributions, while their results must concern compatible participants, assumptions and operations. |
| Useful simplification and physical interpretation | Omitting detail can make a problem tractable; an omitted distinction can determine the requested action. |
| Constructive freedom and justified consequence | New models, expressions and procedures can open a useful route; their decisive properties require the relevant physical or mathematical grounds. |
| Abstract result and executing means | A computation can be correct for its stated inputs while the proposed apparatus cannot prepare, represent or execute those inputs. |
| Reuse and change | Existing results save work, but their use depends on the premises and interpretations that the new question consumes. |
| Explanation and available effort | A person or team needs enough understanding to use and question contributions without reconstructing every discipline before an ordinary decision. |
B.5.MPC:4 - Solution
Construct the answer by connecting the contributions it actually needs. For each connection, identify the supplied result, the receiving operation and the condition that makes the result usable there. Follow those meanings through a small instance. If the connection is missing, construct it, obtain it from a suitable contributor, or return the particular missing result that prevents the next move.
The long mantra keeps the whole question available while attention moves between contributions:
Orient by the physical question → propose the relevant physical account → construct a mathematical question and its interpretation → obtain a result and, where needed, a computation → connect its execution and observations to the intended quantities → return the consequence to the physical question → choose the useful action or the next missing contribution.
The arrows recall result dependencies. They do not prescribe the order in which people must discover, receive or develop every contribution. A ready theorem, algorithm, measurement or physical mechanism can be the first available input.
B.5.MPC:4.1 - Recover the physical difference the answer should resolve
Identify the thing or situation being understood or changed. Say which difference would make an answer useful: a displacement within a stated tolerance, the possibility of coupled rotation, a capacity bound during entry, or another consequence the work needs. Include the relevant boundary and operating conditions when changing them could change the answer.
Then recover what is already available. An engineer may have a trusted motion model but an unfamiliar command interface. A mathematician may have an odd-cycle theorem and ask which physical arrangements its obstruction describes. A room attendant may have a reliable card procedure and want to extend it to a second entrance. Enter through that available contribution and recover only the other results needed to answer the question.
Use B.5:4.1 when the question itself needs formation or revision. B.5.4 helps recognize the participants and relations of an explained concept in a concrete situation. If the receiving use is still unclear, work one small consequence of the available result and ask what it would let someone decide or do. Retain a theoretical question when its answer could enable a worthwhile construction, explanation or later inquiry.
B.5.MPC:4.2 - Propose the physical account and the observations it needs
Identify the participants, interactions and configurations that could determine the requested difference. Give separately used quantities their participants and reference conditions: the robot’s distance to a wall before motion, its distance afterwards and its displacement are three quantities, even though each is called a distance. Start from the arrangement and relevant subject knowledge. For a rolling robot, distinguish wheel, motor, transmission and ground contact. For gears, distinguish an actual contact from proximity in a drawing. For admission cards, distinguish a material card, its holder, the room boundary and the permitted transfers.
State the applicable physical or operating rules. Explain why a rule supplies the needed relation and where it is an assumption. Wheel rotation yields a distance relation only under the chosen rolling and geometry conditions. Exclusive possession of a card supports an admission limit only when the entrance procedure connects possession to entry and return. A.3.3 helps construct configurations, retained state and allowed continuations; the subject practice supplies the laws and mechanisms those continuations use.
Choose a sufficient account for the present question. A direction or impossibility result may need less physical detail than a trajectory, speed or load calculation. Make an omitted interaction explicit when it could defeat the inference: slip changes wheel travel, a moving gear carrier changes relative rotation, and uncontrolled entry breaks the visitor-to-card association.
When observations supply an input or test a consequence, construct the relation between the sought quantity and the indication. Use C.16:5.3 and C.16:5.4 for the measurement method and model. Motor counts can indicate motor rotation under an encoder account; using them to establish travel additionally consumes the transmission and ground-contact account. If the available indication cannot distinguish the cases needed by the question, obtain a different observation, use an adequate bound, or change the question.
Return a proposed physical account and its consequences under stated conditions. An unknown interaction or calibration is a useful missing contribution when it determines which mathematical question can be constructed.
B.5.MPC:4.3 - Construct an interpretable mathematical question and expression
Choose mathematical objects and operations that retain the distinctions needed by the physical question. State what their important elements mean. For instance, let a vertex denote one particular gear, an edge denote a specified mesh, and a colour denote the sign of rotation when viewed from one common side. A colour number has meaning through that interpretation.
Construct the relation that connects the physical rules to the mathematical constraints. Derive a distance per motor increment from wheel circumference and transmission ratio; derive an opposite-colour constraint from the external-contact rule; derive a count invariant from a fixed stock and its permitted transfers. C.29:4.1 supplies the general correspondence-and-return method. When an operation or a compressed representation must preserve a result, use C.29.1 to compare performing the source operation and then transferring its result with transferring the inputs and then performing the receiving operation.
Work the distinction that could defeat the representation. A wheel orientation repeats after one turn; accumulated travel can continue to increase. A graph of opposite-direction contacts answers a different question from a graph in which an edge merely means “these parts are connected.” If two physical cases receive one mathematical representation but require different answers, retain their distinguishing information, restrict the cases or seek a weaker consequence.
Keep the relation available when the question changes. Identify which quantities are now given and which must be obtained, then derive the computational direction that serves that question. Under a model d = v*T and v = k*u, where u is a motor command setting, positive k, u and T permit T = d/(k*u) for a duration question or u = d/(k*T) for a command question. Obtain k and the range in which the speed model applies from the physical account. The device’s word “power” needs its interface meaning; u is not assumed to be physical power in watts. A resulting command outside the supported range returns a realizability question.
For a conditional example, let u be dimensionless and let k = 0.2 m/s. A distance d = 1 m at u = 0.5 takes T = 10 s. Changing the requested duration to T = 5 s requires u = 1. If the available range is 0 < u <= 0.8, the shortest duration under this model is 1 / (0.2 * 0.8) = 6.25 s. Returning that bound lets the requester change the deadline or seek a different realization.
An equality constrains the quantities in this model. A program assignment changes a stored value according to its execution rules. Construct the needed assignments or solver from the relation after selecting the givens and unknowns; C.29.2 supplies that formulation Method.
Make an expression that supports the next operation. Use A.6.3.RT:4.1 to express the givens and constraints under an available scheme and compare the result with its source. Put units and participant names where their absence permits the wrong operation. Keep a shared quantity recognizable across expressions, such as the same wheel revolution in the transmission ratio and circumference relation.
Notation can contribute to obtaining the result. A table can expose mutually exclusive card states; a graph can make a closed contact path traceable; a labelled equation can reveal the missing subtraction of an initial position. The subject Method supplies the construction or inference performed with those expressions. If the available scheme cannot express the needed distinction, change the scheme or obtain notation-design work before treating its expressions as adequate.
B.5.MPC:4.4 - Obtain a sufficient consequence or construct its computation
Choose the result the use needs: a value, distribution, statistic, bound or property of ongoing behavior. A witness can establish one feasible arrangement; a counterexample can refute a general claim; a proof can establish an obstruction; a bound can settle a threshold decision. Compute an exact numerical answer only when that answer contributes to the use.
When a procedure is needed, construct its inputs, retained state, elementary operations and output interpretation. Explain how it obtains the mathematical result and why it terminates, or which property it preserves during continued interaction. C.29.2 supplies this formulation work; the relevant algorithmic or mathematical Method supplies the actual construction and its argument. B.5:4.2 and B.5:4.3 help recover a construction or a decisive proof step that the available explanation leaves inaccessible.
Trace one instance with its meanings intact. In a two-colouring procedure, a waiting list records vertices still to be processed, while parent links can reconstruct a failed closed path. In a motion calculation, the integer is a count of a particular kind of increment. In an admission procedure, taking a free card changes a finite state and determines whether an entry may proceed.
For a numerical approximation, carry the error that can affect the physical use. Separate rounding of a computed command from uncertainty in radius, calibration or physical response. For a resource claim, include the cost of obtaining the input, representing it and interpreting the output when those costs matter. Counting one graph-edge inspection as one operation is useful under an adjacency-list cost model; it does not estimate the effort of discovering the actual contacts.
Use a supplied proof or computation when its premises, meaning and relevant resource conditions fit. If a necessary construction remains unknown, state the missing operation and what it must connect. C.39 supplies the search for or development of a missing way. A conditional answer or a less demanding bound can finish the current question while that larger construction remains open.
B.5.MPC:4.5 - Connect the computation to preparation, execution and observation
Begin with the abstract input and explain how the proposed arrangement represents it. Then identify the system actions that perform the operations and the observation or final state from which the result is read. Use C.29.3 for this realization comparison.
Compare two routes for the same input:
abstract input → stated computation → abstract result
abstract input → prepared system → system operation → interpreted result
The comparison asks whether the second route returns the equality, bound, statistical agreement or behavioral property that the receiving use needs. Input preparation and output interpretation can use different relations. Preparing a motor command and reading robot displacement are different operations; counting free cards and authorizing one transfer use different aspects of the same arrangement.
Recover range, units, initial state, ordering and completion conditions at the point where they affect that comparison. A signed command field cannot carry every positive integer. A command meaning “add this displacement” differs from one meaning “reach this position.” A material card available for transfer cannot simultaneously be assigned to another visitor.
Include the timing and retained physical state that the comparison consumes. When a controller is paused for debugging, determine which physical processes continue and which command remains active. Observe or replay the operation with the timing it needs, or interpret the changed run under its changed conditions. Establish the event that completes the requested physical action; program termination, a command acknowledgement and motor stopping can occur at different times. For an observation, include a settling interval or other preparation when the measurement relation requires it.
For a design question, use the stated model of the executing arrangement and return a conditional realization. For a claim about what happened, obtain the corresponding observations and their interpretation. A command receipt can establish that a command was accepted while leaving its successful physical completion open.
Use an existing adequate implementation directly when this comparison is already settled for the receiving use. A manual procedure, analog apparatus or controlled material transfer can supply an execution. Its adequacy follows from its permitted operations and interpretation, not from whether it contains digital software.
B.5.MPC:4.6 - Keep joint requirements and alternative routes distinguishable
Recover dependencies by asking, for each needed result, “What results and conditions make this operation possible, and what other operation could supply the same receiving need?” Keep the answer with the actual derivation, diagram or working explanation. A short case may need only a sentence; a shared design may need an explicit dependency diagram.
An AND dependency means that contributions are needed together for the stated inference. The robot’s distance per motor increment uses the effective wheel radius, transmission ratio and increments per motor revolution together. Replacing any one can change the command.
An OR alternative is a different sufficient way to obtain the result needed by the receiving use. A proved upper bound and an exact computation can be alternatives for deciding whether a limit can be exceeded. Each route retains its own assumptions. Two different approximations do not become sufficient alternatives merely because both return a number.
For a conditional physical consequence, one useful small rendering is:
applicable physical account
AND mathematical interpretation
AND (sufficient direct consequence OR sufficient interpreted computation)
→ consequence for the physical question
The computational branch additionally depends on a procedure and an adequate realization for any claimed execution. A claim about observed physical behavior adds the observations and measurement relation it consumes. These are different claims and can end the work at different places.
Keep a shared premise attached to every contribution that consumes it. Both an analytical calculation and a numerical simulation can depend on the same no-slip assumption. Switching between them does not remove that dependency. Conversely, when an upper bound already answers the decision, the exact optimizer need not be obtained.
Enter a ready result at the place where it is used. Recover its inputs and conditions backward, then continue forward with its consequence. When a missing input blocks one route, compare another sufficient route using the available inputs. Do not combine an output from one route with the assumptions of another without establishing their compatibility.
A failed connection can send the inquiry back to its physical account, mathematical construction, notation, procedure, realization or question. Use B.5.MPC.R to locate the incompatibility, construct a sufficient repair and carry it through the affected contributions. If several causes remain compatible with the observations, obtain a discriminating contribution or use a sufficient conditional result. B.5.RA supplies argument recovery and B.5.RR supplies general reasoning revision; C.29.1, C.29.2 and C.29.3 supply the transfer, formulation and realization methods respectively. Retain unaffected contributions whose conditions and meanings still hold.
B.5.MPC:4.7 - Return the consequence and choose what to do with it
Explain the result in the original physical terms. A count becomes a modeled displacement; an odd cycle becomes a set of contacts that prevents the stipulated nonzero rotation; a card invariant becomes a bound on occupancy under the entry rules. State what the result enables and the condition that changes that use.
When the consequence is insufficient, make the next contribution specific. “Determine whether these two wheels slip differently under this load” can direct physical work. “Find a representation that retains accumulated turns” can direct mathematical formulation. “Establish whether this interface interprets the number as an increment or an absolute target” can direct realization work. The uncertainty itself can be the result if locating it prevents further work on the wrong question.
Distinguish the consequence of an obstruction. A mathematical contradiction blocks a construction under its stated premises. A physical restriction blocks an intervention under the applicable laws. An expensive computation can remain mathematically possible while unavailable within the resources of this use. Their repairs can require different questions, arrangements or Methods.
Stop when the supported result answers the intended use. When development is the purpose, work one consequential variation far enough to reveal a new construction, obstruction or missing operation. Explain which additional action or longer inquiry it could enable. B.5:4.4, C.39 and C.40 supply the corresponding question and repertoire development; continued work is justified by that use.
B.5.MPC:4.8 - Divide human and AI contributions by the result they must supply
Allocate work around the dependencies above. A contributor can supply a physical account, a mathematical construction, a proof, a computation, a proposed realization or an explanation of the connection. State the working question, available inputs, missing result and intended use when obtaining help through A.15.9. Ask for the formulation itself when the equation has not yet been constructed.
Retain enough understanding at each receiving point to use and question its input. The receiver of a motion count should be able to identify its unit, the rotation it counts, its sign and its dependence on the motion model. The receiver of a two-colouring result should be able to connect the returned labels or odd-cycle witness to the actual contact list. The receiver of an occupancy bound should be able to identify the material and procedural conditions that preserve the stock.
That understanding can be held by one person or distributed across people and AI with an effective way to obtain a missing explanation. Arrange a capable contribution for each consequential connection. A completed report alone does not establish that this capability is available when a premise changes.
Choose depth from the later work. Using a stable formula may require interpretation and checks at the connection. Changing the formula requires understanding its derivation. Designing a new algorithm or physical theory requires the additional specialist capability. When assessing a person’s preparation, examine their contribution on representative work with the assistance that will actually be available. Include a change of the requested result or a relevant premise when later work requires that adaptation. Ask the practitioner to recover the retained relation, the new unknown and the dependent physical operation.
B.5.MPC:5 - Archetypal Grounding
The following are constructed cases under stated assumptions. They show how the coordinating Method obtains a jointly interpretable consequence. Physical motion, an assembled gear mechanism and an operating admission system require their corresponding physical arrangements and evidence.
B.5.MPC:5.1 - Construct a robot command from a motion question
An engineer wants a robot to advance by 1 m along a straight guide. The guide keeps its direction fixed. For this calculation, the effective rolling radius of the driven wheel is 0.05 m; rolling occurs without slip; the transmission makes ten motor revolutions for one wheel revolution; and successful execution advances the motor by one thousand commanded increments per motor revolution. Positive motor motion is defined to produce forward travel. The initial question is a conditional command design under those assumptions.
First construct the relation from the participants. One wheel revolution rolls through its circumference, 2π × 0.05 m. The motor makes ten revolutions during that wheel revolution, so that travel corresponds to 10 × 1,000 = 10,000 motor increments. Let N be the signed number of motor increments completed after the command begins. The modeled displacement s is:
wheel revolutions = N / (1,000 × 10)
s = [N / (1,000 × 10)] × 2π × 0.05 m
distance per motor increment = 0.0000314159265359 m
The factors expose the two distinct revolutions and the command unit. A statement that the wheel turns through 2π radians would give orientation change for one turn; the present N retains accumulated turns because the receiving quantity is accumulated travel.
Invert this relation for the target displacement:
N_ideal = 1 m / (2π × 0.05 m) × 10 × 1,000
= 31,830.9886183791 motor increments
N_command = nearest integer to N_ideal = 31,831
The computational procedure reads the target distance and the three parameters, computes the ideal count and rounds it to the nearest integer. Use enough numerical precision to determine that integer; if arithmetic uncertainty straddles a rounding boundary, refine the calculation or retain the resulting command uncertainty.
Now supply the realization input. The interface accepts signed relative motor-increment commands in the range −32,768 to 32,767. It performs a command to completion before reporting successful completion. Thus 31,831 is representable and its unit and relative-command meaning agree with the calculation. A different interface would require its own preparation relation.
Read the completed command back through the physical model:
s_command = 31,831 / 10,000 × 2π × 0.05 m
= 1.00000035756417 m
maximum error from rounding to the nearest increment
= 0.5 / 10,000 × 2π × 0.05 m
= 0.0000157079632679 m
The rounding bound concerns discretization of the command. It leaves slip, effective-radius error and unsuccessful motor execution outside that numerical bound. If the engineering question is actual travel within a tolerance, those contributions determine whether this command is adequate. For example, motor counts alone cannot discriminate successful rolling from wheel rotation with slip; a displacement measurement needs its own relation to position.
The joint result is the command 31,831 and its modeled consequence under the physical and interface conditions. Physics supplies the rolling and transmission account. Mathematics supplies the relation, its inversion and the error bound. Computation supplies the integer and range check. The coordination connects their meanings and returns the supported displacement.
The same interface’s largest positive relative command represents about 1.0294056648 m under this model. If the requested distance and tolerated error require a larger positive count, use another realization or a procedure using several commands whose combination is justified. If the wheel radius, the count’s meaning or the use of initial position changes, reconstruct the affected relation before reusing the command. Those changes can affect the physical parameter, mathematical expression and command preparation together; recover the disagreement and its dependent contributions as in :4.6.
B.5.MPC:5.2 - Use two-colouring to answer a gear question
A designer asks whether every gear in a connected arrangement can rotate while all specified meshes remain engaged. The supplied idealized account has parallel, fixed axes, external gear contacts and positive pitch radii. View every rotation from the same side. At each external mesh, the two gears have opposite signs of angular velocity. Contact geometry and tooth compatibility are additional physical conditions; this first question concerns the consistency of rotation directions.
Construct a finite undirected graph. A vertex represents one gear and an edge represents one of the stipulated external meshes. Assign colour 0 to one rotation direction and colour 1 to the other. An edge requires different colours at its endpoints. This expression makes the physical question a mathematical one: can the vertices be assigned two colours while satisfying every edge?
The graph records actual contact, not geometric closeness on the page. A drawing with crossing lines does not add a mesh between the gears at that crossing. If an actual contact is absent from the list, the result answers only the incomplete list.
Obtain either a colouring or a witness of failure by the following procedure.
- Choose an uncoloured vertex as a root. Give it colour 0, depth 0 and no parent; place it on a waiting list.
- Remove the first vertex from the list and inspect its neighbours. Give each uncoloured neighbour the opposite colour, record the removed vertex as its parent, give the neighbour depth one greater and append it to the list.
- For an already coloured neighbour, compare colours. If they agree, use that edge and the two parent paths to construct the odd-cycle witness explained below, and return it.
- Continue until the list is empty. Start another root if an uncoloured vertex remains. If every edge joins different colours, return the colouring.
A vertex is added to the waiting list only once. Each recorded parent has smaller depth, so parent paths reach their root. A finite graph therefore yields a result after all relevant vertices and edges have been examined, or after a contradiction has been found. With adjacency lists, constant-cost access to a vertex’s recorded data, and constant-cost insertion and removal in the FIFO waiting queue, the work is proportional to the number of vertices plus edges.
Work a square contact cycle with gears A, B, C and D and contacts AB, BC, CD and DA. Starting at A gives A colour 0; B and D colour 1; and C colour 0. Every contact joins opposite colours. The groups {A,C} and {B,D} therefore give compatible direction choices. Reversing both groups gives the other choice. Four equal pitch circles can be placed with centres at the corners of a square of side twice the pitch radius to obtain those contact incidences; tooth engagement and motion under load still require the corresponding mechanical design.
Now work three gears with contacts AB, BC and CA. Starting at A gives B and C colour 1. Edge BC then joins equal colours. Its endpoints’ parent paths B–A and C–A, together with BC, give the three-edge closed path B–A–C–B. Alternating directions around three external contacts asks B to have both directions at once.
The same reasoning constructs a failure witness in a larger graph. For a same-colour edge, follow its endpoints’ parent paths until their nearest common vertex. Discard the shared path beyond that vertex. The retained paths have even total length because the endpoints have the same depth parity. The extra edge closes a simple odd cycle. Alternating two colours cannot satisfy every edge of an odd cycle. Conversely, if the procedure finishes without such an edge, its returned colours satisfy every listed constraint.
The physical interpretation can be made quantitative without hiding the direction question. Let rᵢ be a gear’s pitch radius and ωᵢ its signed angular velocity. Ideal external meshing with fixed axes gives:
rᵢωᵢ + rⱼωⱼ = 0 at each mesh
qᵢ = rᵢωᵢ, so qⱼ = −qᵢ
For a two-colouring, choose any nonzero value q for one colour and −q for the other, then set ωᵢ = qᵢ/rᵢ. This satisfies those kinematic equations. For an odd cycle, following the equations around the cycle gives q = −q and hence q = 0. In a connected graph all gears then have zero angular velocity. Thus the odd cycle excludes the requested nonzero coupled rotation under the stipulated contact model; a stationary arrangement remains compatible with the equations.
Return the cycle as the particular set of physical contacts responsible for the obstruction. Removing one actual contact from the triangle leaves a chain and permits alternating directions. Deleting only its graph edge leaves the physical obstruction in place. An internal gear contact or a moving carrier changes the contact rule and requires a revised physical account before the colouring test is reused.
A compatible direction assignment answers this bounded question. It does not establish adequate torque, tooth phasing, freedom from interference or motion under the intended load. For those questions, retain the graph result and obtain the missing mechanical contribution. The common Method supplies the contact interpretation, the connection to the computational witness and the return to the design. The gear account and graph argument supply the substantive rules that make that return possible.
B.5.MPC:5.3 - Maintain an admission bound through material tokens
A demonstration room should contain at most three visitors. Initially the room is empty and three distinct material cards are available. An attendant gives a free card to one visitor before entry. That visitor keeps it while inside and returns it after leaving. A new visitor waits for a card when none is free.
For this case, every entrance and exit follows the procedure, each card is exclusively assigned to one visitor at a time, and cards are neither lost nor duplicated. The material arrangement makes exclusive acquisition possible: taking the available card removes that same card from the free stock. A photograph or printed copy of the card is not accepted for entry.
First consider a moment when every assigned card is held by a visitor inside and every other card is free. The one-card-per-visitor rule gives:
occupancy = 3 − number of free cards
During admission and return, cards can also be held by visitors outside. A visitor may already hold a card while waiting to enter; a departed visitor may still be walking to its return point. To preserve the physical meaning during those intervals, distinguish four states for each card:
| State | Physical interpretation |
|---|---|
| Free | The card is available for a new admission. |
| Reserved | The card is held by a visitor who has not yet entered. |
| Inside | The card is held by its visitor inside the room. |
| Awaiting return | Its visitor has left, but the card is not yet free. |
Let F, R, I and E count cards in those four states. Every card occupies exactly one state, so F + R + I + E = 3. Under the visitor-to-card rule, occupancy = I. Therefore:
occupancy = I = 3 − F − R − E
occupancy ≤ 3 − F ≤ 3
The transition procedure has four ordinary operations: issue one free card to a waiting visitor; admit that card’s visitor; let the visitor leave with the card; and return the departed visitor’s card to the free stock. Their state changes are Free → Reserved → Inside → Awaiting return → Free. A cancelled admission can return a Reserved card directly to Free while its visitor remains outside.
Each operation moves one existing card between states. Issuing a card requires a free card; entering requires its exclusive reservation; returning it requires that its visitor is already outside. Those conditions preserve the total stock and the association between visitors inside and Inside cards. The argument establishes the capacity bound for every sequence of those permitted operations, including overlapping visits.
Work two entries followed by one exit:
| Operation just completed | F | R | I | E | Occupancy |
|---|---|---|---|---|---|
| Initial arrangement | 3 | 0 | 0 | 0 | 0 |
| Issue card A | 2 | 1 | 0 | 0 | 0 |
| Visitor A enters | 2 | 0 | 1 | 0 | 1 |
| Issue card B | 1 | 1 | 1 | 0 | 1 |
| Visitor B enters | 1 | 0 | 2 | 0 | 2 |
| Visitor A leaves | 1 | 0 | 1 | 1 | 1 |
| Return card A | 2 | 0 | 1 | 0 | 1 |
Counting free cards gives an upper bound on occupancy during handover and return. It gives the exact occupancy when R = E = 0. That distinction changes what an observer may infer from the same stock. The admission rule can preserve the bound without an exact instantaneous occupancy readout.
Connect the abstract transition rule to the physical means. Exclusive possession realizes consumption of a free token. Carrying it through entry preserves the visitor association. Returning it only after exit prevents its use for a fourth visitor while the first three remain inside. If a visitor passes their card to someone outside while staying inside, the allowed-transition premise fails: the reused card no longer represents one occupied or reserved place.
A second entrance needs access to the same total stock. A copied stock of three additional accepted cards permits six simultaneous admissions, even if both attendants follow their local rule correctly. A shared pool of the original three cards preserves the common bound. Partitioning those same cards, for example two at one entrance and one at the other, also preserves it. The partition can make a visitor wait at one entrance while a card is free at the other; redistribution then needs a transfer of an existing free card.
The useful result is a conditional admission design and an interpretation of its observable stock. Its computational contribution is a finite-state procedure that answers whether an admission can proceed and maintains the relevant count. People and material transfers can execute it without a digital program. The invariant does not establish fair waiting, fast entry or detection of every procedural violation; those are different questions with their own needed contributions.
The coordinating Method makes the physical card and room-boundary rules, mathematical invariant and executing procedure agree. This is also why changing the stock or the return rule changes the joint result even when the counting arithmetic remains correct.
B.5.MPC:6 - Bias-Annotation
| Likely bias | Consequence for this work | Corrective action |
|---|---|---|
| Familiar equations dominate the physical account | The practitioner begins with a calculable proxy and loses the requested quantity. | Name two physical cases that require different answers and determine whether the proposed variables distinguish them. |
| Successful computation dominates interpretation | A number or certificate is accepted without its meaning in the physical arrangement. | Interpret the decisive count, edge or token transfer and recover the premise connecting it to the receiving action. |
| Diagram familiarity hides physical assumptions | A graph edge is treated as a real contact, or its meaning changes across an example. | Construct the contact or interaction list from the subject account and label the relation that each edge represents. |
| Digital implementation is treated as the default | Material or manual realizations are overlooked even when they answer the question. | Compare their input preparation, permitted operations and result interpretation with the computational need. |
| A precise answer hides an uncertain premise | Small numerical error is reported while model or measurement uncertainty can dominate the result. | Carry the uncertain physical premise into the returned consequence or obtain the measurement that can settle it. |
| Contributor identity substitutes for usable grounds | An expert or AI report is trusted beyond what its stated assumptions and explanation support. | Recover the connection consumed by this use and obtain the missing explanation or evidence from a capable contributor. |
These biases can affect one person as well as a team. Apply the correction at the missing subject operation, correspondence or observation.
B.5.MPC:7 - Conformance Checklist
Use these checks on the claimed joint result and its explanation. They establish conformance to this Method’s stated use; physical validity and any stronger assurance claim require their applicable subject evidence.
| Check | Content to inspect |
|---|---|
| CC-MPC.1 — Receiving question | The explanation identifies the physical difference to be resolved and what the supported answer enables. |
| CC-MPC.2 — Physical premises | Participants, interactions and operating conditions are sufficient to recover the mathematical question; consequential assumptions remain distinguishable from observations. |
| CC-MPC.3 — Interpretable construction | Important quantities, structures and operations have meanings that survive the construction, and a lost distinction either leaves the use intact or changes the returned result. |
| CC-MPC.4 — Obtained consequence | The proof, construction, bound or computation is actually supplied for the stated case, with the decisive argument and its conditions. A missing operation is named as missing. |
| CC-MPC.5 — Executing arrangement | Any realization claim connects preparation, system operations and result reading. Range, units, initial state and ordering are recovered wherever they change the inference. |
| CC-MPC.6 — Joint and alternative dependencies | Jointly needed contributions remain together; alternative routes each satisfy the receiving need under their own conditions. A shared premise remains shared across alternatives. |
| CC-MPC.7 — Notation in use | The expression supports the needed operation under explained or familiar rules; new subject conclusions are justified by that operation rather than presented as mere re-expression of givens. |
| CC-MPC.8 — Supported return | The consequence is interpreted in the physical question with the bounds and uncertainties its use consumes. Conditional design and observed performance remain distinguishable. |
| CC-MPC.9 — Useful continuation | The explanation ends with an adequate use, a specific missing contribution or a justified next question. A change returns to its affected contribution and dependents. |
A short sufficient calculation can satisfy these questions without separate records for each row. A shared or consequential result retains enough of the derivation, interpretation and evidence for its receiver to inspect the connections.
B.5.MPC:8 - Common Anti-Patterns and How to Avoid Them
| Misuse | Failure visible in the worked cases | Repair |
|---|---|---|
| Substitute the right number into the wrong command | A count of relative motor increments is treated as an absolute wheel-position target. | Recover the interface’s counted participant, unit and initial-state use; construct the input it actually accepts. |
| Check only the middle calculation | The robot arithmetic is correct while rolling or successful completion remains unsupported for an actual-travel claim. | Add the physical and observation contributions consumed by that stronger claim, or return the conditional design. |
| Treat a sufficient abstraction as complete physical design | A gear colouring is taken to establish torque or mechanical compatibility. | State the bounded direction consequence and obtain the missing mechanical account when the decision requires it. |
| Repair the drawing while leaving the arrangement unchanged | An odd-cycle edge is deleted from the contact graph but the gears remain meshed. | Change the actual contact or revise the contact rule with its physical basis, then reconstruct the graph consequence. |
| Count reservations as occupants | Three cards outside the free pool are reported as three visitors inside during handover. | Retain Reserved and Awaiting-return states, or report the resulting occupancy bound. |
| Preserve local rules while duplicating a shared resource | Each entrance has its own three-card stock and both are used for one room. | Use one total stock or a partition of it; transfer existing free cards when balancing entrances. |
| Traverse every contribution before using a sufficient result | A proof already excludes a design, yet simulation and implementation continue as compulsory stages. | Return the proved physical obstruction under its assumptions and choose a revised design question. |
| Ask a contributor for an unexplained answer | The receiver gets a count, proof or program whose needed meaning cannot be recovered. | Request the particular interpretation, decisive argument or operating condition required by the next use. |
B.5.MPC:9 - Consequences
The practitioner can assemble a useful answer from contributions obtained at different times and from different people, AI systems or established sources. The resulting explanation identifies how the answer concerns the physical situation and which premise or operation would change it. That makes a partial result useful: a bound can settle a decision, an odd cycle can locate a design obstruction, and an unresolved command meaning can direct one precise request.
The method also changes what work is commissioned. Instead of asking for another undifferentiated simulation or report, a team can ask for the missing physical relation, retained state, constructive algorithm, measurement or realization. An already adequate contribution remains available when an unrelated part changes.
This connection work has a cost. Recovering an unfamiliar source, learning notation or obtaining a physical premise can take more effort than calculating the displayed answer. Spend that effort where it changes the receiving use. The method provides no automatic completeness claim for physics, mathematics or computing; it makes the needed subject contribution and its remaining boundary visible.
B.5.MPC:10 - Architectural Rationale
B.5.MPC:10.1 - Why the connection is a Method in its own right
The receiving physical question joins several operations whose local success has different meanings. Derivation establishes what follows within a mathematical account. A physical explanation supports the choice of that account for a phenomenon. A procedure obtains a represented result; its realization connects that procedure to available system behavior. Coordinating these operations requires preserving their result dependencies while selecting a useful next contribution.
The epistemological and methodological contributions meet in the use of a result. Axiomatization can make the objects, premises and permitted constructions explicit. A physical postulate contributes to empirical knowledge through an interpreted model whose consequences can be compared with observations. Computational formulation and realization let agents work through consequences using specified operations on represented inputs. The practitioner connects these contributions to obtain and apply knowledge, then uses an encountered limitation or a newly available operation to change the method or pose another question. Their detailed constructions give substance to the pragmatic question: which further work becomes possible?
The robot makes the need concrete. Circumference, transmission ratio, integer rounding and signed-command semantics are separately intelligible. The useful command exists only when they refer to compatible motion and counts. A.3.3 can help recover state, C.29 can construct and transfer the mathematical consequence, and C.16 can interpret an observation. Their contributions enter the joint question through the dependencies explained in :4; none by itself chooses all the other subject content.
B.5 provides the general inquiry method: recover the question, perform the missing contribution, make its result understandable, and settle or revise the inquiry. This specialization adds the recurring connections among physical account, mathematical interpretation, computational formulation and executing arrangement. The relation is specialization of inquiry coordination and composition with the constituent Methods. A mathematical Method does not become the parent of a physical modeling Method merely because its result is used there.
An alternative is to use a fixed forward sequence. That is convenient when every input is new and later stages expose no earlier gap. It becomes wasteful when a ready theorem supplies the answer, and inadequate when command semantics require an earlier state distinction. The dependency method retains a forward traversal but also supports backward recovery, direct entry and returns after changed conditions.
Another alternative is to let each specialist check only their own output. That can be sufficient when all receiving correspondences are already established. Where they are unresolved, a correct local output can remain unusable by the next contributor. Give the connection itself an explicit receiving question and a capable contributor.
B.5.MPC:10.2 - What the sources contribute to the synthesis
Rodin’s Axiomatic Architecture of Scientific Theories develops a constructive account of axiomatization in which object-forming activity matters alongside propositions. That supports asking how the needed object is obtained and which operations its theory permits. In :4.3–4.4, this becomes recovery of an actual construction. Physical interpretation still requires its subject account; the mathematical construction does not establish that a proposed physical interaction occurs. See Rodin, 2020, §§4.2.2–4.2.3.
Fong and Spivak make preservation under composition explicit: a functor preserves identities and composition between categories. The use here is the comparison of corresponding operations, supplied by C.29.1. It explains why relabelling objects alone cannot establish a transfer. A physical approximation may instead need a bound or another qualified relation; the coordinating Method does not require every connection to be a functor. See Seven Sketches in Compositionality, §3.3.2.
Horsman, Stepney, Wagner and Kendon distinguish the representation of a physical system from the preparation and interpretation needed to use a physical process for computation. Their account supports :4.5’s two routes and the distinction between refining an abstract description and realizing it. It also permits input preparation and result reading to differ. The present Method adapts that comparison to a receiving physical question and to useful bounds, rather than adopting their account as a universal definition of all computation. See When Does a Physical System Compute?, 2014, §§VI–VIII.
Turing’s 1936 construction of a universal computing machine provides a historical demonstration that an executor can interpret an encoded description of another machine’s procedure. That helps distinguish the rule description, its interpreter and the realized operation. The finite interpreter in C.29.2:5.1 provides a small entry to that distinction. Use C.29.2 for the computation-specific cost account when a resource limit matters; :4.4 carries that cost and the computation’s meaning into the joint use. See Turing, On Computable Numbers, §6.
These contributions answer different construction questions. The synthesis is to hold their input and result meanings together for a physical use, inspect their joint and alternative dependencies, and let a failed connection determine the next contribution. It preserves mathematical, empirical and realization grounds at the points where they are needed.
B.5.MPC:10.3 - Why notation and understanding remain part of the work
An expression can help a practitioner perform a construction. Macbeth’s account of paper-and-pencil reasoning explains how a diagram or inscription can participate in the reasoning, including by allowing the same content to be analysed in more than one way. Dutilh Novaes examines formal languages as cognitive tools whose use depends on learned abilities to read and manipulate signs. These accounts support the operative expression step in :4.3. They do not establish that a notation improves every task or that a human learning effect transfers unchanged to AI. See Macbeth, 2011 and Dutilh Novaes, 2012, §§3.2, 5.2 and 6.1.
For this Method, the practical consequence is precise. Naming the same count N in several expressions is useful only while its participant and operation remain recoverable. A gear graph helps reason about closed contact paths because its edge meaning and traversal rules are available. The four card states distinguish occupancy from reservation throughout entry and exit, where an undifferentiated “not free” count gives only a bound. These are changes to what the expression helps someone do, not merely choices of appearance.
A second alternative is to make one formal language carry the whole inquiry. This can help when a mature language expresses the required physical, mathematical and execution distinctions and its users can work with it. If it cannot express a necessary distinction, use another representation or develop the language. Retaining interpretable correspondences allows several forms to contribute without assuming that one form already covers the whole problem.
Levenchuk’s 2012 robotics account describes difficulty combining familiar speed calculations, several distance quantities, program expressions and physical timing. It motivates changing the question while retaining the interpreted relations in :4.3, and examining the timing of observation and execution in :4.5. The account is a historical report of a particular learning situation. The resulting Method here is a methodological synthesis.
AI can reduce the cost of obtaining a calculation, candidate proof or explanation while leaving the choice and interpretation of the receiving question open. Klowden and Tao discuss the difference between a formally checked statement, its intended meaning and the understanding that enables further use. Section :4.8 turns that distinction into a contribution question: who can recover the decisive connection and adapt it when the premise changes? This is a capability to arrange, not an assertion that every participant must reproduce every proof. See Mathematical Methods and Human Thought in the Age of AI, 2026, §4.
B.5.MPC:10.4 - Why a sufficient answer can also open a better question
Deutsch’s discussion of foundational theories treats their connections as sources of criticism across areas, rather than relying on a theory’s foundational status to settle another question. This motivates examining how a claim about computation constrains a physical proposal and how physical knowledge constrains an executing arrangement. The specific correspondences still require their arguments. See Deutsch’s interview on The Beginning of Infinity.
The same connection work can generate a worthwhile next problem. The robot account raises which observations distinguish rolling from slip. The gear witness raises which physically available contact change removes the obstruction. The card bound raises whether redistribution can reduce waiting while preserving the shared stock. Each continuation identifies an additional possible action and a construction or uncertainty that matters to it.
A sufficient answer remains a legitimate stopping point when the current use is complete. When inquiry development is selected, retain the useful connection and work a consequential change to the question or apparatus. A general invitation to keep exploring supplies less direction than the particular obstruction or newly available operation.
B.5.MPC:11 - SoTA-Echoing
For the declared coordination question, the selected answer is the explicit combination of physical interpretation, operation-preserving mathematical use, computational formulation and realization comparison. The sources below supply particular advances and alternatives. The combined Method is a methodological synthesis. The three cases are constructed under their stated conditions. Neither supplies a measured advantage for every discipline, reader or team.
| Practice question | Selected line, comparison and change to this Method | Limits and condition for reconsidering the choice |
|---|---|---|
| How should a discrepancy between a physical prediction and an indication be investigated? | Dounas-Frazer and Lewandowski’s 2018 account of experimental modeling distinguishes the model of the physical system from the model of the measuring system and distinguishes changing either model from changing either apparatus. Adopt these separate contributions in :4.2 and the return in :4.6. Compared with fitting one model directly to raw readings, this exposes whether the observation relation itself needs repair. Source, §2. | The source develops a framework for experimental-physics modeling; it supplies neither every physical law nor the whole joint Method. Reconsider the selected return when another diagnosis better distinguishes the live causes or when the current physical question needs no measurement. |
| What makes a mathematical result usable after changing its representation or receiving operation? | Fong and Spivak’s preservation-under-composition account supplies a precise comparison where category-theoretic structure is applicable. Adapt it through C.29.1 and :4.3 to the equality, bound or behavioral relation actually needed. Compared with transferring a result because formulas look alike, this exposes a failed operation or a lost distinction. Source, §3.3.2. | Mathematical preservation does not establish the physical account. Use a less elaborate direct argument when it supplies the same comparison; reconsider the chosen relation when the receiving operation or tolerated loss changes. |
| What connects a valid computation to an available physical execution? | Horsman and colleagues explicitly compare abstract evolution with preparation, physical evolution and interpretation. Adopt and adapt this construction in :4.5. Abstract refinement and a successful software trace remain useful alternatives for their own questions, but leave input range, material exclusivity or physical result reading open when those are the unresolved connection. Source, §§VI–VIII. | This is a specific account of physical computation, not a universal criterion established for every use. Reconsider the selected realization when its actual operations or observation rules change; reuse it directly when the receiving conditions remain supported. |
| When should notation be changed during the reasoning? | The operative-notation accounts discussed in :10.3, together with Zhang and colleagues’ How Notations Evolve (2026), support relating meaningful distinctions to the expressive and perceptible differences of a notation. Adapt that question in :4.3: construct an expression and try the operation it should support. Compared with assessing the appeal of isolated symbols, this can expose an omitted count meaning or an unusable compound expression. Contemporary study. | The historical analysis supports notation-design questions; it does not demonstrate that these particular expressions improve human or AI performance. Reconsider the scheme when the intended operation cannot be performed or a meaningful difference cannot be recovered at acceptable effort. |
| What understanding is still needed when proof and calculation can be obtained from AI? | Klowden and Tao’s 2026 discussion separates proof production and formal verification from interpretation and the understanding used to extend an argument. Adapt that distinction in :4.8: obtain the needed contribution and retain capability to recover its receiving connection. Compared with accepting a polished answer or requiring every receiver to reproduce its full derivation, this targets the understanding the next work actually consumes. Source, §4. | The source combines observations, arguments and forecasts; it establishes no universal allocation of human and AI work. Reconsider the allocation when support, capabilities, required adaptation or consequences change. |
The source-supported distinctions remain useful even when their historical origin is older than a current tool. Their selection here depends on the defects and constructive differences in these comparisons. Further disciplinary development can supply better constructions, representations or realization Methods without replacing the need to interpret their joint result.
B.5.MPC:12 - Relations
| Relation | Concrete contribution |
|---|---|
| Specializes B.5 — Canonical Reasoning Cycle | Retains question formation, selection of a missing contribution, result understanding and sufficient-result closure; adds the joint physical, mathematical and computational connections and their dependencies. |
| Uses B.5.4 — Recognize a Reusable Concept in a Concrete Situation | Supplies recognition of an explained concept’s participants and relations when the physical situation has not yet been interpreted through it. |
| Uses C.29 — Mathematical Lens Use | Constructs the mathematical account and returns its consequence to the working question. |
| Uses C.29.1 — Mathematical Result Transfer | Constructs the correspondence and tests the operations and distinctions needed to carry a result between mathematical accounts. |
| Uses C.29.2 — Computational Formulation | Constructs the computational state, operations and obtaining procedure, with the result argument and resource account that its use needs. |
| Uses C.29.3 — Computational Realization | Compares input preparation, system operation and readout with the required result, and returns a failed connection to its repair. |
| Uses A.3.3 — U.Dynamics | Supports the construction of configurations, retained state and allowed continuations when the receiving prediction or operation requires them. It uses the supplied subject laws and interaction rules. |
| Uses C.16 — Measurement and Metrics Characterization | Constructs and interprets the measurement relation connecting the sought quantity, apparatus influences and indication. This contribution is needed when the joint consequence consumes an observation. |
| Uses A.6.3.RT — Representation-Scheme Transition | Constructs an operative expression under an available scheme and compares its content and use with the source. The applicable subject Method supplies any new conclusion obtained with that expression. |
| Uses A.6.1 for realization semantics | Keeps a declared operation, its realization relation and the performance of a Method distinguishable when those claims matter to the executing arrangement. |
| Uses A.15.9 for a needed contribution from another practice | Helps obtain the specific result, explanation or formulation that the next operation needs, with its receiving use made explicit. |
| Coordinates with C.39 and C.40 | Searches for a missing way and develops the problem or Method repertoire when the existing connections expose a worthwhile construction question. |
| Uses C.11.DUA for a decision about further effort | Compares whether additional calculation, observation, explanation or checking can change the receiving action enough to justify its cost. |
| Uses B.3 and B.3.3 for stronger assurance questions | Qualifies evidence and assurance for the particular claim and use when a conditional consequence or ordinary construction no longer suffices. |
B.5.MPC:End
B.5.MPC.R - Repair a Physical-Mathematical-Computational Connection
Type: Method pattern Status: Stable Normativity: Normative unless marked informative
B.5.MPC.R:1 - Problem frame
Use this pattern when a physical question has an attempted answer, but the physical account, mathematical reasoning, computation or observed execution no longer fit together. A requested result may have changed, a command may produce an unexpected motion, or an observation may fail to distinguish the physical possibilities that the answer assumes.
First useful move: state the difference that now matters and compare the two contributions at the point where their meanings or results disagree. For a delayed robot stop, compare the duration used in the distance calculation with the duration for which the motor remained active.
The useful result is a repaired connection and its consequence for the physical question, or a located incompatibility that directs the next contribution. The method specializes B.5’s reasoning revision for the joint work described by B.5.MPC. B.5.RR supplies the general treatment of affected reasoning, shared prerequisites and sufficient alternatives.
The practitioner needs the subject knowledge required to interpret the contributions, or access to that help. Use a known adequate correction directly when its conditions fit. Use B.5.MPC when the joint account has yet to be constructed. A fault already located within one discipline can proceed through that discipline’s diagnostic or repair method.
B.5.MPC.R:2 - Problem
Local success can survive a failed joint answer. Algebra can produce a command beyond the device’s range. A frequency calculation can correctly analyze samples while those samples are compatible with several physical frequencies. A voltage measurement can be accurate for the connected circuit while the question concerns the circuit before the meter was connected.
Trying harder within the successful contribution can leave the failure unchanged. More arithmetic precision does not make an unavailable command executable. More samples taken under the same ambiguous sampling relation may preserve the ambiguity.
The difficulty is to locate which connection fails and change the contribution that can repair it. Several accounts may explain the same discrepancy, so an observed disagreement must not be assigned to a particular component before the available reasoning distinguishes those possibilities.
B.5.MPC.R:3 - Forces
| Force | Tension |
|---|---|
| Local correctness and joint usefulness | A valid result can answer a question different from the receiving physical question. |
| Stable relations and changed unknowns | The same physical relation can serve several questions, but each may require a different computation. |
| Observation and intervention | Obtaining an indication can change the state or conditions whose behavior is being inferred. |
| Economical repair and unresolved alternatives | A short correction can suffice; an ambiguous discrepancy may need a discriminating observation or a conditional result. |
| Useful abstraction and realizable operation | Mathematical possibilities can exceed the preparation, timing or range of the available apparatus. |
B.5.MPC.R:4 - Solution
Keep the receiving physical question in view while tracing the failed connection:
State the changed result or disagreement → recover the contributing relations → locate the incompatible use → construct a sufficient repair → carry it through the affected contributions → use the revised physical consequence.
These are dependencies of the repair. A known physical change, a failed calculation or a surprising observation can each be the starting point.
B.5.MPC.R:4.1 - Compare results for the same physical question
Name the physical difference that the answer must resolve and the conditions under which it is wanted. Put the attempted result beside the changed request or observation. Recover the participants, units, times and operating regime needed to compare them.
For instance, a predicted displacement during eight seconds of motor operation and a measured displacement during eleven seconds concern different durations. Aligning the comparison may already explain the discrepancy.
If the question changed, say which quantities are now supplied and which must be determined. Keep the physical relation available while choosing its new use. A velocity-to-duration calculation can become a duration-to-command calculation.
If the comparison concerns a performance claim, recover the observation and its measurement relation. An acknowledgement can supply information about command reception while leaving physical completion unobserved.
B.5.MPC.R:4.2 - Recover what each contribution supplies to the next
Start at the mismatch and follow the needed relations in both directions. Ask what the receiving operation takes as input, what the supplied result actually represents and which condition permits that use.
The following questions distinguish common repair locations. Use the ones that can explain the disagreement.
| Connection to inspect | Question that can locate a repair |
|---|---|
| Physical account to mathematical formulation | Which interaction, boundary or operating assumption licenses this equation or constraint? |
| Mathematical formulation to computation | Does the procedure obtain the quantity or property now requested, with the required constraints and approximation? |
| Representation to another representation | Which distinction or operation must survive, and does the correspondence preserve it? |
| Computation to executing arrangement | Can the arrangement prepare the input, perform the operation and finish with the state or result being used? |
| Observation to physical inference | Which physical possibilities can produce this indication under this measurement procedure? |
Explain an unresolved connection in the working notation. Use B.5.RA to recover a needed argument and B.5.RC to recover a construction. C.29.1 compares mathematical transfers; C.29.2 constructs a computation; C.29.3 compares a computation with its realization. Their results answer the corresponding rows, while the physical question determines which row matters.
Keep a common premise visible across different contributions. An analytical calculation and a simulation that both assume no slip leave the same question open when slipping is suspected. A different algorithm is a sufficient alternative only if its premises and output interpretation fit the receiving use.
B.5.MPC.R:4.3 - Locate the incompatibility without guessing its cause
Work a small instance or derive a consequence that distinguishes the competing accounts. If a command is outside the admitted range, its value and range already establish that incompatibility. If two physical inputs produce the same represented data but require different answers, exhibit those two inputs and their common representation.
When several explanations remain, compare what each would require you to change. A motion discrepancy might come from calibration, a retained command or an incorrectly interpreted position. Recover an available observation that distinguishes those accounts, or choose a worthwhile further observation through C.11.DUA. An investigation is unnecessary when a sufficient bound or conditional answer already settles the present decision.
Account for what the observation does. Identify which processes continue during measurement or debugging, which input remains applied and which state is changed by the probe. Use A.3.3 for the state and C.16 for the measurement relation when that construction is unresolved.
A mathematical account may support several physical interpretations. Compare their additional physical assumptions and the observations or interventions that distinguish them. Retain an unresolved difference when the available observations do not decide it; use the consequences shared by those interpretations when they suffice.
B.5.MPC.R:4.4 - Construct the repair that the receiving use needs
Choose the contribution that can remove the located incompatibility. The choice follows its cause and the wanted result.
- If the requested unknown changed, retain the interpreted relations, release the former fixed value where appropriate and derive the new computational direction.
- If a representation merged cases that the question must distinguish, retain the missing information, obtain a different observation or use a result that the merged representation still supports.
- If the procedure uses the wrong operation, constraint or approximation, replace that part and establish the property the receiving use needs.
- If the physical or measurement account omits a consequential interaction, model that interaction or change the arrangement so that the retained account applies.
- If execution differs in preparation, range, state or completion, revise that part of the realization or choose an available realization that supplies the required behavior.
An expression of an equation states a relation; an assignment or solver performs a chosen operation. Keep the equation’s meanings when generating or editing that operation. A modelling environment can help transform the equation system, but the physical interpretation and the requested result still guide the choice.
Compare the repair with a sufficient alternative. Changing a deadline may be cheaper than replacing an actuator. A useful ambiguity result may suffice before changing measurement equipment. Present a changed requirement as a choice for the receiving work.
B.5.MPC.R:4.5 - Carry the repair through its dependents
Use B.5.RR to derive the affected consequences. Reuse contributions whose conditions and meanings still fit; revise each needed use of a changed shared premise.
Compare the repaired contributions on the same input or physical case. For a mathematical change, derive the needed property. For numerical work, carry the error relevant to the physical question. For an execution claim, compare the prepared state, operation and interpreted observation with the intended result.
Keep the comparison at the claim’s scope. A conditional calculation can establish what a proposed arrangement would do under its assumptions. Actual performance requires the observations and inference appropriate to that use.
If the comparison still fails, follow the remaining disagreement. Do not repeat a test that leaves the live alternatives indistinguishable. Change the question or obtain the missing contribution when the present means cannot settle it.
B.5.MPC.R:4.6 - Return the physical consequence and the next useful action
State what can now be understood, constructed or changed. Return a usable command, corrected interpretation, realizability bound or a remaining ambiguity with its effect on the receiving decision.
When work is divided, give the next contributor the quantities and conditions at the unresolved connection, the result needed and how it will be used. The receiver must be able to reconnect the supplied contribution to the physical question. A.15.9 helps obtain that contribution.
The repaired reasoning may reveal another worthwhile problem: extending an operating regime, constructing a more informative measurement or developing an operation for a changed class of questions. Carry that possibility into B.5’s next inquiry when pursuing it would enable further work.
B.5.MPC.R:5 - Archetypal Grounding
These are constructed cases under stated models. They demonstrate different repair locations and the contributions that follow from them.
B.5.MPC.R:5.1 - A robot receives a new deadline, then keeps moving during a pause
A robot must travel d=1 m along a straight guide. In the stipulated regime, constant speed obeys v=k*u, where u is a dimensionless command and k=0.2 m/s. The model initially idealizes starting and stopping as immediate. The available command range is 0<u<=0.8.
With u=0.5, the relation d=vT gives T=d/(ku)=10 s. The question then changes: find the command for T=5 s. Keep the relations but choose u as the unknown:
u=d/(kT)=1/(0.25)=1.
The algebra supplies a value outside the available range. The corresponding lower bound on duration is T>=1/(0.2*0.8)=6.25 s. This answers the feasibility question before another controller is written. Changing the deadline or the available motion capability is now a meaningful choice.
Suppose the requester chooses T=8 s. The required command is u=0.625, giving v=0.125 m/s. A controller applies that command, counts eight seconds of active program execution and then issues stop.
During a diagnostic run, a debugger freezes the program and its timer for three seconds. In this example the output retains u=0.625 and the motor continues to run. The stop is therefore issued after eleven seconds of physical operation, giving d=0.125*11=1.375 m under the model.
The disagreement concerns execution timing. The equation and chosen command remain appropriate to eight seconds of motion. If the question concerns an uninterrupted run, observe that run under its intended timing. If such pauses can occur in the required operation, provide a stopping mechanism whose elapsed-time behavior survives the pause, or revise the control arrangement accordingly. Test its physical completion at the condition the use needs.
For example, suppose an independent timer can remove the motor command and continues to run while the controller is paused. Start it with the command and set it to remove the command after eight physical seconds. Under the example’s immediate-start/stop model, motion then lasts eight seconds and covers 0.125*8=1 m, including a run with the three-second program pause. Compare the timer’s actual behavior with those conditions before relying on that performance. If no such mechanism is available, the next contribution is a way to stop motion with that timing or a revised operating requirement.
A real stopping delay or speed transient would be another changed premise. Incorporate it when predicting final displacement; acknowledging stop does not measure that displacement. The example’s next useful result is a duration bound or a repaired timing design with an identified performance question.
B.5.MPC.R:5.2 - A correct spectrum calculation answers an ambiguous physical question
A measurement uses uniformly spaced samples at f_s=100 samples/s. The earlier physical account admits a single sinusoidal signal with frequency below 50 Hz. A spectrum calculation returns a 10 Hz component, interpreted under that restriction.
The apparatus is changed and the admitted frequency range becomes 0 to 120 Hz. The same interpretation is now in question. For ideal samples of a unit-amplitude cosine at times n/100 seconds:
cos(2π90n/100)=cos(2π10n/100)
for every integer n. This follows because 90/100=1−10/100 and cosine is periodic and even. A 110 Hz cosine gives the same samples as well.
Consequently, the sampled sequence fits physical frequencies 10, 90 and 110 Hz in the new range. The spectrum calculation can remain correct for its input. Increasing its arithmetic precision or merely collecting more samples at the same times leaves this ambiguity.
To determine which frequency is present, change a contribution that distinguishes those cases. For the stipulated single-tone model, sampling at 300 samples/s places the whole admitted range below half the sampling rate. A three-second record of a 90 Hz signal then contains 270 cycles; the spectrum can return 90 Hz under the stated ideal timing and signal assumptions.
For a physical measurement, obtain the needed sampling and input-conditioning behavior from the instrument account. Frequencies outside the admitted band, timing error and an unsuitable analog input path can reopen the interpretation. A filter that removes the signal of interest changes the measurement question rather than recovering its frequency.
The repair is a changed acquisition and interpretation, with a recomputation on the new data. The receiving user can now distinguish a physical-frequency estimate from an unresolved alias. If the old record is all that is available, return the remaining alternatives instead of selecting one without further grounds.
B.5.MPC.R:5.3 - The voltmeter changes the circuit being inferred
An ideal 10 V source drives two 1 MΩ resistors in series. The wanted quantity is the midpoint voltage before a meter is connected. The divider relation gives 5 V.
A voltmeter with 1 MΩ input resistance is connected between the midpoint and the lower terminal. In the connected circuit it lies in parallel with the lower resistor, whose combined resistance becomes 0.5 MΩ. The same divider construction now gives:
V_mid=10*0.5/(1+0.5)=10/3 V.
The indicated value can agree with the connected-circuit model. Comparing it directly with the unloaded prediction had omitted the meter’s interaction.
One repair is inferential: with these resistor, source and meter models, recover the unloaded value from the model, keeping its conditional status. Another is experimental: choose a measurement arrangement whose loading is small enough for the wanted use and account for its remaining effect. Repeating the same connection alone preserves the load.
The result tells the practitioner which voltage was observed and how the wanted voltage can be obtained. A different observed value may require revisiting the assumed source, resistor or instrument behavior through their subject methods.
B.5.MPC.R:5.4 - A motion command changes its unit and starting point
In C.29.3’s robot case, the effective wheel radius is 0.05 m, ten motor revolutions turn the wheel once, and the interface counts 1,000 increments per motor revolution. A two-metre displacement requires a total of 63,662 motor increments after rounding. C.29.3 handles sending that total through the available command field.
Now change the radius to 0.06 m and the interface to an absolute wheel-position target. It counts 1,000 units per wheel revolution, currently reads 3,000 and admits targets from 0 to 65,535. The requested forward displacement remains 2 m. Assume rolling without slip and completion at the commanded count.
Recover the count’s new meaning before reusing the calculation. If q is the target, the wheel travels (q−3,000)/1,000 revolutions, so the model gives:
d=(q−3,000)/1,000 * 2π * 0.06 m.
The new scale already counts wheel revolutions; use that scale to obtain the needed increment:
Δq=2/(2π*0.06) * 1,000 ≈ 5,305.16477.
Round to 5,305 and add the initial count, giving target q=8,305. This target is admitted. Its modeled displacement is approximately 1.99993788 m. Nearest-integer rounding contributes at most half a count, corresponding to π*0.06/1,000 m ≈ 0.00018850 m; compare that contribution with the receiving accuracy requirement.
Reusing the former total 63,662 as the absolute target would pass the new range check but give approximately 22.8690 m under this model. The value has changed from a relative motor increment to an absolute wheel position. The repair therefore changes the physical parameter, the count-to-motion correspondence and the computational use of initial state together.
The useful return is the new command with its displacement and rounding consequence. A changed starting count requires recomputing the target; a changed radius or count scale reopens their correspondence. A slip or incomplete motion requires the relevant physical or execution repair. C.29.3’s preparation and completion comparison can then use this revised command.
B.5.MPC.R:6 - Bias-Annotation
The cases use elementary models so the connection can be worked explicitly. Nonlinear dynamics, statistical observations or coupled physical computations can require more demanding subject contributions. Preserve their interaction and uncertainty conditions when applying the same repair method.
A visible software failure can attract attention even when the computation is correct and its physical interpretation is wrong. Compare the meaning of the input and output before choosing a programming repair.
B.5.MPC.R:7 - Conformance Checklist
- The attempted and wanted results concern a stated physical question and comparable conditions.
- The contribution supplied at the disagreement has an interpretable meaning and receiving operation.
- The repair distinguishes a located incompatibility from an unresolved diagnosis.
- Shared premises remain visible across calculations, simulations and observations.
- The repair changes the responsible relation, procedure, realization or requested result.
- Its dependent consequences are reworked and returned at the supported scope.
- The receiver can perform the next action or identify the contribution still needed.
B.5.MPC.R:8 - Common Anti-Patterns and How to Avoid Them
| Failure | Consequence | Repair |
|---|---|---|
| Solve for the former unknown | A correct formula answers the old question. | Retain the relation and select the givens and unknowns again. |
| Refine the computation of ambiguous data | The physical alternatives remain indistinguishable. | Change acquisition or return the supported ambiguity. |
| Treat debugger time as physical time | A retained actuator command can continue to act during the pause. | Recover the actual timer and actuator behavior. |
| Treat a probe as passive despite its coupling | The observed system differs from the modelled unobserved arrangement. | Include the probe interaction or change the measurement. |
| Switch algorithms while retaining the disputed physical premise | The alternative preserves the same failure. | Compare its complete application conditions. |
B.5.MPC.R:9 - Consequences
The method makes a failed joint answer useful: the disagreement can reveal a range limit, a lost distinction, an omitted interaction or a missing construction. It also supports division of work by the contribution needed at the failed connection.
The cost is reconstruction across disciplinary boundaries. A sufficient conditional result or a known correction can keep that effort small. Where several causes remain compatible with the evidence, the result can remain a bounded diagnostic question.
B.5.MPC.R:10 - Architectural Rationale
The common revision method B.5.RR follows affected reasoning. This specialization adds the recurring correspondences that a physical application consumes: a physical account expressed mathematically, an interpreted computation and a realized or measured operation. It lets the practitioner choose the repair that can change the physical answer.
Working from the disagreement can settle the question with a bound or identify the observation that must change.
The physical and mathematical accounts need each other without becoming the same account. A mathematical equality can expose why two frequencies have identical samples. The physical sampling arrangement determines whether those are the relevant possible inputs. Computational analysis then operates on the resulting data. The useful knowledge comes from keeping those relations together; applying it can change the measurement method itself.
B.5.MPC.R:11 - SoTA-Echoing
How can an expression help locate a failed connection? Adapt Sussman and Wisdom’s Structure and Interpretation of Classical Mechanics, second-edition preface (2015): expressing mathematics as executable procedures exposes operations that informal notation can leave implicit. Sections 4.2 and 4.4 use that feedback where available. Compared with polishing a symbolic answer alone, it can locate an unusable operation; its extra formalization is worthwhile only for the receiving question.
What survives a changed computational direction? Adapt the separation of equation models and generated computations in ModelingToolkit’s version-10 documentation, alongside Ma et al.’s 2021 account. Section 4.4 retains relations while changing givens, unknowns or the obtaining procedure. This supports acausal modelling rather than making one assignment direction part of a physical law. An adequate explicit formula remains cheaper for the robot’s small calculation; no modelling platform is required.
When must observation be treated as an operation? Adapt Khrennikov’s Contextual Measurement Model (2024), §§2.1–2.2: the measurement procedure can change the context used by subsequent inferences. Section 4.3 therefore recovers that operation when it matters. The passive-observation account remains useful where its approximation is adequate. The voltmeter case supplies an elementary circuit construction of an interacting probe; broader physical interpretations need their own assumptions and observable consequences.
Which sampling repair changes the physical inference? Use NI’s sampling and aliasing account, “Sample Rate” and “Aliasing” for the acquisition constraint and input conditioning. Section 5.2 derives its alias equality explicitly and states f_s and the admitted signal band. Compared with increasing numerical precision, changing acquisition can distinguish the physical cases. The instrument’s bandwidth, filtering and timing remain part of that repair.
Reopen the source choices when a physical theory, representation, computational method or executing technology supplies a better way to resolve the same disagreement. Compare the actual operation, consequence and conditions that let the receiving work use it.
B.5.MPC.R:12 - Relations
- B.5.MPC constructs the joint physical, mathematical and computational answer; this method repairs an attempted connection.
- B.5.RR revises affected reasoning. B.5.RA and B.5.RC recover an argument or construction needed for that revision.
- C.29.1, C.29.2 and C.29.3 supply mathematical transfer, computational formulation and realization.
- A.3.3 constructs the relevant state and continuation account. C.16 constructs and qualifies the measurement relation.
- A.6.3.RT helps express the changed relation or operation. A.15.9 helps obtain another practice’s contribution.
- C.11.DUA compares further effort with its effect on the receiving decision. B.3 and B.3.3 supply claim-specific assurance when required.
B.5.MPC.R:End
B.5.RC - Recover a Construction from Its Description
Type: Method pattern Status: Stable Normativity: Normative unless marked informative
B.5.RC:1 - Problem frame
Use this pattern when a description points to a result you need, but you cannot yet recover how to obtain it from what is available. You may be reading a mathematical construction, an assembly method or a way to transform data. The difficulty is in the connection between starting material, allowed operations and the required result.
Here, a construction is a way of obtaining an object by applying operations to given objects. In a mathematical construction, those operations form mathematical objects. In an assembly method, they may produce a design or a physical assembly; identify which result the description promises. The relevant practice supplies the operations and their application conditions.
First useful move: name the result needed for the next use, then find the operation that could produce it and what that operation requires. Follow those requirements back to available starting material. Work a small instance forward to recover the missing connection.
This method needs access to the description and enough subject knowledge to interpret its objects and rules. Use an adequate known construction directly. If the task is to invent a method where no usable account is available, use C.39 for that development; a missing operation discovered here can become its input.
B.5.RC:2 - Problem
A reader can recognize the name of a result and repeat its desired properties while remaining unable to construct it. The source may compress several operations into one verb, leave a prerequisite implicit or describe a property without giving a procedure that produces an instance.
Execution then fails at the first unprovided intermediate result. Guessing a plausible step can make the example work while changing the method being recovered. Repeating the requirement leaves the difficulty in place.
The useful result is a recovered construction that can be performed for the intended case, or a localized missing contribution that makes the next source return, specialist request or method-development move possible.
B.5.RC:3 - Forces
| Force | Tension |
|---|---|
| Required result and available means | Working backward keeps the desired result in view; working forward reveals what the available operations can actually produce. |
| Source fidelity and useful invention | Filling a gap may solve the task, but the added operation then needs its own justification and must remain distinguishable from what the source supplied. |
| Properties and ways of obtaining an object | A property can guide construction or follow from it. The next use determines whether an existence result suffices or an instance must be obtained. |
| Shared prerequisites and execution order | Several steps may use the same object, and one step may need several results together. A simple list can hide either relation. |
| Small case and reusable method | A small case exposes missing operations cheaply; broader use depends on which conditions and operations survive the change of case. |
B.5.RC:4 - Solution
Recover the construction in two connected directions: from the required result toward its prerequisites, then from the available inputs toward a result. Keep the needed property in view throughout. The following actions form a useful working order; return to an earlier action when a missing condition changes the construction.
B.5.RC:4.1 - Fix the result and starting situation
Say what the next user needs to obtain and what they will do with it. Recover the conditions that distinguish a usable result: for example, a triangle on a supplied side, a display design that uses the supplied fittings, or data in the format required by a calculation.
Identify the starting objects and information already available. Distinguish an object supplied by the task from one the construction must produce. If a property alone answers the question, keep that smaller task. When an instance is needed, locate the operation that could obtain one.
Choose a small case that retains the troublesome dependency. A case that omits the unfamiliar operation cannot resolve how that operation works.
B.5.RC:4.2 - Recover the operations
Read the description for ways of forming, transforming or combining the objects. For each operation needed by the case, recover:
- what it takes as input;
- the conditions under which it can be used;
- what it produces.
This information can appear in a definition, diagram, earlier construction or convention used by the source. A verb such as “combine” is enough only when its operation is already recoverable. Otherwise ask which parts are combined and how.
In a mathematical account, include the formation and equality rules that the construction uses. A rule for forming an object and a claim about its properties do different work: the first supplies an object for a later operation, while the second may justify applying that operation. Both can be needed.
Use the rules of the account being recovered. For a physical assembly, a joining operation may require compatible fittings and available components. For a mathematical expression, using one value at two places depends on the rules of that expression. Recover the relevant condition where the construction actually relies on it.
B.5.RC:4.3 - Follow prerequisites backward
Start with an operation that produces the required result. Ask what must be available just before it can be applied. Repeat for any prerequisite not yet supplied.
Keep joint prerequisites together: drawing a segment between two points requires both points. Keep alternative constructions separate: either one complete construction or another may produce an acceptable result. Where several later steps use an intermediate object, retain that shared dependency instead of silently creating several unrelated objects.
Stop tracing a branch when it reaches an available input or an understood subconstruction whose starting inputs are available. The resulting dependency structure may have shared parts and alternatives. Draw it when that helps retain them; the structure does not have to be expressed as a graph.
If tracing returns to a result that it already requires, examine the source. It may describe an iterative construction with a starting value and stopping rule, a simultaneous problem with a separate solving method, or an omitted prerequisite. Recover that method or prerequisite before treating the circular description as executable steps.
A missing operation gives a focused question: “How is this intermediate object obtained under these conditions?” Return to the relevant source passage or specialist with that question. When you propose an operation yourself, treat it as a contribution to the construction and establish the conditions for using it.
B.5.RC:4.4 - Work the small case forward
Begin with the available inputs. Apply an operation when its prerequisites and conditions hold, retaining the output needed by later operations. At an unfamiliar transition, write, draw or perform enough of it to see what changes.
If the construction uses a notation you can read but cannot operate with, use A.6.3.RT to prepare a usable expression under its rules. If interpreting the notation itself remains the difficulty, obtain that missing preparation. A more legible expression helps only when it preserves the relation required by the operation.
Where an operation admits several outputs, select one that permits the intended continuation. If the source only guarantees that some suitable object exists, determine whether its account also provides a way to obtain the instance your next use needs.
Retain the difference between the construction being described and the particular trial. One successful trial can reveal the method and expose a gap. A claim about a whole class of inputs additionally needs the argument or other subject support appropriate to that claim.
B.5.RC:4.5 - Establish the useful property and continue
Recover why the constructed object has the property the next use requires. An auxiliary construction can make the argument possible; an established property can permit the next construction step. Use B.5.RA when the argument is present but its reasoning remains unclear.
The useful stopping point can be:
- the required object and a sufficient account of the property being used;
- a conditional construction whose unresolved condition matters to the next decision;
- an identified missing input or operation, with enough context to obtain it.
Select the support needed for that next use under C.11.DUA and the relevant subject method. A design calculation, mathematical proof and trial assembly answer different questions. If an existing result already supplies the needed support, use it.
An explanation to a collaborator should let them continue from the recovered result or address the localized gap. Use the working drawing, expression or conversation when it already carries that information.
B.5.RC:5 - Archetypal Grounding
B.5.RC:5.1 - Recovering an equilateral-triangle construction
A reader has two distinct points A and B in the Euclidean plane and needs an equilateral triangle on side AB. The description says to draw two circles, each centred at an endpoint and passing through the other endpoint, and use an intersection as the third vertex.
The reader recovers three operations: draw a circle with the given centre and radius; select a common point of the two circles; join two given points by a segment. The third vertex requires both circles. The final triangle requires that vertex together with A and B. The two circles share the segment length AB as radius.
For a small case, place A at (0,0) and B at (2,0). The circles have equations x²+y²=4 and (x−2)²+y²=4. Subtracting gives x=1, and substitution gives y²=3. Thus the two common points are (1,√3) and (1,−√3). Selecting C=(1,√3) supplies the vertex above AB. Joining A to C and B to C completes the construction.
The property follows from how C was obtained: AC and BC are radii of circles of radius AB, so AC=BC=AB. The coordinate calculation also supplies the intersection in the Euclidean-plane account used for this case. A description formulated under a different set of construction rules must obtain that intersection under those rules.
The recovered dependency is reusable for another positive side length. The value of the coordinates changes, while the two equal-radius circles and the common-point construction retain their roles. If A and B coincide, the initial requirement of a nondegenerate triangle fails; that case needs distinct endpoints before this construction can begin.
The Euclidean account supplies the circle and segment operations and their justification.
B.5.RC:5.2 - Recovering a display-stand assembly design
A specification asks for a portable display. It supplies a base, an upright and a panel, together with these rules: the upright can be joined to the base when their fittings match; the panel can be attached to the mounted upright when their fittings match.
Working backward from an assembled display yields a mounted upright and a compatible panel. Recovering the mounted upright yields the base, upright and their fitting condition. Working forward gives the assembly order: join base and upright, then attach the panel.
Inspection of the supplied parts reveals that the panel fitting differs from the upright fitting. The method has localized the obstruction. Available continuations include obtaining a compatible panel, developing an adapter with usable connection rules, or choosing another assembly design. “Assemble the display” alone does not select among them.
Suppose a compatible panel is supplied. The recovered design now connects the three components in the required order. Portability is still assessed against the actual carrying requirement, and stability against the loading and support conditions. Those engineering questions can change the design, but they are distinct from the recovered answer about how its parts connect.
The first useful result is the assembly design or the fitting mismatch that prevents it. Physically assembling and testing the stand are subsequent work selected by the intended use.
B.5.RC:6 - Bias-Annotation
A fluent description can hide an unfamiliar operation behind a familiar verb. Keep attention on what the operation takes, permits and produces. Conversely, a highly formal description can make an existence claim look like an executable recipe; use the next task to decide whether a witness or construction procedure is needed.
Examples can also narrow the apparent method. The circles in :5.1 and fittings in :5.2 supply different subject operations. The common move is recovering and using their prerequisites, including the property needed for continuation.
B.5.RC:7 - Conformance Checklist
For the construction being recovered:
- The needed result and its next use are clear enough to select a useful small case.
- Starting objects are distinguished from the intermediate objects to be produced.
- Each operation needed by the case has recoverable inputs, application conditions and output.
- Joint prerequisites, shared objects and alternative constructions retain their different effects.
- The forward construction reaches a useful result or locates the input or operation that prevents it.
- The property claimed of that result has the support its use requires; a broader claim retains its broader support question.
- An invented addition is identifiable as an addition, and the next collaborator can use the result or act on the gap.
Apply these questions to the work already done. Write a separate account only when its recipient needs one.
B.5.RC:8 - Common Anti-Patterns and How to Avoid Them
| Failure in the working situation | Repair |
|---|---|
| Repeating “construct an object with property P” when the obtaining operation is missing | Recover the last producing operation and trace its prerequisites to available inputs. |
| Flattening a construction into a list that loses a shared object or a joint condition | Preserve those dependencies and perform each operation only when its inputs are available together. |
| Filling an omitted operation with a plausible guess and attributing it to the source | Name the addition and establish how it works, or return to the source for the missing operation. |
| Treating a successful small case as a result for all inputs | Recover which conditions carry the general argument and which belong only to the trial. |
| Continuing source reconstruction after the intended use is already possible | Use the recovered construction; reopen only for a further question that requires more. |
B.5.RC:9 - Consequences
The practitioner can turn a compressed account into an obtainable result and a meaningful division of further work. A specialist request can name the missing operation and its inputs rather than ask for a second explanation of the entire source.
Recovery may expose a gap in the source or in the reader’s preparation. It also costs more than directly using a construction already understood. The stopping rule preserves that cheaper route and allows a useful conditional result.
B.5.RC:10 - Architectural Rationale
Backward recovery and forward construction answer complementary questions. The backward direction reveals what the desired result requires. The forward direction tests whether the available inputs and operations can supply it. Either direction alone can leave a gap: a plausible plan may lack an executable step, while available operations may produce objects irrelevant to the question.
The method follows the construction’s dependency structure. One intermediate object can support several later steps, and several objects can be required jointly. Preserving these relations makes the construction intelligible and helps divide its execution among people and AI agents. The receiving operation determines what a collaborator needs to supply.
Construction and reasoning about properties remain connected. In the triangle case, the construction creates a common point and the circle properties establish equal sides. In the stand case, fitting conditions permit assembly, while load and carrying requirements can lead to design revision. This relation warrants cooperating methods for construction recovery and argument recovery.
B.5 coordinates these contributions within inquiry. C.39 develops a missing method, C.29.2 develops a computational formulation, and A.6.3.RT prepares an operative expression. Their results can supply a missing step here; the source-recovery question does not by itself select every neighbouring method.
B.5.RC:11 - SoTA-Echoing
Constructive and propositional accounts. Rodin’s One Mathematic(s) or Many? Foundations of Mathematics in Today’s Mathematical Practice, especially its discussion of Euclid’s operations and problems, treats object-forming procedures and reasoning about their properties as connected contributions to mathematical practice. This pattern adopts that connection in :4.2–:4.5. It leaves the choice of mathematical foundations to the account being used. A propositional existence result remains sufficient when that is the required result; obtaining a particular instance calls for the corresponding construction.
Problem reduction. Rodin’s Kolmogorov’s Calculus of Problems and Its Legacy, in the 2023 author manuscript’s discussion of reductions among problems, supplies an earlier account of solving one problem through solutions to others. The present method uses that idea for prerequisite recovery, including joint and alternative contributions. It does not require the reader to adopt intuitionistic logic for every subject.
Bounded method choice. For a compressed construction whose result is needed now, compare a linear paraphrase of the source with backward prerequisite recovery followed by a small forward construction. The triangle case requires two circles together; the stand case exposes the unmatched fitting before a complete display exists. The second method is selected because it makes those dependencies actionable. If the source already provides an executable construction understood by the reader, direct use is cheaper. The recovered procedure and the stand example are the present synthesis; the source accounts do not establish an empirical learning gain for this generic method. Reconsider the backward-then-forward approach when, for the same unfamiliar construction and reader preparation, another recovery method supplies the missing operation more reliably at comparable effort.
B.5.RC:12 - Relations
- B.5: selects construction recovery as one contribution to inquiry and connects its result with further reasoning.
- B.5.RA: recovers the argument for a property that construction or later use needs.
- B.5.MPC: uses recovered constructions while connecting physical, mathematical and computational reasoning.
- A.6.3.RT: prepares a usable expression under a notation scheme when the representation obstructs an operation.
- C.29.1 and C.29.2: supply mathematical result transfer and computational formulation when those are the missing constructions.
- C.39: develops a missing way of working from the localized problem.
- C.11.DUA: selects the additional checking or information worth obtaining for the intended use.
B.5.RC:End
B.5.RA - Recover an Argument for Its Next Use
Type: Method pattern Status: Stable Normativity: Normative unless marked informative
B.5.RA:1 - Problem frame
Use this pattern when you have an argument or a reported result but cannot yet understand why it supports the conclusion you want to use. Ordinary prose or dialogue may leave the argument itself uncertain: which claims are being made, which reasons work together and what the speaker is trying to establish. You may need to apply the result, criticize it, explain its decisive step or decide which part survives a proposed change.
The argument is the reasoning that connects premises to a conclusion. It may use a mathematical construction, a calculation or a subject inference from observations. The relevant practice supplies the permitted inference and the grounds for its premises.
First useful move: state what you want to do with the conclusion, then recover the main reason offered for it. Follow the needed intermediate claims until you can explain the decisive transition and its conditions.
The reader needs the subject preparation assumed by the source, or access to the missing explanation. Use an adequately understood result directly when its conditions already fit the task. A request to understand the argument can stop before re-proving every established result it uses. A separate obligation to validate the entire proof or underlying observations selects the corresponding checking work.
B.5.RA:2 - Problem
An argument can be present without being usable by its reader. A reader may recognize each term yet miss why a lemma was introduced, where two premises must be used together, or how a local calculation establishes the general conclusion.
Reading each sentence fluently or checking isolated inferences leaves the overall method uncertain. Reading only the overview can hide a decisive unsupported transition. Either failure prevents useful transfer: the practitioner cannot tell what to use, which condition matters or where to ask for help.
The useful result is enough recovered reasoning to perform the intended use, or a localized gap whose resolution would make that use possible. This may be a conditional conclusion when a needed premise remains open.
B.5.RA:3 - Forces
| Force | Tension |
|---|---|
| Local inference and overall method | Individual transitions can be understood while the purpose of a construction or the route to the conclusion remains obscure. |
| Understanding and checking | Understanding may reuse established results; validating a whole argument can require additional work under a different question. |
| Useful compression and hidden dependence | A lemma can make a long argument manageable, but the reader must know what it supplies and which conditions it uses. |
| Conditional result and unresolved premise | Useful consequences may follow before every premise is established, provided the next use preserves the condition. |
| Source recovery and new reasoning | Repairing a gap can open a valid use, while attribution must distinguish the supplied argument from the reader’s addition. |
B.5.RA:4 - Solution
Recover the reasoning at both the level of its main contributions and the transitions needed for the next use. Move between these levels when a local step changes your understanding of the whole argument.
B.5.RA:4.1 - State the use and read the claim
Name what the result would let you do: calculate a quantity, choose between alternatives, criticize a conclusion, adapt an argument or explain it to someone else. This determines how far recovery needs to go.
Read the conclusion with its objects, domain and conditions. In a mathematical statement, recover the quantifiers: which objects are arbitrary, which may be chosen, and on what a chosen object may depend. In an empirical argument, recover what observations and inference support which population, conditions or phenomenon.
Locate the source’s definitions when a word or symbol admits different readings that would change this use. If a formal statement accompanies an informal one, compare the part of their meanings on which the intended application depends. For example, whether zero is allowed among “natural numbers” can change the statement.
B.5.RA:4.2 - Recover the main reason
Read for the difficulty the argument overcomes and the contribution that overcomes it. Ask why a construction, lemma, decomposition or comparison appears where it does.
Express the main reason in a short explanation: what is established first, what that makes possible, and how the remaining step reaches the conclusion. This may involve a reduction to an easier problem, an invariant, an exhaustive case distinction or another subject method. Use the method actually present in the source.
The first explanation is a working interpretation. Check it against the decisive steps. If it cannot explain why those steps are needed, revise it rather than retaining an attractive summary unrelated to the argument.
B.5.RA:4.3 - Recover the dependencies of the conclusion
Work backward from the conclusion through the claims or constructions it uses. At each needed transition, identify its premises, the inference or operation, and the result.
Keep jointly needed premises together. Preserve an independently sufficient alternative as a separate way to reach the conclusion. Track a shared premise wherever a later step uses it; repeated uses of one assumption do not provide independent support for that assumption.
Distinguish a premise supplied for the argument, a result established earlier and a temporary assumption used inside a subargument. Recover the point at which a temporary assumption is discharged and what then follows. If this logical form is unfamiliar, obtain the relevant explanation before treating the subargument’s assumption as an established fact.
Use established results at the level needed for the task. If the question concerns what a lemma permits, its statement and conditions may suffice. If the question concerns how to alter the lemma’s proof, recover its internal reasoning.
B.5.RA:4.4 - Explain the transition that is still missing
For a transition you cannot follow, recover the relevant definition, rule, earlier result or construction. Apply it to the participants at that transition. Say why these premises license this result and which condition is doing the work.
A useful self-explanation supplies this relation. “I understand this line” reports confidence; a paraphrase repeats the claim. Neither supplies the omitted inference when that is the difficulty.
Work a small instance when it helps reveal the operation or dependence. Then return to the stated scope: the instance may illustrate a general step, while the general conclusion still depends on the argument for all cases in its domain.
If the source’s resources do not close the gap, ask for the missing step with its premises and desired result. A proposed repair is new reasoning until it is justified. Keep the consequence conditional when a premise remains unresolved and conditional use is sufficient.
Where the missing step constructs an auxiliary object, use B.5.RC. Where it makes a statistical, causal or other subject inference, use that subject’s method and conditions.
B.5.RA:4.4a - Construct and examine an argument from prose or dialogue
Use this branch to examine testimony, analogy or a practical recommendation whose support remains open to challenge. When its claims and structure are already clear, begin at :4.4a.5 with the known premises, inference and conclusion; return to reconstruction if a question exposes an uncertainty. Also use this branch when ordinary wording leaves uncertain what is being asserted, what is offered as a reason, or how the reasons reach the intended conclusion. It applies to arguments in your own draft too. Reconstruction produces an interpretation that can be examined; it does not yet establish that the premises or inference are acceptable. Some recovered arguments are deductive, while testimony, analogy and proposals based on expected consequences commonly remain open to challenge.
B.5.RA:4.4a.1 - Recover the question and the claims before drawing links
Read enough of the surrounding text or exchange to identify the question being answered and what the speaker asks the recipient to accept. A recommendation, an assertion about what happened, and an explanation of an accepted event can occur in the same paragraph. Ask of each passage: is this a reason to accept a disputed claim, an account of why an accepted event happened, a question, a request, or background? The word “because” fits both argument and explanation. Their difference here is the work done in the exchange; an explanation can itself contain claims that need argument when challenged.
Write the potentially relevant claims as complete sentences, with enough of their source wording or location to check the interpretation. Resolve “it”, “they”, the occasion and the comparison class where the context permits. Preserve negation, quantities, time, modality and attribution: “Lee says the room may be available” neither asserts certain availability nor independently establishes it. Split a sentence when it contains claims that can be accepted or challenged separately. Do not cut a logical relation into newly asserted facts. “If P, then Q” states a conditional; it asserts neither P nor Q. To use it to reach Q, recover a separate ground for P and preserve whatever qualifications the conditional has.
Clarify only as far as the next use requires. Replacing “works well” with a measured criterion can make a claim testable, but an invented threshold is your proposal until the speaker or source supports that reading. Rhetorical questions can convey commitments, and imperatives can express recommendations. Recover the proposed commitment from context instead of treating every question mark as disposable filler. A literal command alone does not state its justification.
If the conclusion is unstated, propose the claim the offered reasons appear intended to establish. For example, a successful rehearsal with unchanged equipment may support another successful display; it does not by itself establish that another test is unnecessary or that this is the best venue. Keep a reconstructed conclusion distinct from a conclusion you decide to argue for yourself.
B.5.RA:4.4a.2 - Compare consequential readings and try a scheme
Where the wording admits readings that change the support, make the alternatives explicit. Compare them with the actual assertions, the question under discussion, surrounding replies and any shared premise that can be established. Prefer the reading that accounts for those contributions with the fewest unsupported additions. Interpret the speaker reasonably, but do not improve a weak argument into a different strong one and attribute the improvement to them. Agreement with the conclusion is no reason to prefer a reading.
Ask a discriminating question when a reply is available: “By free, do you mean unbooked at that time or without a hire charge?” If the source cannot be consulted, preserve both live readings or limit the use to what they share. Choosing a provisional reading can be sufficient for examining its consequences; it does not resolve the remaining ambiguity.
An argumentation scheme describes a recurring arrangement of premises and conclusion. Try one as a hypothesis about the inference. Fill its places from the recovered claims and identify every place still missing. For expert opinion, find the relevant expertise, the actual assertion and the proposition it is offered to support. Someone who handles a booking calendar can instead know its entries through ordinary access. A professional title by itself does not establish either expertise about this question or knowledge of this occasion.
A missing scheme premise gives a question, not permission to invent its answer. Look for evidence that the source relies on it; if none is available, retain the gap, try a better-fitting scheme, or describe the inference directly. For instance, calling a new expense “a waste” need not invoke sunk costs. The latter reading needs past investment and a claim that stopping would waste that investment. An argument against an unnecessary future expense can have neither. Scheme selection follows the offered support, not the word that first caught the reader’s attention.
B.5.RA:4.4a.3 - Recover the intermediate conclusions and missing grounds
Work backward from the proposed conclusion and forward from its offered reasons. Ask at each join what these reasons, if accepted, support immediately. A booking report may establish availability; availability together with a claim about the rehearsal’s requirements may establish feasibility; feasibility still needs a choice rationale before it supports selecting the venue. Write an intermediate conclusion when this distinction changes what can be challenged or reused. It has both roles: the result of one inference and a premise of another.
To find a hidden premise, explain why the stated reason bears on its target. Look for the condition, comparison, generalization or value judgement that would license that particular move. Ask whether the supplied reason could hold while the conclusion fails; the resulting counterexample can reveal an omitted qualification. For “the hall is available, so use it”, a hall too small for the cast exposes a requirement that availability alone cannot answer. An unfamiliar subject inference needs its subject method, not a sentence invented merely to make the arrow look complete.
Retain the different grounds for an addition. A context-supported implicit premise belongs to the recovered interpretation, with the supporting context made clear. An unresolved candidate premise remains a question about what the speaker meant. A premise you independently investigate or introduce belongs to your repaired argument. One bracket style is optional; these distinctions are not. Do not add a premise equivalent to “these premises establish this conclusion” as an explanation of why they do.
Try the resulting account against the original passage. Can it explain the role of each relevant contribution and the conclusion’s stated strength? Does it attribute something the source could consistently deny? Does an apparently unused sentence support an intermediate claim, supply an objection, or merely explain the occasion? Revise the arrangement when these questions expose a better reading. Leaving a passage as background can be faithful; making every sentence support the final conclusion cannot be a goal.
B.5.RA:4.4a.4 - Make the selected structure inspectable
Use a short outline or argument map when the dependencies would otherwise be hard to inspect. Write a claim at each point where someone may need to accept, contest or reuse it. Connect an offered reason to its particular target and explain the inference. The link means support; it does not mean temporal succession, physical causation or part–whole membership. A causal claim can itself be a premise or conclusion.
Put jointly used premises in one reason group. To check the grouping, remove one premise in thought and ask whether the same offered inference still supplies a reason for that target. If its bridge is gone, keep the co-premises linked. If another complete reason remains, show that reason separately. Separate reasons need not each be sufficient for the contemplated use; several weak reasons may be cumulative, and their adequacy remains a subject judgement. Retain common sources or assumptions across groups so that repeating one report does not create independent evidence.
Use A.6.3.RT.OE when the expression obscures the recovered relations. Show an intermediate conclusion at both of its uses and keep an objection attached to the claim or inference it challenges. Preserve source attribution and consequential uncertainties in the outline. Read it back as ordinary reasoning and compare it with the text. If the map seems more certain, more comprehensive or easier to defend, find what was lost or added. A tidy layout cannot settle a competing interpretation.
The selected structure can now be used for criticism. An answer may require changing the structure itself: a supposed eyewitness report can turn out to be an inference from an observed clue, as in :5.5. Return to the interpretation and grouping when that happens, rather than merely adding a negative mark to the first scheme.
B.5.RA:4.4a.5 - Ask a consequential question and revise its target
Turn the scheme’s critical questions into questions about this case. For expert opinion, ask about relevant competence, the domain of the claim, the statement actually made, reliability, disagreement and the underlying evidence. Select questions whose answers could change this use, and add a question exposed by the circumstances even if it is absent from the standard list. Name what answer or evidence would resolve the concern. The question ‘Did the specialist assess this adapter?’ can lead to confirmation, a request for evidence, or a finding that the cited assessment concerns another setup. Those outcomes require different revisions.
To construct a question rather than repeat a catalogue, isolate a consideration carrying the inference and ask both what supports its application here and what could make that application fail. For Dana’s expertise, ask which experience supports this assessment and which part of the setup might fall outside that experience. Seek the relevant facts on both sides; do not invent adverse evidence to fill the second answer. Add a contextual consideration when its absence could change the conclusion, such as whether the tested configuration is still available. Explain how the answers affect support in this case; they are not votes.
Place an objection at its target:
| What the objection challenges | What to examine next |
|---|---|
| A premise | The ground for accepting that premise, and every reason group that needs it. |
| The transition from premises to conclusion | Whether the stated circumstances permit that inference, even if its premises are accepted. |
| The conclusion | The opposing argument and its grounds alongside the argument already offered. |
An objection also needs grounds. A question can expose an unsupported premise without establishing its negation. A reply that answers the question may restore that support; a reply that merely repeats the conclusion does not. When disagreement persists, locate whether it concerns evidence, an inference condition or the criterion for accepting the result. Use the relevant practice to settle that issue. Neither the number of questions answered nor the number of arrows is a rule for combining support.
Return the strongest conclusion the surviving grounds justify for the intended use, with an unresolved condition when necessary. Apply B.5.RR to a changed premise or inference condition and follow its affected dependents. Keep a sufficient alternative that survives. If no adequate route remains, obtain the missing ground, narrow the conclusion or leave it unresolved. A map and a familiar scheme organize this work; the subject reasoning still determines what follows.
When this is your own draft, use the exposed gaps to obtain grounds, alter the argument or narrow the conclusion before rewriting the prose. In a joint reading, compare the specific claims and links on which the participants differ; agreement on the drawing is neither agreement with the conclusion nor evidence that it is true. Ask each reader what in the text supports their interpretation, and revise the account or keep the difference explicit. Learning to do this reliably can require practice with feedback; a completed map or a worked example does not establish that capability.
B.5.RA:4.5 - Use the recovered reasoning and stop at a useful result
Perform the use named in :4.1. Apply the result under its conditions, explain the decisive step, identify a consequential criticism, or name what must be recovered before the use is possible.
Make the conclusion no stronger than the recovered reasoning supports. If recovering the argument reveals an open premise, state its effect on the intended use. When several sufficient arguments are available, an unresolved branch may be bypassed through a branch whose premises and reasoning are adequate.
If a premise or requested conclusion changes, use B.5.RR to follow the affected reasoning and derive what still follows. The recovered dependencies supply the starting point for that work. An unchanged, adequately supported part can be reused.
C.11.DUA governs whether more checking or information is worth obtaining for this decision. Understanding an argument, verifying its correctness and establishing its real-world premises can require different work. Select further work from the unresolved question. When the work is divided among agents, give the next contributor the premises at the missing transition, the result needed there and the intended use. On return, connect the supplied reasoning to the argument’s main reason. Use the explanation or working notation that makes the continuation possible.
B.5.RA:5 - Archetypal Grounding
B.5.RA:5.1 - Understanding why the sum of odd numbers is a square
Consider this compressed argument: “The sum of the first n positive odd numbers is n²: the sum and the square start at zero, and both increase by 2n+1 when n increases by one.” The statement concerns every nonnegative integer n. A reader recognizes the formula but needs to explain the steps compressed in that reason.
Write S(0)=0 and S(n+1)=S(n)+(2n+1). The main reason is that both the sum and the square start at zero and grow by the same amount when n increases by one. The algebraic identity (n+1)²−n²=2n+1 supplies that connection.
Recover the general transition. Assuming S(n)=n² for an arbitrary nonnegative integer n gives:
S(n+1)=S(n)+2n+1=n²+2n+1=(n+1)².
The temporary assumption is the induction hypothesis. It supports the successor step. Together with S(0)=0, that step establishes the statement for every nonnegative integer by induction.
For n=3, the sum is 1+3+5=9. Adding the next odd number, 7, gives 16. This instance makes the equal-increment operation visible. The argument’s reach comes from the arbitrary n, the base value and the induction rule.
A square drawing gives another way to follow the increment: grow an n-by-n square with a row of n cells and a column of n+1 cells. That adds 2n+1 cells. The drawing and algebra expose the same increment under the counting interpretation.
The reader can now explain the role of the initial value and successor step. If the next task instead asks for the sum of n odd terms beginning at 3, the changed range opens a revision: use the established sum through the (n+1)th odd number and remove the first term, giving S(n+1)−1=n²+2n. For four terms, 3+5+7+9=24. The reusable contribution is the recovered relation between range, initial value and increment.
If the original question asked only for 1+3+5, direct addition would already supply the result. Recovering the general argument earns its effort when explanation, general use or revision needs it.
B.5.RA:5.2 - Understanding a drawing-recovery argument
A team needs to open an archived engineering drawing for reuse. Someone argues that the drawing is recoverable because three backup copies exist.
Recover the method behind that conclusion. For the encrypted-backup route, the needed contributions are readable stored data, an available way to decrypt it and a decoder for the drawing format. Their joint use produces a readable drawing. Having more copies addresses loss of stored data, while all three may still share one decryption key.
Suppose the key is unavailable. The backup count leaves the decoding route incomplete. The next useful question is whether the key can be recovered or another usable copy obtained. The recovered argument identifies that missing prerequisite.
Now suppose a separate plaintext copy in a readable format is available. That gives a different route to the drawing and permits the team to continue without recovering the encryption key for this use. The original encrypted route remains conditional.
The result is a usable recovery choice or a focused request for a missing contribution. A later claim that the opened drawing describes the present equipment requires its own comparison; the file-opening argument answers the immediate recovery question.
B.5.RA:5.3 - A projection argument with two grounds and one shared condition
A seminar organizer receives the message: ‘The slides should display correctly. Dana says the projector is compatible, and yesterday’s rehearsal worked.’ The organizer needs to decide whether another display test is needed before using projector P with laptop L and adapter D. The relevant technical claim C is: the current PDF can be displayed at 1080p by this setup. It says nothing yet about sound, remote attendance or uninterrupted operation for an entire seminar.
Construct the offered argument. Ask what ‘compatible’ and ‘worked’ mean here. Suppose Dana maintains these projectors, has relevant technical expertise, and explicitly confirms her claim: ‘The current PDF can be displayed at 1080p using P, L and D at the current settings.’ Separately, the organizer personally inspected all pages of the current PDF during the rehearsal and found them displayed correctly at 1080p. Recover the condition S: the equipment, PDF and settings relevant to this result have not changed.
The expertise and the assertion work together in the first reason. Neither ‘Dana is an expert’ alone nor an unattributed compatibility sentence supplies that reason. The rehearsal is a different ground: it is an observed instance under the required setup. Its use for another showing depends on S and on the ordinary technical judgement that the successful test remains applicable. It is not a deductive guarantee of future operation.
The following outline is an argument map. Braces group premises used together; arrows mean support for C, not physical causation or event order.
R1: {Dana has relevant expertise; Dana asserts C for P/L/D; S}
--expert-opinion inference--> C
R2: {the organizer observed the current PDF displayed correctly on P/L/D; S}
--applicable rehearsal result--> C
R1 and R2 are separate grounds, but they share S. R2 is not merely another report of Dana’s judgement. There is no numeric independence or probability claim.
Question the ground. A colleague asks, ‘Did Dana assess this adapter, or just the projector’s ordinary input?’ Dana replies that her message was shorthand: she knows P and L but had assumed that D was compatible. This answer removes the claimed coverage of her assessment. Mark the objection at R1’s asserted scope and its use for C. The resulting conclusion is not ‘the slides cannot display’. R2 still supplies the observed result for P/L/D. If that rehearsal is an adequate technical basis for this modest use and S holds, the organizer can use C on R2 alone. The map records why losing one reason need not lose the conclusion.
Revise after a common condition changes. Before the seminar, D is replaced by D2. B.5.RR now follows the changed configuration through both uses of S. The rehearsal remains evidence about D, and Dana’s statement supplies no assessment of D2. C for the new setup is unresolved. Testing the new setup, restoring D, or obtaining an applicable technical account can close that gap. Repeating the old positive reports cannot.
Suppose a test with D2 then shows that the current PDF is not displayed under the intended settings, after the operator checks the connections and follows the equipment’s setup instructions. This is a new opposing observation for that tested setup. The organizer can report that the attempted display failed and return to technical diagnosis; the observation alone does not identify which component caused the failure.
Separate the technical result from the practical proposal. ‘Therefore use P’ introduces another inference. It needs the seminar’s display requirement, an available way to keep the tested setup, and comparison with relevant alternatives and costs. If using P prevents another booked session from running, that consequence can defeat the proposal while C remains supported. PSD.8/.9/.11 supply the option, value and consequence work. The receiving decision uses the qualified technical result instead of silently expanding it into a recommendation.
The useful return is a conclusion with its surviving reason and its next change condition: use the rehearsal for the unchanged setup; reopen compatibility after replacing the adapter; treat the later failed display as a result to diagnose. Another person can challenge a specific connection and see what needs to be redone.
B.5.RA:5.4 - From an ambiguous message to a conditional venue argument
An amateur theatre group is choosing a room for a complete three-hour rehearsal on Friday evening. It receives this message:
Use the school hall on Friday. If it is free, we can rehearse there together. Noor says it is; she manages the bookings. We missed last week because the band had the hall. Paying for the studio would be a waste.
Begin with possible readings. “Free” could mean unbooked or without a hire charge. “It is” could refer to either meaning, and “we can rehearse” might concern some rehearsal rather than the complete three-hour session. The opening recommends a venue; it does not itself justify that choice. The conditional in the second sentence supplies a proposed relation between availability and rehearsal feasibility. It does not establish availability.
A first sketch that puts “the hall is free” and “we can rehearse” into two boxes as asserted facts has strengthened the text. A sketch that puts every remaining sentence directly under “use the hall” hides how the recommendation is supposed to follow. Two more faithful readings remain: the message could argue from available space or from avoiding a hire charge. The booking role makes the first reading plausible, but does not prove which meaning the speaker intended.
Ask the organizer what was meant. Suppose the reply is: “I meant unbooked for our Friday rehearsal. Noor told me there was a free slot. I was explaining last week’s cancellation, which we all already know about.” This supports the availability reading and identifies the “because” sentence as an explanation of the accepted cancellation. Keep that explanation as context; it supplies no evidence that the hall is available this Friday. The reply still does not establish the slot’s duration or the relative cost.
Extract the claims without filling the gaps. The organizer’s proposed conditional is now: if the school hall is available for the required Friday session, the group can complete that rehearsal there. Noor is reported to have said there is a free slot. Managing the bookings gives a reason to treat her as able to know the booking entries, not as an expert on every condition of a rehearsal. Recovering her statement’s actual scope is necessary before using it for the three-hour claim.
The sentence about waste suggests a practical choice: avoid paying for an alternative when an adequate option already exists and the payment buys no relevant advantage. It does not mention past investment or abandoning an earlier undertaking. A sunk-costs scheme therefore adds the wrong premise. The useful question is which present and future differences make the studio expense unnecessary.
A provisional structure makes the missing intermediate result and grounds visible. Braces below group co-premises. “Reported” retains attribution; “proposed implicit” identifies a reading supported by the waste remark but not yet confirmed. Arrows mean the indicated support.
{Noor manages the bookings; Noor is reported to say a slot is free}
--ordinary knowledgeable-source inference-->
A: a Friday slot is available (its hours remain unconfirmed)
{A with the hours required by the group;
the organizer's conditional about completing the rehearsal}
--conditional application-->
F: the group can complete the required rehearsal in the hall
{F;
D: using the hall has lower relevant burden and the studio adds
no compensating benefit [needed comparison, not supplied];
V: choose the adequate option without that unnecessary burden
[proposed implicit choice rationale]}
--practical inference--> C: use the hall for this rehearsal
A is not yet the premise about the required hours, and F is not simply another independent reason alongside Noor’s report. F depends on the availability claim and the organizer’s conditional. D is an exposed need for evidence, not a fact extracted from “waste”. The practical argument remains conditional on it and on the other requirements in F. The map therefore recovers both the plausible offered reasoning and what it has not supplied.
Use the structure to ask the next question. The availability claim affects every later step, so ask Noor for the actual interval before making a booking. She replies: “The hall is unbooked from 18:00 to 20:00; another group has it after that.” The actors need 18:00 to 21:00 for the complete run. Preserve Noor’s narrower claim; do not revise it into a false claim that the hall is occupied all evening. Replace A’s uncertain scope with the two-hour interval. That interval does not supply the required three-hour premise, so the route to F and C fails for the intended session. It is unnecessary to settle the cost comparison to reach this result.
B.5.RR follows that affected route while retaining the usable booking information and last week’s explanation. A shorter rehearsal, a different time or the studio can become alternatives, but each changes a condition or opens another argument. The source has not justified any of them merely by losing its first recommendation. If the group changes the task to a two-hour scene rehearsal, reassess the conditional’s remaining requirements and the practical comparison for that new use.
Separate reconstruction from a repair. Suppose the reader now checks room capacity, access for every actor and both venues’ charges. Those findings may help construct a better choice argument. They are new grounds obtained by the reader. They do not make the original message complete or turn its ambiguous “free” into a statement about price.
B.5.RA:5.5 - An expert’s title cannot turn a clue into an observation
A workshop colleague writes: “The parcel has arrived. Noah, our electronics expert, says so: the goods trolley is back by the door.” The recipient wants to tell an assembler that the replacement parts are ready to collect.
Trying expert opinion first exposes a mismatch: electronics expertise does not establish knowledge of this delivery. Ordinary access could matter instead. A person who checked the parcel could report its arrival without being an expert. Before replacing the first scheme with knowledgeable testimony, recover what Noah actually knows.
Ask, “Did Noah receive or see this parcel, or infer its arrival from the trolley?” Suppose Noah replies, “I saw the trolley. I haven’t looked for the parcel; deliveries usually bring it back.” Now the distinction changes the structure:
{Noah saw the trolley by the door; his report is usable for that observation}
--ordinary observation report--> T: the trolley is by the door
{T; a proposed connection between this trolley's return and this parcel}
--inference from a clue--> P: this parcel has arrived
Noah’s claim about the trolley can remain credible while his conclusion about the parcel is unsupported. The observation and inferred arrival were compressed into one attributed statement. The repair separates them and locates the missing connection. It does not establish that Noah was dishonest, that the parcel is absent, or that a witness’s every claim needs specialist credentials.
Ask what other work moves the trolley and whether this delivery was due to use it. Suppose the workshop uses the same trolley for outgoing parcels, and today’s dispatch account explains its current position. That removes the offered clue’s claimed discrimination for this arrival. The recipient can check the receiving record or inspect the parcel location. Either would be a new ground; repeating Noah’s title supplies none.
This differs from a disagreement over the trustworthiness of a witness who actually saw the parcel. In that case the disputed ground would be the report. Here the observation is accepted and the disputed transition is from trolley position to this parcel’s arrival. The first scheme has been abandoned for a substantive reason, the map has changed, and the next inquiry follows the remaining gap.
B.5.RA:6 - Bias-Annotation
A familiar scheme label can make a reader force the text into its expected premises. A fluent paraphrase can quietly turn a condition into a fact or a tentative report into certainty. Return the proposed structure to the source and the question being answered, especially when the map looks stronger than the passage.
Familiar vocabulary and a correct-looking calculation can create confidence before the reasoning has been recovered. Conversely, checking every line can consume attention while leaving the role of a lemma unexplained. Use the local transition and the main reason together.
AI-generated formal proofs make the distinction consequential: a checked formal derivation supplies a result under its formal definitions, while the intended statement and the explanatory structure needed for reuse may still need recovery. The relevant comparison is the one that can change the contemplated use.
B.5.RA:7 - Conformance Checklist
For the argument and use being recovered:
- The intended use and the conclusion’s domain and conditions are recoverable.
- The explanation states the main reason for the result and connects it to the decisive steps.
- The needed transitions identify their premises, inference or operation and result.
- Joint premises, sufficient alternatives, shared assumptions and temporary assumptions retain their different roles.
- The reader can perform the intended use or identify the missing transition or premise that prevents it.
- A small instance supports the explanation at its stated scope; a general conclusion has its corresponding reasoning.
- Further checking is selected for an unresolved question, and adequately supported parts remain reusable.
For an argument using :4.4a, also inspect whether the claims preserve the source’s scope, conditions and attribution; a consequential competing reading has been resolved or retained; and the selected scheme fits the offered reasoning. Intermediate conclusions and joint reasons must expose the actual dependency. Reconstructed premises and conclusions remain distinguishable from supplied ones and from the reader’s new grounds. Each consequential objection has a target and grounds. A changed condition should revise the affected support without automatically asserting the opposite conclusion.
These are questions about the recovered reasoning. Their answers may already be evident in the working explanation or application.
B.5.RA:8 - Common Anti-Patterns and How to Avoid Them
| Failure in the working situation | Repair |
|---|---|
| Choosing a scheme from a keyword or title and supplying its absent premises | Match the actual claims; recover contextual evidence for an implicit premise or revise the scheme. |
| Splitting a conditional into two asserted facts | Keep the conditional relation intact and obtain a separate ground for its antecedent before using it. |
| Making a charitable repair indistinguishable from the source’s argument | State which additions have contextual support and which are your new grounds or proposed revision. |
| Paraphrasing successive claims while the inference remains missing | Apply the relevant definition, rule or earlier result to the transition’s actual premises. |
| Checking local steps while failing to explain why a lemma or construction appears | Recover the difficulty that contribution resolves and connect it to the conclusion. |
| Treating several uses of one premise as several independent grounds | Keep the common prerequisite visible and examine its role in the needed branches. |
| Promoting a temporary assumption to an established premise | Recover the subargument and the conclusion obtained when that assumption is discharged. |
| Using one example to claim that the general statement has been proved | Recover the argument that covers the stated domain; retain the example as an illustration of it. |
| Demanding a complete reproof when the task only needs an established result under its stated conditions | Use that result at the needed level; open its internals when the new question requires them. |
B.5.RA:9 - Consequences
A recovered argument can support application, explanation, criticism and later revision. Work can be divided around meaningful intermediate results, and a request for help can name the transition that remains obscure.
The method can reveal that the source’s conclusion exceeds its support or that the reader lacks a prerequisite. It cannot supply every missing subject method. Its economical stopping points are a sufficient argument for the use, a useful conditional conclusion or a localized gap.
B.5.RA:10 - Architectural Rationale
A source orders its text for exposition; the argument relates premises, intermediate contributions and conclusions. Understanding therefore needs more than following the paragraph order. Backward dependency recovery identifies what the desired conclusion uses, while recovery of the main reason explains why those contributions were chosen.
Local and overall understanding constrain each other. In :5.1, the equal-increment idea explains the role of the recurrence, and the induction step establishes the general result. In :5.2, the recovery route explains why the key and format matter, and their availability determines which route can be used. A fluent summary that cannot support these transitions is insufficient for the intended use.
For ordinary prose, interpretation and evaluation constrain each other without becoming the same judgement. Context can justify reading a statement as a recommendation while its grounds remain inadequate. A later answer can expose a mistaken structure rather than a false premise within the original structure. Claim extraction, comparison of readings and scheme testing make that return possible. Going straight to a familiar scheme saves effort only when the offered inference is already clear; strengthening the source to fit it loses the argument being recovered.
This common method concerns recovery of reasoning already offered for a result. B.5 coordinates the broader inquiry; B.5.RC recovers an auxiliary construction; a subject method supplies an unfamiliar inference. To explain the result to someone else, select the reasoning and representation that make their intended use possible. C.2.8 helps characterize what that recipient can extract under stated preparation and access.
Recovery also makes revision possible. The changed premise can be followed through the contributions that use it, while independent arguments remain available. Revision has its own task and result; recovering the original argument supplies the dependency information it needs.
B.5.RA:11 - SoTA-Echoing
Local and overall proof comprehension. Mejía-Ramos and colleagues distinguish understanding terms, logical status and justifications from understanding a proof’s main idea, components, transfer and examples. Their 2017 account of developing and validating proof-comprehension tests, §2.2, develops the earlier 2012 model and makes the dimensions operational for particular undergraduate proofs. This pattern adopts the combination of local transitions and overall method in :4.2–:4.4. The published assessment results concern those proof-reading settings, while the generic recovery procedure here is a synthesis.
Self-explanation. Hodds, Alcock and Inglis’s work is accompanied by the Loughborough guide for mathematics lecturers. It explains why relating claims to prior knowledge and to other claims differs from confidence reports or paraphrase. This contribution informs :4.4. The evidence reported there concerns undergraduate mathematical proof comprehension; it does not establish the effectiveness of this whole method for every practice or AI agent.
Later assessment work. The PRIUM framework, Cooley and colleagues (2024), develops proof-comprehension assessment through questions about definitions, statements and their relationships, with revision informed by discrepancies between intended questions and student answers. That is an assessment contribution to consider when demonstrated comprehension is required. The present method supplies the recovery work; it does not require a departmental assessment programme for an ordinary use.
AI-assisted reasoning. Klowden and Tao’s Mathematical Methods and Human Thought in the Age of AI, especially §4.4, distinguishes a verified formal statement from the intended statement and from the explanatory reasoning around a proof. This pattern adopts the intended-use comparison and the recovery of the method behind the result. The essay provides a contemporary conceptual argument, rather than an experiment validating this procedure.
Recoverable methods beyond answer production. The Math and AI declaration raises the risk that rapid answer production can outpace understanding and development of methods. It is a position statement. This pattern takes the resulting recovery question: which reasoning can the next practitioner actually use? Human or AI production does not settle that question; the returned argument and its use do.
Schemes and argument construction. Walton’s Argumentation Schemes & Their Application in Argument Mining, §§1–4 is a historical methodological source, republished from 2011. It separates scheme recognition from matching keywords, distinguishes ordinary access to knowledge from expertise, and rejects a sunk-costs reading where the required prior investment is absent. These distinctions guide :4.4a.2 and the different failures in :5.4–:5.5. The chapter’s recognition method does not establish automated extraction accuracy or a complete scheme repertoire here.
From prose to a revisable map. Davies, Barnett and van Gelder’s Using Computer-aided Argument Mapping to Teach Reasoning (2021), §§2–15 develops claim clarification, context-sensitive reconstruction, intermediate conclusions, hidden grounds and linked premises in §§3–15. Section 2, especially p. 119, also describes maps as support for writing and joint discussion; these are applications of mapping. Adapt that construction in :4.4a and :5.4–:5.5 while retaining source attribution and unresolved alternatives. Treat their term-matching and layout rules as search aids, not universal inference laws. Their conclusion leaves inference objections and fuller evidence integration undeveloped; those questions return here to the particular inference and its grounds. The teaching sequence remains a separate contribution to capability development. The present synthesis is a practitioner method account, not evidence that reading it produces unassisted competence. Limits of a question catalogue. Hernández’s Disentangling Critical Questions from Argument Schemes (2023), §§2–5, contests the idea that scheme questions supply a complete evaluation. Adapt its attention to the concrete question–answer exchange and the counterargument it can produce. The article proposes, but does not solve, a comparison of argument strength. The present synthesis keeps schemes useful for recovery while requiring contextual grounds for an evaluative conclusion; it adopts no score based on counting failed questions.
Bounded method choice. Compare line-by-line paraphrase, full proof validation and use-directed recovery on the same short argument. Paraphrase can retain the odd-sum formula while missing the equal-increment reason. Full validation answers correctness, but may spend effort inside already usable lemmas. Recovering the main reason together with the needed transitions gives the explanation or changed-use basis sought here. Select it when that is the unresolved task; retain full validation when correctness of the complete argument is the required conclusion. The drawing-recovery case extends the dependency method to a practical inference without treating mathematical proof as the sole form of reasoning. Reconsider this recovery approach if prepared readers repeatedly cannot recover why the decisive inference works, while another explanation or reading method enables the same use with comparable effort.
Baumtrog’s Designing Critical Questions for Argumentation Schemes (2021) contributes paired inquiry into support and possible failure. This pattern adopts that practical move without requiring his complete scheme design or claiming empirical learning benefits.
B.5.RA:12 - Relations
- B.5: coordinates inquiry and the revision that can follow recovery of an argument.
- B.5.RC: obtains an auxiliary construction that a decisive transition requires.
- B.5.MPC: connects arguments and constructions across physical, mathematical and computational contributions.
- B.3 and B.3.3: govern confidence and assurance questions when the intended reliance requires them.
- C.11.DUA: selects additional checking and information for the decision at hand.
- C.2.8 and C.37: characterize recipient-accessible structure and support selection of representations.
B.5.RA:End
B.5.RR - Revise Reasoning After a Premise or Question Changes
Type: Method pattern Status: Stable Normativity: Normative unless marked informative
B.5.RR:1 - Problem frame
Use this pattern when reasoning that you could previously use needs to answer a changed question, or when a premise, observation or application condition changes. You need to know what still follows, what must be worked again and what can now be done.
The object of revision is the reasoning used for that question: its premises, intermediate contributions, conclusion and conditions of application. The relevant practice supplies its inference rules and the grounds for using its premises.
First useful move: state the change beside the result you now need. Find where the earlier reasoning used the changed condition, or where the new result requires a contribution the earlier argument did not supply.
This work requires enough subject knowledge to follow the argument. Use B.5.RA when that reasoning must first be recovered. If the established result already answers the new question under conditions that still hold, apply it and stop. Rebuilding the entire argument is useful when recovery would cost more, or when a separate obligation requires a full new derivation.
B.5.RR:2 - Problem
A familiar answer often survives in a formula, report or program after the reason for using it has changed. Repeating the earlier steps can produce a convincing answer to the former question. Discarding everything can waste constructions and arguments that remain useful.
Revision requires following the reason for a result. One conclusion may need several premises together; another may have two sufficient arguments. A premise may be shared by apparently different arguments. A change can also make a formerly fixed quantity the unknown, so replacing a number leaves the real task undone.
The result is reasoning that answers the changed question at its supported scope, or a useful partial result and the contribution still needed. It should let the receiver act, obtain that contribution or pursue the newly exposed question.
B.5.RR:3 - Forces
| Force | Tension |
|---|---|
| Reuse and hidden dependence | Retaining an established result saves work, but its application may use the changed premise indirectly. |
| Local repair and a changed question | A small correction can preserve the conclusion; a new objective may require another argument. |
| Several arguments and a shared weakness | An alternative can preserve a conclusion, while a premise common to both can defeat that apparent independence. |
| Useful qualification and continued inquiry | A conditional result or bound may suffice now; another use may need the unresolved premise or a new construction. |
B.5.RR:4 - Solution
Start with the receiving question, follow the affected reasoning and derive the result that can now be used. A useful reminder is:
Changed question or condition → affected reasoning → retained or replacement contribution → revised conclusion → receiving use.
B.5.RR:4.1 - Say what changed and what is needed now
Compare the earlier question with the present one. State the result needed and the changed condition in terms that can be used in the reasoning. For a calculation, that may be a new range or an input that is now an unknown. For an empirical conclusion, it may be an observation, a changed population or an operating condition.
Distinguish a change in the situation from a correction to your account of it. A measurement taken yesterday can remain a sound report of yesterday while being insufficient for today’s operation. A proposed condition can be explored hypothetically without replacing the account of what has happened.
Keep the meanings of the quantities and claims visible. If the same term now denotes a different quantity, translate the question before substituting its value. If only the spelling or presentation changed and the established application still fits, no reasoning revision is needed.
B.5.RR:4.2 - Recover the dependence that matters
Begin at the changed premise and at the desired conclusion. Find which intermediate claims or constructions connect them. At each relevant transition, ask what is needed together, what is produced and why that transition is allowed.
Keep a sufficient alternative separately. For example, recovering a file may require either a readable local copy or an available remote copy. If both are encrypted with one unavailable key, the two storage locations leave the same prerequisite unresolved.
Use an established lemma at the level its receiving use needs. Open its proof when the change reaches a condition of the lemma or the way its result is obtained. Do the same for an established measurement or computation: inspect the part whose application the change calls into question.
A sketch or a few statements can hold these dependencies. Use B.1.1 when a dependency representation needs its relation clarified. A reasoning dependency says which premise or operation supports a conclusion; physical causation and temporal order require their own relations.
If the needed dependence is missing from the account, recover it through B.5.RA or ask for that contribution. Treat a supposedly unaffected part as reusable only when its independence from the change is adequately understood for this use.
B.5.RR:4.3 - Derive what follows after the change
Work from available premises through the affected transitions. Reuse a contribution whose conditions and required result still fit. Where they do not, derive the replacement, select an adequate alternative or identify the unresolved step.
Withdrawing a premise removes that premise as a basis for asserting the conclusion. Another sufficient argument may still support it. To assert the opposite conclusion, obtain a reason for that assertion. The conditional argument can remain available for situations in which its premises hold.
Follow the change through each needed use of a shared prerequisite. Keep the premises of an alternative argument together: pieces from two incompatible situations do not form a supported argument for either situation. If conclusions refer back to one another, recover the grounding of that reasoning, such as an initial case and induction step. Mutual repetition alone cannot replace the starting support.
A changed requested result can require working backward as well. Identify what the new conclusion would need, reuse the earlier contributions that supply it, and produce the remaining contribution. Release a former fixed value when the question now asks you to determine it.
Compare the work of recovering and repairing the affected reasoning with the work of obtaining a fresh sufficient answer. A short new calculation can be cheaper and clearer. A maintained dependency account is useful when repeated revisions repay its cost; it is optional for an ordinary one-off question.
B.5.RR:4.4 - Choose the result the present reasoning supports
Relate the revised conclusion to the result requested in §4.1. It may supply the requested answer, a conditional answer, a bound or an obstruction. Say what the receiver can do with that result.
For a mathematical argument, carry the domain and assumptions into its conclusion. For an empirical application, examine the changed observation or applicability premise using the relevant subject method. Recomputing a model can establish its new consequence while leaving its correspondence with the physical situation unresolved.
If the original target is unattainable under the retained conditions, use the obstruction to propose a changed condition or a different question. Keep that proposal visible as a choice. A weaker result can be useful without silently replacing the requested result.
Obtain further evidence or checking when its possible outcomes can change this use. C.11.DUA helps compare that contribution with its cost. The method can finish with an explicitly conditional result when conditional use is sufficient.
B.5.RR:4.5 - Apply the result and carry the change to its users
Perform the receiving use, or give its next contributor the revised conclusion and the condition that governs it. When others rely on the earlier result, tell the affected users what changed and which application must change with it. Their unchanged uses need no new argument merely because a nearby result was revised.
Check the changed transition by the method appropriate to its claim. A small instance can reveal a substitution error; a proof establishes its stated general conclusion; an observation can test a physical consequence. Choose the check for the result actually being relied on.
Stop when the receiving question is answered at the required level, or when the remaining contribution has been located well enough to obtain it. A useful new question can begin another inquiry under B.5.
B.5.RR:5 - Archetypal Grounding
B.5.RR:5.1 - Changing the range of a sum
A reader has established S(n)=n² for the sum of the first n positive odd integers, with S(0)=0 and n a nonnegative integer. The argument uses the shared initial value and increment: S(n+1)−S(n)=2n+1, also the increment from n² to (n+1)².
The new question asks for n terms beginning at 3: 3+5+…+(2n+1). The change is the range of summation. Reuse the established result on the first n+1 terms and remove the initial 1:
T(n)=S(n+1)−1=(n+1)²−1=n²+2n.
For n=4, the new sum is 3+5+7+9=24. The old formula applied unchanged would return 16. The proof of S survives; the application of that proof changes.
This repair also exposes a reusable construction. For n terms starting at a and increasing by 2, term j, counted from j=0, is (2j+1)+(a−1). Summing the established odd-number terms and the n equal additions gives n²+n(a−1). Changing the increment would require another derivation. The worked extension makes the next question precise without assuming that the same correction covers every progression.
For the next use, retain four terms and the increment 2, but require their sum to be 28. The former starting value a=3 becomes the unknown: 16+4(a−1)=28 gives a=4. Checking 4+6+8+10=28 confirms the required sum. If there are zero terms and the required sum is positive, no starting value can supply it: the empty sum is zero for every a. The changed question then requires a different term count or total.
B.5.RR:5.2 - Losing one way to recover a report
A team needs to read revision 17 of a report. Its established account has two ways to obtain that revision’s bytes: decrypt the local backup using its available key and decryptor, or obtain an unencrypted remote copy. An available viewer then displays the report.
The key becomes unavailable. Following that change removes the local decryption route. The remote copy and viewer still supply the requested reading, so the team can proceed through them. The missing key need not be recovered for this use.
Now consider a different finding: the supposed remote alternative is encrypted with the same key. Both routes need that key, so neither supplied route obtains the bytes. The next contribution is the key, another usable copy or a different way to obtain the report. A second storage location had concealed a shared prerequisite.
If instead the viewer becomes unavailable, either route may still provide the bytes. Reading now needs a suitable viewer or format conversion. This repair preserves the obtained result and locates the different operation that the receiving use requires.
B.5.RR:5.3 - A repeated conclusion loses its starting support
An analysis establishes claim A from an observation O, derives B from A and uses B in a further argument for A. A corrected interpretation of O removes its support for A.
The second occurrence of A does not preserve that support: its offered reason B was itself obtained from A. Reopen both uses and look for an argument grounded in retained premises. The conclusion may be true, but this circular route no longer establishes it.
Contrast this with an induction argument whose base case remains established and whose step derives the next case from the preceding one. Its recurrence has a grounded way to obtain each finite case. The relevant inference, rather than the visual presence of a cycle or repeated letter, decides what can be retained.
B.5.RR:6 - Bias-Annotation
The examples favor explicit premises and recoverable derivations. In statistical or interpretive work, revising one observation can require reconsidering dependence, selection or meaning before the changed conclusion can be obtained. Use the practice’s inference method; a list of supporting statements does not supply it.
The method can also overvalue salvage. When the earlier reasoning is poorly recoverable and an adequate new answer is cheap, obtain the new answer.
B.5.RR:7 - Conformance Checklist
- The present question and the consequential change are stated.
- The reasoning used by the receiving conclusion is recoverable at the needed depth.
- Joint prerequisites, shared premises and sufficient alternatives are preserved.
- Affected transitions are reworked under their applicable inference or construction rules.
- The revised conclusion retains its domain, conditions and any unresolved premise.
- The receiver can identify the next action, useful stop or contribution still required.
B.5.RR:8 - Common Anti-Patterns and How to Avoid Them
| Observed failure in revision | Why it matters | Repair |
|---|---|---|
| Replace a number while retaining the old question | The calculation still solves for the former unknown. | Restate the givens and requested result before choosing the computation. |
| Treat the loss of one argument as a refutation | A different sufficient argument may remain. | Examine its premises and derive the conclusion or its negation separately. |
| Count two dependent arguments as independent | Both can fail with their shared prerequisite. | Follow the common premise through both uses. |
| Preserve a conclusion through circular repetition | The retained statements supply no starting support. | Recover a grounded argument or leave the conclusion unresolved. |
| Repair the whole report to answer a small change | Unaffected results are needlessly reproduced. | Compare affected repair with a fresh sufficient answer and choose the useful scope. |
B.5.RR:9 - Consequences
The practitioner can change an application while retaining useful reasoning, or explain why a larger change is required. A failure can expose a missing condition, a different construction or a worthwhile next question.
Recovery costs attention and sometimes specialist help. Its value increases when the same reasoning must be adapted repeatedly or divided among contributors. A short independent solution may remain the better choice for one small question.
B.5.RR:10 - Architectural Rationale
An argument and an application can change separately. A theorem can remain established while its former substitution ceases to answer the question. An empirical premise can become doubtful while its conditional consequences remain worth investigating. Keeping those distinctions lets revision preserve knowledge without preserving an unsupported use.
The method therefore joins backward recovery of what the desired result needs with forward derivation from the premises now available. Alternative arguments preserve useful results; shared prerequisites explain where that preservation fails. Detailed deduction, statistical inference and physical-model revision remain contributions of their respective practices.
This is a method of obtaining and applying knowledge. Its result can also change the method repertoire: the revised sum reveals a parameterized construction, and an unresolved dependency can become the next research question. Those continuations are useful when they enable further work.
B.5.RR:11 - SoTA-Echoing
Which part of an argument needs revision? Adapt the assumption-sensitive reasoning of de Kleer’s A General Labeling Algorithm for Assumption-Based Truth Maintenance (1988), §2. Compared with discarding every conclusion that used a removed premise, §4.3 retains sufficient alternatives and their shared conditions. This historical computational method supplies a precise model of conditional support. The present method uses that insight without requiring an ATMS or exhaustive assumption labels for an ordinary inquiry.
When is incremental repair cheaper than starting again? Adapt the comparison in Hu, Motik and Horrocks, Optimised Maintenance of Datalog Materialisations (2018), §§1–4: eagerly finding alternative derivations can avoid unnecessary deletion, but that search can itself be costly; recursive support needs more than simple counting. Section 4.3 therefore compares recovery and repair with a fresh answer. These are results for Datalog maintenance; selecting subject premises and interpreting empirical change require further reasoning.
What should repair preserve for its receiver? Adapt Klowden and Tao’s Mathematical methods and human thought in the age of AI (2026), §§4.4–4.6. An inspectable proof result can serve one use, while changing its assumptions or applying its idea needs recoverable reasoning. Sections 4.1–4.5 retain that receiving question. The trade-off is explanation and recovery effort when another use actually needs them; full exposition is unnecessary for an already adequate application.
What does current automated proof repair contribute? Wang et al., Learning to Repair Lean Proofs from Compiler Feedback (2026), §§3–5, studies repair from generated failures and compiler feedback. Adapt its use of a localized failing transition when such feedback is available. Its single-shot formal-repair result answers a narrower question than choosing changed premises or interpreting an application. Section 4.4 preserves those questions instead of using compiler success as their answer.
Reopen these choices when better dependency recovery, subject inference or repair support changes the attainable result or the cost of obtaining it.
B.5.RR:12 - Relations
- B.5 coordinates inquiry and the next useful question. B.5.RA recovers the argument; B.5.RC recovers a needed construction.
- B.1.1 clarifies the represented dependency relation. A.6.3.RT helps when the expression prevents the revision operation.
- B.5.MPC connects physical, mathematical and computational contributions. B.5.MPC.R uses this reasoning revision to repair a failed connection.
- B.3, B.3.3 and A.10 supply the claim-specific assurance and evidence conditions. C.11.DUA helps choose worthwhile additional checking or information.
- C.39 develops a missing way of obtaining a result. Revision may supply the construction from which that work begins.
B.5.RR:End
B.5.FM - Construct a First Model for the Working Question
Type: Method pattern Status: Stable Normativity: Normative unless marked informative
B.5.FM:1 - Problem frame
Use this pattern when you need to reason about a situation or formal problem but do not yet have an account on which to perform the needed inference. You may know relevant laws, facts or techniques while still being unable to choose the participants, distinctions and relations that make them useful here.
Begin with what the answer should help you understand or do, the observations or formal rules already available, and enough subject knowledge to propose a relation. Construct a provisional model, obtain a consequence and use it to answer the question or locate the next missing contribution. A sketch and a limiting argument may provide that first result.
“First” means the first usable model for this question. An earlier model, an analogy or a specialist’s explanation can supply its starting material. Use an adequate existing model directly when construction is unnecessary. If an available concept is understood but its correspondence to the situation is missing, B.5.4 supplies that interpretation work. If the required inference needs subject knowledge you cannot recover, obtain that contribution.
B.5.FM:2 - Problem
A request to “model the system” leaves important work unstated. Which things may change separately? Which interactions matter? What may be treated as fixed? What operation on the proposed description could answer the question?
An early description can hide the decisive relation. A device described by one temperature conceals a heat-transfer restriction inside it. A draining vessel described only by liquid height conceals the effect of trapped air. Counting all possible binary strings ignores a rule that forbids some continuations.
A model becomes useful when its selected distinctions and relations permit an inference whose meaning can be returned to the working question. Constructing that possibility is part of the reasoning.
B.5.FM:3 - Forces
| Force | Consequence for construction |
|---|---|
| A question selects what matters; a model can reveal that the question needs changing. | Keep the receiving use visible while allowing the construction to expose a better question. |
| Familiar concepts provide useful relations; the situation may need a new combination. | Reuse what works and explain the connections introduced between contributions. |
| A detailed description can be expensive to build and difficult to reason with. | Add a distinction because its omission changes a needed consequence. |
| A cheap consequence can guide action before the model is fully developed. | State what supports that consequence and which unresolved choices matter to its use. |
| Different representations expose different operations. | Choose or change the expression while constructing the inference. |
B.5.FM:4 - Solution
Construct a model by selecting distinctions, proposing their relations and making those relations usable in an inference. Work can move back and forth between these contributions. Keep the question and the consequence connected as the model changes.
B.5.FM:4.1 - Recover the contrast the answer must resolve
State what alternatives the answer should distinguish: whether an intervention can reach a target, which arrangement could explain an observation, how many constructions meet a rule, or what condition prevents a result.
Inspect a small instance or the available arrangement. Describe the supplied facts separately from the account you propose. Ask what changes between the cases that matter. The first question can be provisional; preserve a new question when the attempted construction reveals a more useful distinction.
If the participant cannot yet express what differs or matters, B.5.EA helps articulate that contribution before model construction. Return here when the resulting distinction permits a question or contrast; do not require this preliminary work when the contrast is already usable.
When the current account is clear but leaves you unsure which question matters, the scheme comparison in :4.2.1 can expose a useful distinction. A discovered question may already have an adequate answer; use it without requiring a larger model.
An existing answer may already resolve the contrast. Use it under its conditions. C.11.DUA helps when obtaining more information or refining a model competes with acting on a sufficient answer.
B.5.FM:4.2 - Choose the participants and distinctions
Follow what can be transformed, exchanged, combined, constrained or observed. Propose the objects and relations needed to describe those changes. For a physical situation, an interaction may cross the first proposed boundary: air surrounding a vessel or a path through its casing can matter to the answer.
Try a consequential variation. If two situations receive the same description but permit different answers, recover the distinction that separates them. An object can need several quantities; several objects can sometimes be represented together. Choose the coarsening from the inference it must preserve.
For a question about permitted continuations, A.3.3 helps construct a sufficient state description. For an observation, C.16 helps connect the quantity of interest to what the observation reports.
B.5.FM:4.2.1 - Let a conceptual scheme expose a useful question
Start from what the current account is meant to enable, even when the question is provisional: prepare a workshop, interpret an effect or improve a construction. Choose a small, understood conceptual scheme whose relations could reveal a consequential distinction. Here a scheme means related concepts and the inferences their relations permit. For example, connecting a learner’s attempt, what an instructor can observe and the feedback required can expose a question that a seating plan leaves unanswered.
State the possible contribution before expanding the account. Recover the selected relation’s participants, conditions and a consequence; B.5.TU helps if that theoretical contribution is unfamiliar. Use B.5.4 to construct its tentative correspondence to the case. Keep what the source account says distinguishable from what the scheme suggests adding. A sketch or ordinary question can carry the correspondence.
When a relation appears absent, distinguish the following outcomes:
| What is available | Useful continuation |
|---|---|
| The account already supplies the relation and answer. | Use them. |
| The relation applies, but a participant or condition is unknown. | Ask whether resolving it could change the work. |
| The relation does not apply under the scheme’s own conditions. | Drop that question or try an applicable scheme. |
| The expression cannot represent the needed distinction. | Change the expression or scheme; A.6.3.RT helps when that change needs work. |
| The scheme conflicts with a consequential part of the case. | Reconsider the correspondence or assumption before using its consequence. |
An empty position in a diagram establishes none of these outcomes by itself. If adapting a scheme changes a relation’s meaning, state that change and reconsider the conclusions that depend on it.
Try two plausible answers when that cheaply reveals what is at stake. If both permit the same sufficient continuation, stop the additional inquiry. Otherwise formulate the question in the participant’s working language and say what answer would help: a condition, construction, distinction or bound. The benefit can concern a later inquiry or a new method. C.11.DUA governs whether obtaining the answer is worth its burden; no record of declining an unnecessary inquiry is required.
Use the resulting answer directly or continue constructing the model it needs. A subject specialist or AI can supply a relation, correspondence or calculation; the required knowledge and access depend on that contribution. Selecting a scheme creates no requirement to traverse a whole ontology or to learn every relation before making the useful move.
B.5.FM:4.3 - Build relations that can produce a consequence
Use subject knowledge to propose how the selected participants interact or which operations are permitted. Explain how each proposed relation answers part of the question. A physical interaction law, a mathematical formation rule and an execution rule supply different kinds of premise.
When the working question is causal and the proposed mechanisms still need to be expressed as comparable models, use C.28.CM to construct and challenge those models. Keep the outcome and time horizon comparable across the accounts, together with any intervention being considered. Make the variables, mechanisms, assumptions and material alternative influences explicit. Return each model with its useful consequence or the premise still needed to derive one; continue with inference and criticism in :4.4–4.5. An annotated sketch or ordinary explanation may suffice. Use a supplied or readily constructed model directly when it already supports the needed inference.
Starting material can come from more than one source. A known model may need to be altered before it becomes a useful analogy. Recover the corresponding participants and relations, then examine the changes needed in the present situation. The construction can improve both the proposed model and the understanding of what it represents.
Keep coupled choices compatible. If liquid leaving a closed vessel increases the space occupied by trapped gas, a pressure calculation must use that changed space. If two classes of formal objects permit different extensions, their counts must remain distinguishable until the extension is performed.
Use an expression that lets you carry out the next inference: an annotated sketch, a table of permitted operations, equations, a physical surrogate or a computational construction. A physical surrogate has its own material behavior; establish which of its results can inform the original situation. C.29 helps construct and use a mathematical representation, including when no mathematical object has yet been selected. A.6.3.RT helps when the expression itself prevents the operation.
B.5.FM:4.4 - Obtain the smallest useful consequence
Work one case through the proposed relations. A direction of change, a limiting value, an obstruction or a small construction may answer the current question before a detailed numerical model is needed.
Show which premise makes the consequence follow. If calculation or simulation is needed, C.29.2 supplies computational formulation and C.29.3 supplies realization. If the reasoning is available but difficult to follow, B.5.RA helps recover the decisive inference.
Return the consequence to the question. A limiting value can rule out an intervention under the model’s assumptions. A constructed recurrence can supply a count. An unresolved interaction can turn “calculate the system” into a specific request for another contribution.
B.5.FM:4.5 - Examine a choice that can change the answer
Challenge the model at a consequential choice: an omitted interaction, a grouping of cases, a fixed quantity, an operation rule or a correspondence. Use an available observation, a contrasting case or an inexpensive trial when it can distinguish the remaining alternatives.
An operation performed on a model establishes a model consequence. Reliance on a physical prediction also depends on the physical correspondence and conditions. Obtain the assurance needed for that receiving use; a sufficient conditional answer can remain useful while a premise is unresolved.
When a discrepancy has several possible explanations, retain those possibilities until the question needs them distinguished. B.5.MPC.R helps repair a failed physical, mathematical and computational connection. B.5.RR carries a changed premise through affected reasoning.
B.5.FM:4.6 - Apply the result and choose the continuation
Use what the model now supports: make a design choice, reject an option, construct an object, specify a calculation, select an observation or revise the question. Try the proposed use of that consequence. For example, sufficient average delivery can settle a capacity question; continuous supply also depends on delivery times, consumption and available stock. If the intended action needs such a further relation or condition, keep the supported answer and identify the missing contribution. Supply the assumptions another contributor needs to use the result.
Name a missing contribution by the result it must provide. For example, ask which heat-transfer path a proposed change affects, which state distinguishes two continuations, or which operation produces the needed formal object. A.15.9 helps obtain that contribution from another practice.
Keep an explanatory trace when later use or collaboration requires it. A new model-building move can also become material for C.39’s method development and C.36.RP’s shared-method renewal when that further work is needed.
B.5.FM:5 - Archetypal Grounding
These constructed cases expose different model choices. Their calculations establish conditional consequences; no apparatus test is reported.
B.5.FM:5.1 - Choose the heat path before commissioning a calculation
An engineer asks whether a stronger external fan can bring an overheating component below 65 °C. Inspection finds the component attached to a metal case through a pad; the fan blows over the outside of the case.
Trace the proposed path from component to case and then to the surrounding air. Keep the component, the case at its attachment and the air distinguishable: their temperatures can differ, and the fan acts on one part of that path.
Try a steady account with constant component heating, all generated heat passing through the pad, and an unchanged linear conductance between component and case. Carrying the same heat per second then requires the same temperature difference across that path. Treat outward case-to-air transfer as driven by temperature difference. A steady case receiving positive heat must remain warmer than the air.
Use supplied steady readings of 80 °C at the component, 25 °C at the case attachment and 20 °C in the air. The component-to-case difference is 55 °C. Even ideal external cooling of the case to the air temperature leaves the component at 75 °C under these assumptions. The fan-only proposal cannot reach 65 °C in this model.
The result directs work toward the component-to-case contact, another heat path or reduced heating. Direct airflow onto the component would change the assumed path; temperature-dependent heating or conductance would change the fixed-difference argument. Measurement uncertainty matters to the real-device conclusion.
A useful next request is: “Can this component stay below 65 °C after changing its contact to the case, and which observations distinguish the relevant heat paths?” The model supplies that request before a detailed equation set is commissioned.
B.5.FM:5.2 - Include the air when modeling liquid discharge
Consider a rigid vessel with a liquid outlet near its bottom and trapped air above the liquid. The question is whether enlarging the outlet will allow most of the liquid to drain. A model based only on liquid height can miss what changes when liquid leaves.
For a first conditional account, assume that no air enters and the liquid is incompressible. Treat the trapped air as an ideal gas at constant temperature and fixed amount. Consider slow flow whose inertia is negligible and whose motion is dissipated by resistance at the outlet. Include the gas volume and absolute pressure, the liquid height above the outlet and the outside pressure. Liquid leaving increases gas volume and lowers gas pressure.
At the no-flow equilibrium, the internal pressure at the outlet equals the outside pressure. For the following rough calculation take liquid density as 1,000 kg/m³ and gravitational acceleration as 10 m/s². Initial liquid height is 20 cm, trapped gas volume is 100 cm³, vessel cross-section is 100 cm² and initial gas and outside pressures are both 100 kPa.
Let q be the discharged volume in cm³. The gas occupies 100+q cm³; liquid height is 20−q/100 cm. The isothermal gas relation and hydrostatic head give the equilibrium equation:
10000/(100+q) + 0.1*(20−q/100) = 100 [kPa]
The positive solution is about 2.039 cm³, with gas pressure about 98.002 kPa and liquid height about 19.980 cm. In this slow-flow account, the discharge approaches a stop after a very small volume. Changing outlet size changes resistance and the approach to equilibrium; this same equilibrium balance applies while air entry and inertial effects remain negligible.
Allowing ambient air to reach the gas space changes the model: gas pressure can remain near outside pressure as liquid leaves. Air entering through the outlet, gas-temperature change, vessel deformation or appreciable capillary pressure requires another account. The immediate useful result is the distinction between an outlet-flow restriction and a gas-replacement restriction. Investigate the air path before treating outlet enlargement as the answer.
B.5.FM:5.3 - Construct classes that permit a counting inference
We need counts of binary strings at several lengths under a rule that forbids consecutive 1s. Use length four as a small case. The question supplies symbols and a restriction, but no recurrence.
Start with short valid prefixes and examine their allowed next symbols. A prefix ending in 1 may receive only 0. A prefix ending in 0 may receive either symbol; the empty prefix has the same two permissions. Group prefixes by those extension permissions.
Let r_n count valid length-n prefixes that are empty or end in 0; let b_n count those ending in 1. Every valid prefix can receive 0, while only the r_n prefixes can receive 1:
r_0 = 1, b_0 = 0
r_(n+1) = r_n + b_n
b_(n+1) = r_n
The pairs for lengths 1 through 4 are (1,1), (2,1), (3,2), (5,3). There are eight valid strings of length four.
The inference works because each extension produces a distinct string, deleting its final symbol recovers its unique predecessor, and the two resulting classes exhaust the permitted cases. The total alone does not tell how many prefixes permit appending 1; keeping the two classes makes that operation possible.
If the restriction changes to “no three consecutive 1s”, the same grouping loses a needed distinction. Separate prefixes with zero, one or two trailing 1s and reconstruct the permitted transitions. This change identifies what the state must retain; the subsequent recurrence or program is a further computational contribution.
B.5.FM:5.4 - Find the limiting relation in a workshop plan
Twelve people have accepted a 60-minute workshop. There are twelve seats and one instructor. The proposed arrangement gives each person a four-minute attempt observed by that instructor, then two minutes of the instructor’s feedback before the next attempt begins. The initial plan lists attendance and materials.
Use the relation between attempted action, observation and feedback to ask whether the intended practice can occur in the session. The sequential arrangement requires 12 * (4 + 2) = 72 minutes before any introduction. The next question is which arrangement can supply the intended practice and feedback within the available time. Reducing attendance, increasing duration or changing the learning arrangement have different consequences. Merely pairing learners supplies the required feedback only if they can provide that contribution.
Now suppose twelve independent stations already provide the required task-specific feedback and can be used concurrently. The serial calculation no longer describes the work. Use the concurrent duration and the remaining session activities to decide whether the arrangement fits; this reasoning does not require another instructor. If the intended event is instead a demonstration with no individual practice, the individual-feedback relation does not impose that practice on it. Clarify the event’s purpose before treating this scheme as applicable.
The same question-forming move can use a measurement scheme: a shared column label, such as temperature, leaves the relevant quantity, observing conditions and aggregation to be recovered before combining records. If the existing documentation already establishes their suitability, use that answer. The scheme supplies a question, not a compulsory new measurement.
B.5.FM:6 - Bias-Annotation
The examples use small explicit accounts so that the reader can inspect the construction. Complex systems can require learned representations, instruments and multiple specialist contributions. Their suitability depends on the inference and available means.
Source studies of human scientific work motivate some construction moves. Their transfer to AI agents concerns the work to perform and the result to supply; it does not assert identical cognitive mechanisms or learning requirements.
B.5.FM:7 - Conformance Checklist
- The working question identifies a consequence that would help a receiving use.
- Selected participants and distinctions support that inference.
- Proposed relations have interpretable participants, conditions and appropriate subject grounds.
- Coupled quantities and operation rules are used consistently.
- At least one useful consequence is worked through, or the missing contribution is identified.
- The consequence is returned with the conditions needed for its application.
- Further refinement, observation or assurance answers a remaining question that matters to use.
B.5.FM:8 - Common Anti-Patterns and How to Avoid Them
| Recognizable failure | Repair |
|---|---|
| Fit a model whose variables cannot express the proposed intervention. | Recover the participants and relations through which the intervention could change the result. |
| Copy a familiar analogy while its operation has a different meaning in the present case. | Construct the needed correspondence and test the transferred consequence. |
| Aggregate cases before performing an operation whose permissions differ between them. | Keep the permission-changing distinction until that operation is complete. |
| Increase simulation detail while an omitted interaction determines the answer. | Obtain a limiting or contrasting case that exposes that interaction. |
| Give a specialist a broad modeling request that leaves the needed result unclear. | Supply the provisional account and ask for the contribution that would change the next decision. |
B.5.FM:9 - Consequences
A first model can turn an open request into an answer, a bound or a well-formed next contribution. It makes model-building choices available for criticism and allows others to continue the reasoning.
Its cost is the work of selecting and connecting distinctions. Keep an adequate simple account while its conditions suffice; develop it when the receiving question exposes a consequential limitation.
B.5.FM:10 - Architectural Rationale
Model construction and model use often develop together. Trying an operation reveals which distinctions are missing, while the revised distinctions permit another inference. The method therefore keeps selection, relation construction, expression and consequence in one connected reasoning move.
The heat case depends on separating temperatures and locating an intervention along a path. The vessel case requires coupling two interacting media. The counting case creates classes from permitted operations. Their shared method is the construction of an inferentially useful account; their subject premises remain different.
B.5 coordinates the overall inquiry. This method develops its model-building contribution. B.5.4 gives a narrower entry when an available concept needs a situational interpretation. C.29 supplies mathematical representation choice. A.3.3, C.16 and A.6.3.RT supply state, measurement and expression construction when those questions occur within model building.
B.5.FM:11 - SoTA-Echoing
Construction as a reasoning contribution. Adapt Nersessian’s 2025 account, §3: a useful analogy may have to be built, with its correspondence revised during use. The present method applies that contribution in :4.2–:4.4: select distinctions through a needed consequence, build compatible relations and use a small case to revise the correspondence. Reusing a calibrated domain model is cheaper when it already expresses the proposed change. Constructing another account becomes worthwhile when the available model cannot express a consequential interaction or operation; the vessel and prefix cases show those failures.
Qualitative consequences and application. The ISLE explanation by Etkina and Brookes connects observation, proposed explanation, predicted consequence, testing and application, first qualitatively and then quantitatively. Use that progression in :4.4–:4.6 when a physical prediction needs examination and application. A formal construction can instead proceed from its formation rules and a derivation, as in :5.3.
Finding a question through a scheme. Compare two practical starting points: follow a provisional question into a small model (:4.1–:4.5), or use an understood scheme to expose a question (:4.2.1). Give both routes the same workshop facts, knowledge of the attempt/feedback relation and a hand calculation. The first can begin with “Can this plan provide the intended practice?”, select the instructor’s time, derive 72 minutes and revise the arrangement. With independent stations it changes the model and withdraws the serial restriction. Both routes can obtain these results.
Use the scheme-based entry when an apparently adequate account, such as a seating plan, leaves the relevant question unclear. Its applicability table distinguishes an unknown relation from one that is inapplicable, inexpressible or in conflict with the case. In :5.4 the demonstration-only variant drops the individual-practice question instead of treating it as a missing provision. Recovering and trying a scheme has a cost: use the direct construction when the distinction and question are already clear. This comparison supports a choice between instructions under the stated conditions; it establishes neither faster learning nor better field performance.
Gentner and Hoyos, Analogy and Abstraction, 2017, §§1.2–2, provide a historical structural-alignment account. Adapt relational rather than name matching in :4.2.1; the reviewed transfer effects depend on their task and comparison conditions. Keet and Khan, Discerning and Characterising Types of Competency Questions for Ontologies, 2024, §§3–4, contribute purpose-sensitive questions and limits of a scheme’s expressiveness. Adapt those distinctions in the applicability table without imposing their ontology-specific taxonomy. Vagnino and Walker, Schema drift, 2026, supplies a limitation: repeated comparison can change relational judgments, with rival explanations unresolved. This motivates the explicit return to a changed relation; it does not establish this repair’s efficacy.
Reconsider the scheme-based entry when it repeatedly produces irrelevant questions or when the direct construction already supplies the needed distinction. Repair the correspondence or continue from the adequate question before broadening the inquiry.
Subject premises of the physical cases. OpenStax, University Physics 2, §1.6 supplies the conducting-layer and convection relations. Volume 2, §2.1 supplies the isothermal fixed-amount gas relation; Volume 1, §14.1 supplies the hydrostatic pressure relation. The chosen arrangements, simplifications and receiving questions are the present constructions.
Reopen the method when another construction approach supplies a more useful model at comparable effort, or when a recurring difficulty calls for a model-building move absent from this account.
B.5.FM:12 - Relations
- B.5 coordinates inquiry; B.5.4 constructs a supplied concept’s correspondence to a situation.
- C.28.CM develops missing causal relations and alternatives, returning a conditional consequence or unresolved premise to the general model-building question.
- C.29 selects and uses a mathematical representation. C.29.1, C.29.2 and C.29.3 supply transfer, computational formulation and realization.
- A.3.3, C.16 and A.6.3.RT supply state, measurement and expression construction.
- B.5.RC and B.5.RA recover an available construction or argument. B.5.RR revises reasoning; B.5.MPC.R repairs a failed joint physical answer.
- C.11.DUA governs worthwhile further effort; A.15.9 obtains another practice’s needed result.
- C.39, C.36.RP and E.10.INT support later method development, shared-method renewal and recovery of the interest guiding further work.
B.5.FM:End
B.5.TU - Construct a Working Use of an Unfamiliar Theory
Type: Method-description pattern Status: Stable Normativity: Normative unless marked informative
B.5.TU:1 - Problem frame
Use this pattern when a theory offers a promising way to answer a question, but you cannot yet connect its objects and reasoning to an answer you can use. You may recognize the notation or reproduce a calculation while still being unable to say what to supply, which operation matters, or what the result would let you do.
The work here is to construct one application of the theory. Begin with the question and the available account; obtain and interpret the contribution that question needs. The result can be a construction, prediction, explanation, bound or identified missing operation. A mathematical question about what can be constructed is a possible receiving use, as is an engineering decision.
First useful move. Choose one question the theory might settle. Find a source case or rule that could supply its answer. Say what plays each required part in your case, work the decisive operation, and explain what its result changes. If you cannot make that connection, locate the first missing premise, interpretation or operation.
For example, a theory of composition lets you combine two operations. Does it let both consume one input, or does the combination require two separately supplied inputs? Recovering that distinction can change the proposed implementation before any code is written.
Use an adequate, understood application directly. A specialist or tool may supply a result you can already interpret and use under its conditions. Reconstruct more of the theory when the needed application, criticism, adaptation or explanation remains unresolved.
B.5.TU:2 - Problem
A theory’s descriptions usually distribute its usefulness across definitions, examples, constructions and arguments. A reader may know each familiar word yet be unable to assemble these contributions for a new question. Conversely, a familiar calculation can conceal a change of question: the calculation solves the stated equations, while the receiving work needs a condition those equations omitted.
The difficulty has two connected parts. First, discover what the account makes possible and how to obtain that result. Then apply it to the question that justified the work. An answer can also reveal a new question or a useful limitation of the theory.
B.5.TU:3 - Forces
| Force | Consequence for the method |
|---|---|
| A question focuses learning, while an unfamiliar account can change the question. | Begin with one intended use and revise it when a construction reveals a consequential distinction. |
| A worked source case saves effort, while a new application changes some of its premises. | Reuse the case and identify the changed contribution before carrying over its answer. |
| Operational fluency and understanding of derivations serve different work. | Recover the depth needed to apply, criticize or alter the contribution. |
| A small case exposes connections, while a general claim reaches beyond that case. | Keep the demonstrated use and the argument for greater reach distinguishable. |
| Available assistance can supply difficult operations, while the receiving use still needs interpretation. | Divide work at the missing contribution and retain the meaning of the returned result. |
B.5.TU:4 - Solution
Connect the working question, the theory’s constructive or inferential resources, and the use of the resulting answer. Enter where the unresolved connection begins; reuse contributions already available. The following unfolding can be revisited when its own result changes an earlier choice.
B.5.TU:4.1 - Choose an application worth constructing
State what an answer would help someone understand, obtain, predict, rule out or change. Select one case small enough to work with the available means while retaining the difficulty. For example, “Can these two operations use the same input?” gives composition rules a purpose; “understand category theory” leaves that first use unselected.
Locate a source application serving that question, or the nearest account whose objects and rules could be adapted. State which part is supplied and which you are proposing. A theory can also be explored to discover a useful question: try one of its characteristic operations and inspect what its result makes distinguishable or obtainable.
Determine the contribution you need to learn or obtain. Applying a supported formula can need its inputs and use conditions; changing the formula can need its construction and argument. Explain the needed difference in work before selecting further study.
B.5.TU:4.2 - Recover what the theory lets you work with
For this application, identify the objects, relations, given information, permitted constructions and inferential rules. Read a definition together with an operation that uses it. Ask what can be supplied as an input, what can be produced, and which property or conclusion the rule establishes.
Follow the needed result backward to its prerequisites. Keep shared prerequisites and jointly required inputs visible. When a description names a construction without showing how to perform it, B.5.RC recovers its producing operations. When an inference remains unclear, B.5.RA recovers the reason and transitions needed by the receiving use.
Make an unfamiliar expression operative at the point of difficulty. Determine the arguments of a function, the objects related by a diagram, or the conditions under which a rule applies. A.6.3.RT helps construct a usable expression under the available notation. Understanding a symbol’s name is useful only as far as it helps perform or interpret the operation.
B.5.TU:4.3 - Construct the application
Connect each consequential object and condition to the selected case. Some are supplied by observation or design; some are assumptions of the model; others belong to the theory’s mathematical construction. Keep their roles clear where they affect the conclusion.
Choose the values, boundary conditions, allowed operations and sought output. For a theoretical question, this may be entirely a construction within the theory. For a physical use, explain which system, quantity or interaction the mathematical object represents. C.29 supplies the mathematical correspondence and the comparison of what it preserves, omits or introduces.
Compose the required operations. Check the connection between successive contributions: an operation’s output must supply the next operation’s required input. An integration procedure, for example, needs a function of its integration variable; a formula with unfilled path or parameter arguments has yet to supply that function.
If a source case cannot be adapted by the available rules, identify the particular missing contribution. Another formulation, a specialist result or a developed operation may supply it. A.15.9 supports obtaining and using bounded help; C.39 supports developing a way when none is known.
B.5.TU:4.4 - Obtain and inspect a consequence
Work the selected case far enough to answer the question or expose the gap. Use direct reasoning, a construction, a small computation or an available tool according to the work. Recover the step that makes the consequence follow and the premises it uses.
When computation is involved, interpret its inputs, operations and output. C.29.2 supplies a missing computational formulation; C.29.3 supplies the connection to the system performing it. A successful execution can help locate expression or implementation errors. The argument for what the computation establishes remains tied to the chosen formulation.
Compare with a simple consequence you can inspect when that comparison can reveal an error: a limiting case, a preserved quantity, an input count, a dimensional relation or a small enumeration. Select the relevant comparison; its purpose is to expose a possible failure in this application.
B.5.TU:4.5 - Apply the answer to the working question
Read the answer back in the terms of the intended use. If it gives a construction, determine whether the required inputs and operations are available. If it gives a bound, use the exclusion or allowance that bound supports. If it gives a physical prediction, identify the model and operating conditions under which that prediction concerns the system.
Examine the correspondence at the point where it could change the action. Does a feasible mathematical answer violate a receiving condition? Could two cases treated alike by the formulation require different actions? If so, restore the distinction, change the formulation, or keep a weaker answer that remains useful.
For a new physical reliance, address the model assumptions whose failure could change that use. Reuse adequate knowledge and observations. Choose further checking or acquisition under C.11.DUA when their benefit and burden are the live decision; an unresolved stronger claim need not displace a sufficient conditional answer.
B.5.TU:4.6 - Return the result and choose the continuation
Return the interpreted answer and the conditions its receiver needs. An ordinary explanation, calculation or demonstration can carry it. Preserve a separate account when another participant or later use needs to reconstruct the application.
Stop when the contribution suffices. Otherwise identify what remains: a source explanation, missing operation, changed model, competing theoretical account or newly worthwhile question. B.5.RR follows the effect of a changed premise; B.5 coordinates a changed inquiry.
Use this result to choose the next learning or work contribution. When the work requires one participant to apply or alter the method independently, that capability needs its own performed use under the relevant conditions. A supplied answer can still serve work that does not require that independence.
B.5.TU:5 - Archetypal Grounding
B.5.TU:5.1 - Discover whether one input is enough
A practitioner wants to use two available operations, f: X -> Y and g: X -> Z, on one input. The letters name distinct atomic types. The question is whether the chosen composition rules can produce both results from that input.
In a cartesian account, a copying operation Delta_X: X -> X x X supplies the pair of inputs. First copy, then apply the two operations: (f x g) after Delta_X sends x to (f(x), g(x)). The input of the parallel operation is now supplied.
Compare a resource-sensitive account generated only by f, g, identities, serial composition, tensoring and exchange of factors. Tensoring f with g takes X tensor X to Y tensor Z: it requires two inputs. Each given generator preserves the number of atomic factors, and serial composition, tensoring and exchange preserve that property. These rules therefore cannot construct X -> Y tensor Z. Supplying another input or adding an admissible copying operation changes what can be built. This is a result about the stated generated account.
Now apply the distinction. For a reusable data value interpreted through pure functions, both uses can receive that value. For a physical specimen consumed by an assay, obtain a physical way to supply what each assay needs. Dividing a specimen may supply those inputs if the assays admit the resulting portions. The word “copy” would leave that physical contribution unexplained.
The common method discovers the needed theory operation and returns its consequence to use. The cartesian construction and its contrast with tensor composition come from Baez and Stay, §2.3; the input-count argument makes the stated restricted case inspectable.
B.5.TU:5.2 - Use variational mechanics to answer a motion question
An engineer wants to understand what a variational account predicts for an ideal carriage coasting along a straight horizontal track. Adopt a one-dimensional nonrelativistic free-particle model: positive mass m, negligible resistance and no applied driving force during the interval. Its Lagrangian is L(q, v) = m*v*v/2. For this case, the action is the time integral of that quantity along a proposed path. The physical model supplies this choice of Lagrangian.
The mechanical rule selects paths of stationary action: for every small path variation that leaves the endpoint positions fixed, the first-order change of action must vanish. The calculation below finds that path and shows that, for this free particle, it minimizes the action. Reproducing the calculation uses differentiation and definite integration; the displayed action identity can also be obtained as a supplied mathematical result.
Let the carriage pass q=0 at time 0 and q=d at positive elapsed time T. Recover the operations hidden by “calculate the action”: choose a position function q(t), differentiate it to obtain velocity, evaluate L on those values, then integrate over time. This is the constructive use developed in SICM, §§1.3–1.4. The following one-dimensional case uses it.
Start with q_0(t)=d*t/T, and try paths
q_a(t)=d*t/T + a*(t/T)*(1-t/T), where a is a length. Every path has the specified endpoint positions. Its velocity is v_a(t)=(d+a*(1-2*t/T))/T. Substitution and integration give
S_a = m*(d*d+a*a/3)/(2*T).
For m=1 kg, d=2 m and T=1 s, the straight path has action 2 J s; a=1 m gives 13/6 J s.
This comparison favors the straight path within the chosen family. The general argument is also short. For any continuously differentiable added displacement eta(t) that is zero at both endpoints, the cross term integrates to (m*d/T)*(eta(T)-eta(0))=0. Thus the change in action is (m/2)*integral(eta'(t)^2 dt), which is nonnegative. The straight path minimizes this action among those paths. For a nonzero eta, write this positive change as K. Along the paths q_0+c*eta, the action is S[q_0]+c*c*K, whose derivative at c=1 is 2*K>0. Thus a nonzero displacement from q_0 cannot be stationary. The selected motion has constant velocity d/T.
The application now has an interpreted answer: under the adopted model, passing those endpoint positions in that time entails constant velocity. A computational implementation must evaluate the path derivative in the velocity argument before integrating. It can reproduce the numerical action comparison; the displayed argument supplies the wider conclusion.
Suppose the same two-metre trip must instead begin and end at rest. The constant-velocity answer fails that condition. The useful return is that the undriven free-particle account cannot supply this trip: the design needs acceleration and deceleration, and an account of the forces producing them. The next contribution is that driven-motion model. Increasing the resolution of the same free-particle calculation would retain the missing physical contribution.
B.5.TU:5.3 - Keep a useful bound when the optimizer cannot be enacted
A planner learning optimization must select whole jobs for four available hours. At most one A-job is available, taking three hours for stipulated value 5; at most two B-jobs are available, each taking two hours for value 3. Durations and values add in this constructed problem.
A linear relaxation permits real counts 0 <= x <= 1, 0 <= y <= 2 with 3*x+2*y <= 4. It returns x=1, y=0.5, value 6.5. Recover the argument: the time condition gives y <= (4-3*x)/2, so 5*x+3*y <= 6+0.5*x <= 6.5; the returned pair attains that limit.
For the actual whole-job choice, enumerate the alternatives. With A selected, no B fits and value is 5. Without A, two B-jobs fit and value is 6. Select two B-jobs. The fractional optimizer has still supplied a useful bound: no whole-job arrangement can attain value 7 because every such arrangement is also admitted by the relaxation.
The use of the theory changes with the question. Selecting work needs an attainable arrangement; excluding a target can use a bound. The practitioner needs to recover that relation before deciding whether a further optimization step is useful. B.5:5.4 also works the changed five-hour case.
B.5.TU:6 - Bias-Annotation
The worked cases favor explicit mathematical accounts with small, inspectable operations. Other theories can use qualitative or interpretive inferences; their warranted application conditions and criticism must come from the relevant practice. A convenient numerical example should not decide which kind of explanation the question needs.
Familiar terminology can make a supplied interpretation look independently recovered. Attribute the actual contribution when assessing learning or capability. In ordinary assisted work, use the supplied result at the scope its interpretation supports.
B.5.TU:7 - Conformance Checklist
- The application has a working question and a useful result to obtain or interpret.
- The theory’s objects, operations and premises needed for that application are recoverable.
- The construction connects supplied inputs to required outputs; a missing operation remains a specific gap.
- A source-supported application and a newly proposed adaptation retain their respective grounds.
- The worked consequence states what its construction, argument or computation establishes.
- The receiving use preserves consequential conditions, including any difference between an attainable result and a bound.
- Further study, evidence or specialist work serves a remaining useful contribution at an appropriate cost.
- The return supports an action, understanding, construction or next question; sufficient use can stop.
B.5.TU:8 - Common Anti-Patterns and How to Avoid Them
| Observed difficulty in the method’s cases | Repair |
|---|---|
| Reuse a composition while overlooking how many inputs it consumes. | Recover the permitted operations and supply their inputs; in :5.1, copying is the decisive additional operation. |
| Evaluate a familiar-looking expression before filling its arguments. | Construct the path, derivative and substitution required by the operation, as in :5.2. |
| Improve a computation whose formulation omits the receiving condition. | Recover that condition and change the model or question; finer calculation of undriven motion leaves departure at rest unresolved. |
| Discard an infeasible optimizer together with its valid bound. | Interpret each result separately; :5.3 retains the exclusion of value 7. |
| Require the same depth of study for using and altering a result. | Locate the contribution the work needs, then recover or obtain the reasoning that enables it. |
B.5.TU:9 - Consequences
The practitioner can move from a promising theory to a worked use, or state the contribution that prevents it. The result also makes division of work easier: one participant can supply a model, another a construction or calculation, and another the receiving interpretation.
The cost is recovering enough of the account to assemble and use the application. Reuse supplied explanations and operations where adequate. Detailed derivations, broader source comparison or empirical inquiry are worthwhile when their answers affect the intended work.
B.5.TU:10 - Architectural Rationale
The method joins two directions of reasoning. Working backward from the question reveals the needed contribution. Working forward through the theory tests whether the available objects and operations actually supply it. Returning the consequence to use exposes conditions a correct internal calculation can leave unresolved.
B.5.RC and B.5.RA recover constructions and arguments. Here they contribute to assembling an application whose meaning and needed output may still be unsettled. C.29 constructs and tests mathematical correspondence; it can start before a mathematical object has been selected. This method adds recovery of how the unfamiliar theoretical account becomes usable at that point. A theory can also be used within its own mathematical setting, as in the composition case.
A complete explanation of the theory can be the appropriate learning project. For one urgent use, however, an adequate supplied application or bounded specialist result may settle the question sooner. The choice depends on the work the receiver must perform, including any need to criticize or change the method later.
A small successful application provides something to use and a basis for further inquiry. Broader generalization requires its own argument. If the application exposes a limitation in the theory, the resulting construction or counterexample can become material for developing its objects, rules or questions.
B.5.TU:11 - SoTA-Echoing
How much theory must be reconstructed for a first use? Adapt van Oostrum, Langer and Ay (2025), Introduction and §§1–2, 4: connect the operational question to stated model variables and inference, work an example, and recover deeper derivations when they are needed. The alternative is to use an interpreted supplied implementation. Retain that cheaper route when it suffices; reconstruct dependencies when adaptation or explanation requires them. Sections :4.1–:4.4 make that choice explicit. The source provides a discrete active-inference account and a minimal implementation, not evidence that one learning sequence suits every practice or agent.
How can notation reveal what an application still lacks? Adapt SICM’s Preface: recover function arguments, substitutions and composition where implicit conventions obscure the operation. A familiar conventional expression is cheaper when the reader can already use it reliably. Sections :4.2–:4.4 therefore call for operative reconstruction at the unresolved step; :5.2 supplies a case. The selected contribution is explicit operation recovery. Its source’s strong requirement of automatic interpretability is appropriate for computational exposition; ordinary use may be settled by a clear hand-worked construction.
What does a theory’s formal structure contribute to an application? Adopt Baez and Stay, §2.3’s constructive comparison of cartesian and monoidal operations. A familiar “parallel composition” description can leave input duplication unresolved. Section :5.1 obtains the required operation or the obstruction under stated rules, then asks whether the receiving practice can supply it. This pays the cost of recovering only the consequential structure. The broader cross-disciplinary correspondences in that paper do not establish the physical copying operation in our case.
The common method is a synthesis of these contributions. Reopen it when a better approach obtains a usable application with less reconstruction, when a recurring failure requires another connecting operation, or when changed tools alter the contribution the receiver must understand.
B.5.TU:12 - Relations
- B.5 coordinates the inquiry and a changed question. B.5.FM constructs a first model when consequential participants or relations remain unclear.
- B.5.RC, B.5.RA and B.5.RR supply construction recovery, argument recovery and reasoning revision.
- B.5.4 constructs a situational interpretation of an available concept. C.29 and C.29.1 supply mathematical correspondence and result transfer.
- C.29.2, C.29.3 and B.5.MPC connect computation, realization and the physical question.
- A.6.3.RT prepares an operative expression; C.2.8 helps characterize what a recipient can extract from an explanation under stated preparation and access.
- A.15.9 supplies bounded professional help; C.11.DUA selects useful further effort; C.39 develops a missing way.
- C.40 develops questions and ways together when the application opens that further work.
B.5.TU:End
B.5.TC - Compare Theoretical Accounts for a Working Question
Type: Method-description pattern Status: Stable Normativity: Normative unless marked informative
B.5.TC:1 - Problem frame
Use this when two theoretical accounts appear to give different answers, explanations or instructions for the work you are doing, and you need to decide how to use them. They may employ different objects, preserve different information or obtain a result by different operations. Comparing their vocabulary or final numbers has left the practical difference unclear.
The work here is to compare particular uses of those accounts. A theory supplies objects, relations and ways of reasoning; an application adds a question, an interpretation and the premises needed to obtain an answer. Compare those applications while keeping the underlying accounts understandable on their own terms.
First useful move. Ask one concrete question of each account. Supply the same relevant situation, recover how each answer is obtained, and locate the first difference that matters to the use. A route description that says where travel is possible and one that gives minimum travel cost can both be useful. The question determines which information and operations you need.
The result explains what each account contributes, the conditions of agreement or difference, and which use or inquiry should follow. You may select one sufficient account, combine complementary contributions, or retain an unresolved difference together with what remains usable.
Use a familiar comparison directly when its question and conditions already fit. If only one application is unclear, B.5.TU helps construct it. If the disputed object is a numerical implementation of an understood model, begin with C.29.2. This pattern becomes useful when it is still necessary to compare the accounts or locate the source of their apparent disagreement.
B.5.TC:2 - Problem
Two descriptions can use the same word for different quantities, or different words for a shared construction. One can answer a weaker question. They can agree on observations while disagreeing about an intervention. An approximate computation can also obscure agreement between the theories from which the computations were derived.
A useful comparison must recover enough of each application to distinguish these situations. It must also leave room for an account that opens a question the original comparison did not ask. The practical problem is to determine what the difference permits, prevents or changes for the work, without requiring a verdict on the theories in every possible use.
B.5.TC:3 - Forces
| Force | Working tension |
|---|---|
| A shared question vs different concepts | Comparison needs a shared use, while translating every term into one vocabulary can erase the difference being investigated. |
| Agreement vs scope | A worked case makes an account usable; an equivalence claim across cases needs the corresponding argument. |
| Explanatory reach vs effort | A richer account can answer further questions while a smaller account supplies the present answer more cheaply. |
| Discrimination vs useful closure | A difference may justify further work, or leave the needed result unchanged. |
| Common operations vs subject knowledge | The comparison method travels across practices; its particular proofs, laws and causal premises come from the accounts being compared. |
B.5.TC:4 - Solution
Fix the working question → construct each account’s application → align the case and the meaning of its answer → locate the consequential difference → use what the comparison establishes, or pursue the difference that matters.
The sequence is revisable. Reuse an established application or correspondence. Return to the question when the accounts reveal that it combines different needs. Stop when the available result suffices for the intended use.
B.5.TC:4.1 - State the answer the work needs
Say what you want to explain, predict, construct or decide, and what would count as an answer. Specify the conditions that can alter that answer: for example, the initial state and time of a prediction, the allowed routes and quantity to minimize, or which intervention is contemplated.
Keep the account and its proposed use separately visible. Comparing a theory’s possible reach with a rival’s already implemented calculation is a comparison of unequal contributions. Either construct the relevant application of both or state which contribution is still unavailable. An unavailable application can be a reason to use another account now while retaining the first for development.
If the accounts answer different questions, identify their shared question, if any. For the remaining questions, compare their usefulness as complementary contributions. A newly expressible question can itself be a valuable result: explain what inquiry it opens and why that inquiry matters. B.5:4.4 connects this result to problem development.
B.5.TC:4.2 - Recover an application of each account
For each account, recover the objects and relations used, what is supplied or assumed, the operation that obtains the answer, and how that answer is interpreted. Follow the reasoning far enough to reproduce the step on which the comparison turns. B.5.TU, B.5.RC and B.5.RA supply application, construction and argument recovery when needed.
Preserve the source’s distinctions during this work. If two accounts use state differently, explain which information each state retains and what continuation it determines. If a symbol has no counterpart, say what the account does with it before proposing a correspondence. Translate the required objects and operations; a word-to-word substitution alone cannot settle their relation.
An account may need information the present work lacks. Separate a supplied premise, a proposed premise and a derived result in the explanation. Continue conditionally when that is useful: “Under this independence assumption the minimum is 3; if continuations depend on the incoming route, we must retain that dependency.”
A collaborator or tool can supply a calculation or proof. Recover the interpretation and conditions needed to compare its contribution. Learn or request the missing operation when you cannot yet follow the decisive step; a broad study of both theories is unnecessary when a smaller contribution settles the use.
B.5.TC:4.3 - Work the same case and align the answers
Choose a small case that exercises the disputed operation or distinction. Give each account the corresponding inputs, derive its answer, and express the answers in the terms of the working question. Explain the correspondence when the inputs or outputs have different forms.
For a mathematical application, compare the retained distinctions and operations. C.29.1 supplies the preservation argument when a result is to be transferred. For a physical application, keep the phenomenon, operating conditions and meaning of the predicted quantity aligned. For a computation, separate the mathematical formulation from approximation, numerical tolerance and execution.
Begin with an understood case so a transcription or implementation error can be found. Then use a changed case that exercises the claimed difference: a shared resource, a constraint, an intervention or another relevant variation. Derive a general relation when the intended conclusion ranges beyond the cases. A finite example establishes its own result; a counterexample can refute a general assertion whose premises it satisfies.
Agreement of reported numbers is informative only after their meanings and conditions are aligned. Conversely, different intermediate objects can lead to the same answer through an explained correspondence. Record only the derivation or explanation the receiving use needs; the comparison does not require a standard table or separate report.
B.5.TC:4.4 - Locate what causes the difference
Follow each answer back to the first step where the applications cease to agree. Use the following distinctions where they resolve that case.
| What differs | Next useful operation |
|---|---|
| The question or output meaning | Restate the common question; keep other answers as complementary contributions. |
| A premise, boundary or retained distinction | Work the accounts under aligned premises, or show which case requires the additional premise or information. |
| A construction or inference | Recover the competing steps. Derive their relation or exhibit where one fails under its stated conditions. |
| An approximation or execution | Compare the mathematical result with the implemented procedure and its error under the relevant conditions. |
| The proposed physical or causal account | Derive the consequence on which they disagree; use the available domain knowledge and evidence for that consequence. |
Several differences can interact. Aligning one premise can remove an apparent conflict; it can also expose a remaining one. Keep the remaining question named. If the answer depends on a missing correspondence or inaccessible operation, return that missing contribution rather than ranking the theories from their summaries.
Additional evidence is useful when it can change the needed conclusion. First use an available derivation, counterexample, observation or established result. If the difference remains consequential, compare the possible gain from a discriminating inquiry with its cost and feasibility under C.11.DUA. A difference that cannot change the present use can remain unresolved. When it does change the use and cannot be settled, retain the conditional answers or obtain a sufficient weaker result.
B.5.TC:4.5 - Choose the use and preserve the reason
Return the comparison in the form the work can use. A short explanation can state the question, the decisive construction, what agrees or differs and the resulting continuation.
Common outcomes are:
- One sufficient account. Use the account that answers the question under acceptable conditions and effort. State the limitation that would make another account necessary.
- Agreement for a stated range. Reuse either account for that result, choosing by effort, available tools or the further construction it makes easier. Preserve the relation that supports the agreement.
- Complementary uses. Give each account its question and contribution. When combining their results, establish the compatibility needed at the connection.
- A consequential unresolved difference. Keep the conditional answers and the premise or observation that would discriminate them. Continue with an unaffected result, a sufficient bound or the worthwhile inquiry selected for that difference.
Accuracy, reach, computational effort, learning effort and the ability to change the construction can matter differently across uses. Compare the values that can change this choice. If their trade-off is unresolved, C.11 supplies the decision method; a single “best theory” score would hide it.
Reopen when the question, premises, interpretation, available operation or relevant evidence changes. B.5.RR helps revise the affected reasoning. Reuse the comparison where its dependencies remain intact.
B.5.TC:4.6 - Separate recognition from assurance
Recognize the need from an unresolved disagreement or a choice between accounts. One worked comparison can already reveal an omitted premise or a useful complementary answer.
Qualify the result for its intended use. A mathematical equivalence needs a derivation over its claimed domain. A physical prediction needs the corresponding model and observation basis. An implemented approximation needs an error account adequate for the question. Use the relevant subject Methods and B.3 for these claims. Broader reliance is a reason to establish the broader claim, while an ordinary local use can stop with its sufficient local result.
B.5.TC:5 - Archetypal Grounding
B.5.TC:5.1 - Routes, reachability and minimum cost
A mathematical account keeps routes as distinct objects. Routes p and q go from X to Y and cost 1 and 4. A route r goes from Y to Z and costs 2. Routes with matching endpoints can be concatenated; the cost of a concatenation is the sum of its costs. The two routes from X through Y to Z therefore cost 3 and 6.
A second account keeps only whether travel between endpoints is possible. Both X-to-Y routes become the answer “yes”. Joining that answer to Y-to-Z reachability gives “yes” for X-to-Z. This account answers whether travel is possible. It cannot give the cost of the route actually taken: p followed by r and q followed by r have the same reachability summary and different costs.
A third account keeps minimum costs. For finite nonempty sets of allowed first and second segments, assume every first segment can be followed by every second segment and costs add. Then the least combined cost is the sum of the two least costs. Every combined cost is at least that sum, and combining the two minimizing segments attains it. Here the answer is 1 + 2 = 3. The calculation can therefore answer the minimum-cost question without retaining every route. Choosing an actual route also requires the minimizing segments to be recoverable.
Now change the allowed combinations. Let the second segments be r with cost 2 and s with cost 10. Only p followed by s, and q followed by r, are allowed. The true minimum is min(1 + 10, 4 + 2) = 6. Independently minimizing the two stages gives 3, which no allowed route attains. The failure is the omitted compatibility relation. Retain the incoming-route distinction or calculate over the allowed pairs.
The comparison yields three useful accounts with different retained information. Its changed case also identifies a condition for the minimum-cost composition rule. No physical interpretation is needed for this mathematical result. Using cost as travel time or expenditure adds the corresponding interpretation and additivity conditions.
B.5.TC:5.2 - The same oscillator, different formulation and computation
Consider an ideal one-dimensional mass on a linear spring, with mass m > 0, spring constant k > 0, displacement q and velocity v. Friction and external forcing are absent. The question is its motion from q(0) = a and v(0) = 0.
The force account gives m q’’ = -k q. The variational account uses L(q,v) = m v²/2 - k q²/2. Its Euler-Lagrange equation is d/dt(∂L/∂v) - ∂L/∂q = 0; substitution gives m q’’ + k q = 0. Both therefore give q(t) = a cos(√(k/m) t) under these premises. For this motion question, the two constructions agree. The variational formulation can become preferable when another coordinate choice simplifies constraints; the force formulation may be the quicker account for this simple case.
Suppose a computation appears to disagree. Take m = k = a = 1 and use the forward Euler updates q_next = q + h v and v_next = v - h q. From q = 1, v = 0 and h = 0.1, it returns q_next = 1, v_next = -0.1. The energy (q² + v²)/2 rises from 0.5 to 0.505. In fact these updates multiply energy by 1 + h² at each step, whereas the differential equation conserves it.
The discrepancy is produced by the approximation used in the computation. Compare an adequate step size or another numerical method under C.29.2 for the requested horizon and error. If the real oscillator loses energy, examine friction and other physical interactions; that changes the model question. The equality of the two ideal derivations remains available within its premises.
B.5.TC:5.3 - Agreement in observation, disagreement under intervention
An indicator X and an output Y always follow a binary controller command U. Two causal hypotheses explain the observed pairs: A uses X := U and Y := X; B uses X := U and Y := U. In A, the indicator drives the output. In B, the controller drives both directly. Both yield X = Y = U in ordinary operation.
The question is now what happens when X is forced to 1 while U remains 0. Represent this intervention by replacing the assignment to X. A gives Y = 1; B gives Y = 0. The same observed pairs leave that difference unresolved.
The next contribution could be the circuit description, an already available intervention result or a worthwhile discriminating test. If the work only predicts the observed indicator from U in unchanged operation, this causal difference need not be settled for that use. If it proposes controlling Y through X, retain the unresolved consequence until the needed causal premise is supplied. C.28 governs that intervention claim.
B.5.TC:6 - Bias-Annotation
A shared question can favor the account that originally framed it. Retain a rival’s newly expressible question when it opens useful inquiry; compare that contribution on its own terms. Conversely, unfamiliar notation can make an ordinary operation appear novel. Recover the operation before crediting or rejecting the account.
The cases use small formal constructions so their decisive steps can be inspected. They demonstrate the comparison method, with domain premises stated in each case. A difficult real application can need specialist knowledge, uncertain premises and more than one iteration. Human, AI and collective contributions can participate in the comparison; claims about their learning or reliability require their own basis.
B.5.TC:7 - Conformance Checklist
- The comparison names a working question and explains what its answer changes.
- Each application has recoverable meanings, inputs, premises, decisive operations and an interpreted answer.
- The shared case corresponds across accounts; a missing correspondence remains visible.
- Agreement or disagreement is traced to the relevant question, premise, operation, inference, implementation or physical account.
- The conclusion has the scope established by its derivation, cases and applicable evidence.
- A sufficient cheaper account, complementary use or useful conditional result remains selectable.
- Further inquiry has a consequence for the intended use that can justify its burden.
- The result states the next use and the change that would reopen the comparison.
B.5.TC:8 - Common Anti-Patterns and How to Avoid Them
| Failure | Repair |
|---|---|
| Comparing unlike outputs as rivals: reachability and minimum cost are both called a route answer. | State the question each answers, then construct the common question or their complementary use. |
| Identifying theoretical accounts because a fitted case gives the same number. | Compare the meanings and decisive operations; derive the range of agreement when a broader claim is needed. |
| Treating a numerical discrepancy as a physical-theory disagreement. | Recover the formulation and approximation, as in the oscillator case, before changing the physical account. |
| Selecting a more elaborate account for capabilities the present question does not use. | Compare the adequate answers and their burdens; retain the further capability for the question that needs it. |
| Seeking more observations to resolve a difference that ordinary observations cannot distinguish. | Derive the discriminating consequence and use the relevant causal or other domain method; retain an unresolved difference when further inquiry is unavailable or unwarranted. |
B.5.TC:9 - Consequences
The practitioner gains a reasoned division of use between accounts, or a located disagreement that can guide the next inquiry. That result also supports collaboration: contributors can work on the missing mathematical operation, physical premise or computational approximation instead of repeating the whole dispute.
Reconstruction costs effort. Reuse an applicable comparison and stop at the explanation needed for the work. A comparison remains dependent on its question and premises; a changed use can make previously irrelevant distinctions decisive.
B.5.TC:10 - Architectural Rationale
The unit of comparison is an application because a theory’s objects alone leave its useful inference undetermined. Reconstructing that inference makes differences in representation, premises and operations comparable without first imposing a common ontology on every source concept.
Working a shared case provides a place to connect the accounts. Following the dependency that causes a difference then supports a broader argument or a discriminating example. These operations complement one another: a derivation establishes scope, while an example can reveal that the chosen scope misses the work’s question.
Separating agreement, complementary use and unresolved difference keeps the result productive. An account may remain preferable for a cheap prediction and insufficient for an intervention. Another may be harder to use now yet expose a construction worth developing. This preserves the connection between obtaining knowledge, applying it and improving the available ways of inquiry.
B.5.TC:11 - SoTA-Echoing
For comparing what different mathematical accounts let a practitioner compute, adopt the operation-based comparison illustrated by Fong and Spivak’s Seven Sketches in Compositionality (2019), §2.5.2–§2.5.3. Reachability and cost use different operations for combining steps and choosing among alternatives. Against comparison by shared route terminology, this makes the lost answer and composition condition visible in :4.3 and :5.1. The finite compatibility example is a construction here. Reopen its application when the quantity or allowed composition changes. Author manuscript.
For physical formulations that may agree, adopt the constructive comparison in Sussman and Wisdom’s Structure and Interpretation of Classical Mechanics, second edition (2015), §1.6: derive the equations under the stated force and potential assumptions. This answers more than a numerical fit and often costs less than a new simulation. Against selecting a formulation solely by familiarity, preserve the advantage of coordinates adapted to constraints. Sections :4.3–:4.4 and :5.2 separate that choice from numerical approximation. Reopen when interactions, constraints or the requested result change. Publisher’s text.
For comparing causal uses, adopt intervention construction from Pearl’s Causal inference in statistics: An overview (2009), §3.2.1, and adapt it here to expose the particular consequence on which two accounts disagree. Agreement in the observed distribution, a serious comparator for prediction, can leave that intervention consequence undecided. This changes :4.4 and :5.3. C.28 supplies the broader causal method. Reopen when the causal premises or intended intervention change. Author’s paper.
For prediction, a serious alternative to choosing a single account is combining predictive distributions. Yao, Vehtari, Simpson and Gelman’s stacking method (2018) chooses weights through predictive performance when the candidate set need not contain the data-generating model. Adapt that question-relative choice into :4.5’s permission to retain combinations. Reject using such predictive weights as a verdict about causal mechanism or mathematical equivalence; those are different comparison questions. The statistical method remains with its domain, including its scoring and validation conditions. Reopen when prediction under another distribution or a different use is required. Authors’ paper.
This pattern combines these constructive contributions into a common comparison method. Its first result is the comparison obtained under the stated conditions.
B.5.TC:12 - Relations
- B.5 coordinates the reasoning cycle and return to a changed question. B.5.TU, B.5.RC and B.5.RA recover an application, construction or argument; B.5.RR revises the affected reasoning.
- C.29 selects mathematical lens use; C.29.1 constructs the correspondence needed to transfer a result. C.29.2 and C.29.3 separate computational formulation from physical execution.
- B.5.MPC connects mathematical, physical and computational contributions. C.28 governs causal and intervention claims.
- C.38 constructs comparable ways to obtain one result. This pattern supplies a theoretical comparison when such a way depends on an unsettled account. C.11 and C.11.DUA govern a consequential choice and the worth of further inquiry.
- F.0.2 uses a comparison of accounts when forming a semantic synthesis across sources. A.6.3.RT supports operative expression, and A.15.9 obtains a missing specialist contribution.
B.5.TC:End
B.5.QD - Develop a New Question from a Result or Construction
Type: Method-description pattern Status: Stable Normativity: Normative unless marked informative
B.5.QD:1 - Problem frame
Use this when a result, counterexample or newly available construction changes what you could usefully investigate, but the next question is still unclear. A failed conjecture may reveal a missing condition. A successful calculation may supply an operation that makes a previously impractical question approachable. The work is to turn that change into a question you can begin to answer.
First useful move. Recover the step at which the earlier reasoning failed, or the operation that has become available. Ask what it now lets you distinguish, construct, explain or change. For example, a triangle refutes the claim that every connected graph can be divided into two groups with every edge crossing between groups. It also suggests asking for a construction that returns either the division or an obstruction.
The result is a question with an understood answer form, a useful first attempt and a reason to pursue or retain it. The answer may support further theory, a different investigation or an action in the world. Developing a concept or a reusable operation can be that contribution even before its eventual applications are known.
Use an already adequate question directly. If the question is clear and the missing contribution is a way to answer it, C.39 supplies that search. This pattern is useful when the result sought or the question’s conditions themselves need to be developed.
B.5.QD:2 - Problem
“Find the next interesting problem” leaves the crucial work undone. Many variations merely change a number or a name. Others repeat a failed claim with a convenient exception, ask for information the available description cannot determine, or generate questions whose answers would add nothing to the inquiry.
A useful next question grows from a consequential change: an exposed dependency, a new object or operation, a newly distinguished case, or a result that can be used elsewhere. The difficulty is to construct that question while preserving what the earlier work established and keeping a feasible point of entry.
B.5.QD:3 - Forces
| Force | Working tension |
|---|---|
| Continuity and novelty | Earlier reasoning supplies operations worth retaining; its original question can also hide the next useful distinction. |
| Refutation and recovery | A counterexample can invalidate a broad claim while leaving much of its construction available. |
| Reach and tractability | A question can open a valuable field while its first attack must fit the contributors and means available. |
| Exploration and present use | Some contributions have an immediate application; others make new questions or operations possible. |
| Variety and attention | Several alternatives can reveal a better question, while indiscriminate generation consumes the effort needed to work one. |
B.5.QD:4 - Solution
Recover what changed → locate the dependency or new operation → construct a consequential question → work a revealing case → choose the next inquiry and keep what remains useful.
Enter with the result that actually changed the inquiry. Reuse a known formulation or derivation when it already supplies the needed step. Return to an earlier step if an attempted answer reveals that the question is ambiguous, underdetermined or more expensive than its use warrants.
B.5.QD:4.1 - Recover the contribution of the earlier work
State the earlier question and what the work actually obtained. Identify the part that matters now: a counterexample, an unresolved inference, a constructed object, a computational operation or a distinction the earlier description omitted.
For a failure, locate its scope. A counterexample to a lemma can expose a defect in one argument while leaving the main conjecture undecided. A counterexample satisfying the main conjecture’s premises refutes that conjecture. A program’s failure on a case may instead concern its implementation. Recover the relevant reasoning under B.5.RA or B.5.RR when this difference is unclear.
For a success, recover what can now be done with the result. Explain its inputs, output and application conditions. A computation that produces cumulative totals, for example, may provide a way to answer many interval questions. Its reusable contribution is the relation between those totals and the intervals.
Keep independently supported results available. They can supply the construction, limiting case or partial answer for the next question.
B.5.QD:4.2 - Find the relation that can change the question
Follow the earlier result back to a consequential dependency, or forward to an operation it enables.
If a description gives the same information for cases that need different answers, construct two such cases. Their difference identifies information a stronger question may need. If an inference depends on an unproved step, state the missing step as a possible question. If an operation succeeds, ask which other inputs, outputs or combinations preserve its useful relation.
Use variations that have a reason in the work. The following are common ways to construct them.
| What the work reveals | How to form the next question |
|---|---|
| A counterexample identifies a failed condition. | Ask which condition would support the needed conclusion, or which construction identifies the cases where it fails. |
| A successful construction produces more information than the first answer used. | Ask what further result can be obtained from that information and by which operation. |
| Different cases collapse to one description. | Ask what additional distinction determines the answer, or what bound remains possible without it. |
| An argument needs an unavailable intermediate result. | Ask for a lemma, witness or construction that supplies that step; state how it would be used. |
| A familiar operation becomes available in another setting. | Ask whether its required relations hold there and what receiving task it can now serve. |
A variation can change the original task. Preserve that change explicitly: restricting a claim to trees may give a valid result while leaving the original request about all graphs unanswered. If the broader request still matters, keep it as an unresolved question.
These variations can be combined or repeated. Their purpose is to expose a useful answer, not to fill a catalogue of question types.
When requirements appear incompatible, B.5.QD.CF recovers the premises producing the conflict and asks what other construction could satisfy the retained need. It distinguishes changing an assumed means or representation from changing a requirement, and can return a useful impossibility when the conditions must remain.
B.5.QD:4.3 - Give the new question an answer form
Say what would answer the question: for example, a construction, an explanatory relation, a bound, a counterexample or a condition under which an operation works. State the objects, allowed changes and premises that can alter the answer.
Connect that answer to its possible use. “Find a partition” and “return a partition or an odd-cycle witness” make different contributions: the second also explains failure. “Predict the position” and “bound the reachable positions” may serve the same present decision at different effort.
Separate a proposed answer from the question. “Does this procedure always terminate on finite inputs?” remains a useful question when the proposed positive answer is false. The failing case can open the question of a termination condition or another procedure.
If a question combines several missing contributions, make the dependency visible. For a physical calculation, you may first need a model that determines a quantity, then a computation of that model, then an interpretation for action. B.5.MPC coordinates those contributions. Name the first unresolved connection so a person, AI agent or group can work on it using the available subject knowledge and tools.
B.5.QD:4.4 - Work a case that reveals the difficulty
Choose a small case that exercises the changed condition or new operation. Attempt the requested construction or inference and explain where it succeeds or stops.
Use the result to improve the question. A successful case can expose a reusable relation. A failed case can identify a missing premise, an incompatible demand or an operation still to be developed. If two admissible cases give different answers from the same supplied information, ask for the missing distinction or a result valid for both.
A case establishes its own result. A broader mathematical claim needs its derivation, and applying a physical model needs the relevant physical basis. The question can already be useful before those answers are established: the first attempt should make the next contribution more identifiable.
Begin with available reasoning and information. Obtain further evidence only when its possible answers can change the useful inquiry enough to justify the effort under C.11.DUA. An existing bound or conditional answer may settle the current use.
B.5.QD:4.5 - Choose an attainable inquiry
Compare the few questions that remain serious candidates. Ask what each answer would enable and where work could begin with the available capabilities, collaborators and resources. Include the cost of learning or obtaining a missing operation when it affects the choice.
A worthwhile first question may be narrower than the eventual aim: establish a limiting case, find one witness, recover a missing lemma or test a proposed connection. Explain how that result would contribute to the larger question. If the contribution is already available, use it and select the next unresolved step.
E.10.INT helps distinguish useful interest from novelty, surprise or a local scoring heuristic. A question can be worth pursuing because it opens further constructions, changes what can be explained or makes another question approachable. Its eventual practical destination may remain unknown. When problems and ways of solving them must develop together, use C.40; retain a promising alternative when its prospective use justifies doing so.
Continue with the chosen question, its first attempt and the dependency that attempt is meant to resolve. A short explanation in the work can carry this result. Stop when the current need is answered, or when another inquiry is the better use of the available effort.
B.5.QD:4.6 - Separate question recognition from answer assurance
Recognize the opening from a changed possibility of inquiry. One worked counterexample or a useful new operation can be sufficient to begin developing the question.
Judge the question by whether it has a recoverable meaning, a possible contribution and a workable point of entry. Judge its proposed answer by the claim it makes. A conjecture, a proven relation, a simulated result and an observed physical effect support different uses. Apply their subject Methods and B.3 when the receiving use needs that assurance.
Reuse the question while its purpose and conditions remain applicable. Reopen it when a result changes its premises, available operations, attainable scope or intended use. A solved question can open another valuable one; an adequate answer can also end the present work.
B.5.QD:5 - Archetypal Grounding
B.5.QD:5.1 - From a false graph claim to a construction or obstruction
An engineer represents pairwise incompatibilities by a finite simple undirected graph. The proposed claim is that connectedness suffices to divide the vertices into two groups so every edge crosses between groups.
A triangle refutes the claim. Assign A to the first group and its neighbour B to the second. The third vertex C is adjacent to both, so neither group is available. The failure concerns the universal claim, not the ability to divide any graph: a four-vertex cycle A-B-C-D-A admits groups {A,C} and {B,D}.
Follow the failed operation. Along a path, successive vertices can alternate between the two groups. Returning around an odd cycle forces its final edge to join vertices assigned to the same group. That identifies an obstruction worth seeking.
The next question is: For a given finite simple undirected graph, can we construct the division or return an odd cycle that explains why it is impossible? The answer form now serves both allocation and diagnosis.
B.5:5.1 supplies the broader construction. Traverse each component by breadth-first search and assign groups by even or odd depth. If every edge joins opposite parities, the assignment works. An edge joining equal parities combines with the two parent paths up to their last shared vertex to give a simple odd cycle. The construction therefore answers the new question for the stated graph class.
The earlier connectedness requirement can be dropped: work through each component, including isolated vertices. For a real allocation, establish that the graph represents the relevant pairwise incompatibilities. Three-way constraints would change that application question.
B.5.QD:5.2 - From a position to a sufficient state or useful bound
A model describes a point moving along one line in an inertial frame. During the next two seconds there is no net force; use the classical relation q(t) = q(0) + v(0)t. The supplied position is q(0) = 0. Someone asks where the point will be two seconds later.
Construct two cases allowed by this description. With v(0) = +1 metre per second, q(2) = +2 metres. With v(0) = -1 metre per second, q(2) = -2 metres. Position alone leaves the requested answer undetermined.
One next question is what information completes the state for this prediction? Under this model, initial velocity together with position suffices. Obtaining velocity could use an already available displacement over a known interval of constant velocity. A.3.3 and C.16 develop state and measurement when those contributions are needed.
Another question is cheaper if the current decision only asks whether the point stays within three metres of its starting position for the next two seconds. Suppose the available information bounds the initial velocity between -1 and +1 metre per second. Then the displacement magnitude is at most (1 metre per second)t throughout that interval, so the point stays within two metres. The bound answers the decision without acquiring a more specific velocity.
The two questions support different uses. If an actuator must meet the point at a specified position, the bound can be insufficient and the state question becomes useful. If the net force becomes nonzero during the interval, revise the model and its prediction. The construction of the question has located the relevant missing contribution in each case.
B.5.QD:5.3 - A successful cumulative computation opens an interval question
A program can construct cumulative totals for an integer array a. It starts with S[0] = 0 and sets S[i+1] = S[i] + a[i]. For a = [2,-1,3,4], the result is S = [0,2,1,4,8].
The original task needed the total 8. Recovering the operation reveals that each S[i] already gives the sum before position i. This opens the question: Can we answer many interval-sum queries from the same cumulative totals?
Specify an interval by indices l and r, with 0 ≤ l ≤ r ≤ n; it includes l and ends just before r. Splitting the first r elements at l gives S[r] = S[l] + sum(a[l],…,a[r-1]). Hence the interval sum is S[r] - S[l]. For the last two elements, l = 2 and r = 4, so the answer is 8 - 1 = 7. For l = r the answer is 0.
This is a general derivation under integer arithmetic with enough capacity to avoid overflow. Each query uses two stored totals and one subtraction after the array has been prepared. Whether preparation is worthwhile depends on how many queries and changes the application requires.
If a[i] changes by d, every S[j] with j > i changes by d. Frequent changes therefore open a further question: which data organization supports the required mixture of updates and interval queries? That question can be developed when the workload makes it relevant. The successful cumulative operation already answers the unchanged-array question.
B.5.QD:6 - Bias-Annotation
The original formulation can anchor subsequent questions. Recovering its failed condition or unused operation helps reveal alternatives, but the new question should still explain what it contributes. A more familiar or easier formulation can silently abandon the unresolved use.
Mathematical search often favors statements that can be proved. Question development also benefits from locating a false conjecture, an underdetermined description or a construction that cannot meet its conditions. Their usefulness comes from the inquiry they enable.
B.5.QD:7 - Conformance Checklist
- The earlier work and its consequential result are recoverable.
- A failure is located at the claim, premise, inference or implementation it affects; a success exposes its reusable operation or relation.
- The new question states an answer form and the conditions needed to understand it.
- A changed formulation preserves the still-unanswered part of the earlier task when that part remains useful.
- A worked attempt reveals a consequence, a missing distinction or the operation to obtain next.
- The question’s possible contribution and its attainable first step justify pursuing or retaining it.
- The proposed answer is used with the scope and support appropriate to its claim.
- Further work can stop when an available answer suffices; explanations and records are only as extensive as their receiving use requires.
B.5.QD:8 - Common Anti-Patterns and How to Avoid Them
| Failure | Repair |
|---|---|
| Appending exceptions until a refuted claim survives, while losing the original use. | Follow the counterexample’s failed relation; formulate the condition or obstruction that helps answer the working question. |
| Treating a failed lemma as a refutation of the main conjecture. | Recover which argument used the lemma and what remains undecided; investigate an alternative step where useful. |
| Generating many syntactic variants and counting them as progress. | Work a variation that changes an available construction, an answer or a useful distinction. |
| Asking for a unique prediction from information shared by physically different continuations. | Exhibit the differing cases; obtain sufficient state information or return a useful bound. |
| Discarding a successful operation after it gives the requested number. | Recover its relation to inputs and outputs when another use could benefit, as with cumulative totals. |
| Making proof of eventual usefulness a prerequisite for exploration. | Identify the nearer inquiry or construction the question can enable and compare that contribution with its present cost. |
B.5.QD:9 - Consequences
Question development turns both failure and success into possible further work. It can preserve a useful construction, make a missing premise investigable or reveal a result that serves another practice. Contributors can divide the work around those identified dependencies.
There is a cost to opening alternatives. A few consequential variations and a revealing attempt often suffice. Some questions remain worth keeping until a needed operation, collaborator or use becomes available; others can be set aside after their first attempt shows little prospective contribution.
B.5.QD:10 - Architectural Rationale
A new question needs an operation of construction. The instruction to find an interesting question becomes usable when it points to a dependency that failed or an operation that became available. This also connects developing a theory with applying it: an application can expose a new question, and a theoretical construction can create an application that could not previously be attempted.
The answer form matters because it determines what work counts as progress. A witness of impossibility can be as useful as a successful construction for deciding an allocation. A bound can answer an operational question while a unique prediction remains unavailable. These alternatives are obtained by examining the earlier result and its use.
The small case and the broader question develop together. Working the case tests whether the question identifies a real difference; stating the broader question prevents the case from becoming the only thing learned. Retaining unaffected results makes this development cumulative.
Practical interest includes opening future inquiry. The method asks for the next intelligible contribution while leaving later uses open.
B.5.QD:11 - SoTA-Echoing
For developing a question after a failed proof or conjecture, adapt Lakatos’s proof-analysis method in Proofs and Refutations (I) (1963), §3 and the beginning of §4. Distinguishing a counterexample to a lemma from one to the main conjecture preserves recoverable reasoning; asking for the missing construction improves on protecting the claim by convenient restrictions alone. Sections :4.1–:4.3 and :5.1 use that contribution. The historical dialogue supplies a method of criticism and question change; the resulting mathematical claims still need their own arguments. Reopen the choice when a different failure prevents recovery of the consequential dependency. Original article.
For obtaining questions from either an unfinished proof or available constructions, adapt the distinction between goal-directed lemma discovery and bottom-up theory exploration in Zhang and Tan’s Automated Conjecturing and Theorem Finding: A Survey (2026), §§3 and 5. The two approaches support different entries in :4.2. The surveyed filters for false, redundant or uninteresting conjectures help theorem search; using those filters as a general question filter would discard a useful counterexample. Section :4.3 instead evaluates the question’s contribution separately from a proposed answer’s truth. Syntactic complexity and proof-related scores remain local heuristics. Reopen when a stronger generation method offers more useful questions at comparable effort for the receiving practice. Survey.
For finding further uses of a successful operation, adopt Blelloch’s constructive treatment of all-prefix-sums in Prefix Sums and Their Applications (1993), §1.1. It exposes an operation and its application conditions, improving on retaining only a program’s final answer. Section :5.3 uses cumulative addition to develop an interval question; its range-sum derivation is worked here. Prefix operations over other associative operators can serve other questions, but subtraction requires the additional algebraic structure used in this example. The source’s parallel implementations are separate Methods. Reopen when the operations, numeric semantics or workload change. Author’s chapter.
For questions beyond a fixed objective, adapt Wang et al.‘s Enhanced POET (2020), §§2–3, through C.40’s coupled development of problems and ways. Relative difficulty and transfer can make a question worth retaining even when it is poorly served by the present best method. Against requiring an already known route to a final objective, :4.5 keeps a useful nearer contribution and examines its cost. The reported computational environments demonstrate that search approach under their conditions; they do not establish a universal measure of interest or development. E.10.INT supplies the broader distinction. Reopen when retained questions cease to enable useful transfer or the contributors’ capabilities change. Paper.
B.5.QD:12 - Relations
- B.5 coordinates the reasoning cycle. B.5.RA recovers an argument; B.5.RR revises reasoning after a premise or question changes. This pattern constructs a question that can start that revision.
- B.5.TC can reveal a newly expressible question when comparing accounts. B.5.2 generates candidate explanations once that is the needed contribution.
- B.5.MPC connects the physical, mathematical and computational contributions a question needs. A.3.3, C.16 and C.29.2 supply state, measurement and computational-formulation work where applicable.
- C.39 obtains a missing way to produce a distinguished result. C.40 develops problems and ways together; this pattern contributes the question-construction step.
- C.22.2 describes a problem claim when that description is needed. E.10.INT, C.11 and C.11.DUA help choose a worthwhile inquiry and the effort to spend.
- C.36.RP supports continuing a shared practice by recovering and changing its ways of inquiry. A.15.9 helps obtain and use a bounded contribution from another practice when needed.
B.5.QD:End
B.5.QD.CF - Reformulate a Problem by Examining Its Conflicting Assumptions
Type: Method pattern Status: Stable Normativity: Normative
B.5.QD.CF:1 - Problem frame
Use this when an account makes needed outcomes appear incompatible and you need to find what could change without losing the purpose of the work. Two requirements may concern different operating conditions, yet the model gives them one setting. A familiar means of obtaining one result may obstruct another result, although that means has never been shown necessary.
First useful move. Put the two demands beside the statement that makes them conflict. Ask what requires that statement. For example, “the setting must be at least 6 during work and at most 2 during quiet operation” conflicts with a fixed-setting design. It leaves open a question about changing the setting between those conditions.
The result is a reformulated question or candidate construction whose retained requirements, changed premise and remaining obstacle are understood. Sometimes the useful result is an impossibility under the retained conditions, followed by a decision about which requirement can change.
The reader needs enough knowledge to interpret the requirements and the inference connecting them, or access to someone who can supply that interpretation. Start with ordinary statements and a small case. Use an adequate existing solution directly. If the only unresolved question is choosing an accepted trade-off, compare the options; recovering premises is useful when it could reveal another option or change the grounds for that choice.
B.5.QD.CF:2 - Problem
An incompatibility identifies a limit of the statements used together. It does not yet identify the repair. A requirement may have been mistaken for a particular means, two situations may have been collapsed into one, or the desired result may be impossible under conditions that must remain.
Two shortcuts lose the useful question. Continuing with the same proposed means can make an avoidable conflict look inevitable. Relaxing a condition until the account has a solution can make a different task look like a solution of the original one.
The work is to reconstruct why the conflict follows, find a consequential premise worth examining, and develop another construction or an honest limit while keeping the original need recoverable.
B.5.QD.CF:3 - Forces
| Force | Working tension |
|---|---|
| Needed outcome and familiar means | A proven way is valuable, but familiarity can conceal an unsupported necessity claim. |
| Clear conflict and hidden conditions | A small conflicting set is easier to inspect; other requirements can still defeat its proposed repair. |
| Exploration and commitment | A temporary relaxation can reveal a possibility before anyone has the means or authority to realize it. |
| Precision and effort | A formal construction can settle a consequential inference; ordinary reasoning may already locate the question. |
| Continuity and change | A narrower question may produce useful work while leaving the original need partly unanswered. |
B.5.QD.CF:4 - Solution
Recover the need and the conflict → expose the premises producing it → examine an assumed necessity or shared condition → construct another question or way → return to the retained requirements.
Enter at the unresolved step. A short explanation beside the working model can carry the result; no separate conflict form is required.
B.5.QD.CF:4.1 - State what must be obtained and where the conflict arises
Say what result is needed, for whom or for what later operation, and under which conditions. Separate that result from the proposed means of obtaining it. Keep a requirement that the work cannot change visible throughout the attempt.
Recover the incompatibility in its stated scope. Two propositions may contradict each other under one interpretation. Two physical operations may compete for the same resource at the same time. Two people may disagree about a premise or about which outcome matters. A trade-off may permit both outcomes to some degree. These situations require different reasoning; use this method where examining the asserted incompatibility can change the construction question.
Identify the participants and conditions shared by the conflicting statements. Does “the setting” mean the same setting in the same operating condition? Does “available” refer to immediate access or access after a permitted delay? B.5.FM helps construct a missing distinction; B.5.TC compares different accounts when their questions or output meanings are unsettled.
B.5.QD.CF:4.2 - Recover the inference and the status of its premises
Work backward from the conflict to the statements that produce it. Use B.5.RA if the argument needs reconstruction. Keep their different roles understandable: what the work requests, what was observed, what the model assumes, and which proposed operation is supposed to supply a result.
Pay attention to necessity. “To obtain A, D is necessary” means A implies D. “Doing D under conditions K obtains A” is a sufficiency claim. Success with D alone supplies no argument that every way of obtaining A requires D. The question may be whether another operation E obtains A while avoiding the condition that obstructs the other requirement.
A small set of jointly conflicting statements is often sufficient. For a finite constraint account, one can hold the requirements fixed and examine what happens when one assumption is omitted. A remaining solution identifies a candidate assumption to examine; it does not establish that the assumption is false or dispensable in the intended work.
Find a minimal conflicting set only when the smaller explanation changes the task. “Subset-minimal” means that removing any member of that set removes its inconsistency. It does not mean that the set is the smallest possible, that repairing it is cheapest, or that no other conflict remains outside it.
B.5.QD.CF:4.3 - Turn the consequential premise into a constructive question
Choose a premise whose change could matter and whose status is open to examination. Work the corresponding question:
- An assumed necessary means creates the conflict. What operation could obtain the needed outcome without that means? Follow the result that the means supplied; use C.39 to find or develop a replacement operation.
- One value is imposed across different conditions. Do the requirements concern distinguishable participants, times or situations? If so, what construction permits the required values in those conditions? If they concern the same participant and condition, a second name supplies no new possibility.
- A restriction belongs to the present representation or construction. What relation must a different representation or construction preserve, and how could it satisfy the retained requirements? B.5.FM constructs the relation; B.5.RR carries its change through the affected reasoning.
These are common entries, not an exhaustive set of creative moves. State what would answer the selected question: an alternative operation, a condition-dependent construction, a counterexample to necessity, or a derivation of impossibility.
A tentative assumption change lets you explore that question. Keep the conclusion conditional until the replacement premise or operation has the support its use needs. Reconsider a requirement explicitly when that is the selected change; a convenient answer to the changed requirement leaves the original one open.
B.5.QD.CF:4.4 - Construct a small answer and return it to the whole need
Perform the relevant reasoning or operation on a case that includes the changed condition. Show how the candidate obtains the needed result, or locate the contribution still unavailable. A formal witness answers a question about its model. A physical or organizational proposal also needs the means to produce the corresponding result in its intended setting.
Reapply every retained requirement that the proposed change can affect, including those outside the small set used to locate the conflict. A separate operating setting may require a transition that is too slow. An archived input may reproduce a calculation while violating a retained deletion requirement. Either consequence changes what the candidate can answer.
Keep three facts distinguishable: the revised statements are compatible; an operation is proposed that would supply their values; that operation has produced or otherwise established the result required for this use. Use the strongest available fact the current question needs. An inquiry about what to design next may be answered by a conditional construction; deploying it can require further work.
If the conditions remain incompatible, state that result under the premises that support it. The next question can ask which requirement may change, whether another model is warranted, or whether the work should stop. A proof of impossibility can settle a construction request without finding a replacement.
B.5.QD.CF:4.5 - Continue at the missing contribution, or use the answer
Use a sufficient answer. Otherwise say which part of the original need remains and what the next attainable result would change. B.5.QD develops that question; C.40.CD connects it with development of a way to answer it. A theoretical result can be worth pursuing because it makes further constructions or explanations possible, even before a particular application is known.
Compare the likely contribution of further work with its burden, including obtaining a capability or resource and the work displaced. Start with available arguments, results and specialist contributions. C.11.DUA applies when the worth of another information-gathering step is unsettled. The pattern requires no experiment merely to acknowledge that a proposal remains conditional.
Several contributors can divide this work by the result needed next: one recovers the disputed necessity, another constructs a replacement, and another interprets its consequences for the original work. They need the retained requirements and the meaning of each returned result. When this reasoning is a constituent of design or research, its local success must support the encompassing method’s result; compatibility alone may be insufficient for that result. Constituent and encompassing methods can be enacted during the same work under B.1.5.
B.5.QD.CF:4.6 - Separate recognition from assurance
An asserted conflict and a premise worth examining can be enough to start. Recognition does not require an exhaustive diagnosis or a proof that a repair exists.
Judge each resulting claim by what it says. An implication needs valid reasoning under its premises. A replacement operation needs the mathematical, physical or professional basis appropriate to its intended use. A requirement change needs the decision that permits it. The method supplies a way to find and formulate these questions; their answers come from the corresponding subject methods.
Reopen the result when a retained requirement, affected premise, available operation or intended use changes. Preserve independently usable parts while revising the affected inference.
B.5.QD.CF:5 - Archetypal Grounding
The following constructed cases supply the conditions needed for their reasoning. They demonstrate different reformulations and a case in which the original demand remains impossible.
B.5.QD.CF:5.1 - Distinguish operating conditions without inventing a machine
A proposed device has one fixed setting p. The task requires p to be at least 6 during work and at most 2 during quiet operation. In the proposed design, both requirements constrain the same fixed value; no such value exists.
Recover the extra premise: the setting is fixed across those operating conditions. Let p_work and p_quiet describe the two values. The account is:
- p_work ≥ 6;
- p_quiet ≤ 2;
- p_work = p_quiet.
Keeping the two requirements and reconsidering the equality produces a construction question: Can the device select different settings in the two distinguishable conditions? The values (6,2) satisfy the revised inequalities. They identify what a switching construction would have to supply.
That answer is conditional. The device must be able to recognize the condition and reach the required setting in time, using the resources permitted by the task. If a transition takes three seconds while the retained requirement allows one second, this proposed transition fails. A faster operation, another construction or an authorized requirement change is still needed.
If instead both inequalities concern the same operation at the same time, separating their names would misrepresent the task. The inequality 6 ≤ p ≤ 2 remains impossible. The useful result then identifies the requirements that cannot both be retained.
B.5.QD.CF:5.2 - Replace an assumed means while retaining two outcomes
A team must reproduce an earlier calculation and use new prices for new calculations. A current file stores the quantity 3 and the price 10, so the earlier result is 30. Tomorrow the price becomes 12 and the new result must be 36.
The proposed practice keeps only one mutable price value. Reproducing the earlier result is taken to require keeping that value at 10; obtaining the new result requires changing it to 12. The conflict depends on that proposed means of recovering the earlier input.
Ask instead: What information and operation reproduce the earlier calculation without freezing the current price? For this case, the calculation is quantity times price. Retaining the input pair (3,10), the multiplication rule and the identity of the earlier calculation supplies its result 30. The current pair (3,12) supplies 36. A versioned input or a retained calculation record can therefore replace the supposed need for one unchanged current value.
The scope matters. This construction suffices for the supplied arithmetic question. If the earlier result used a rounding rule, exchange rate or other input, that contribution must also remain recoverable. A claim about who approved the transaction asks another question and is not established by recomputing 30.
Now change the retained requirements: every copy of the earlier price must be destroyed, and no equivalent information may remain, but the system must later recover that price uniquely. The retained-input proposal violates the deletion requirement. The conflict has not been repaired under these new conditions. The next case isolates why this stronger combination can be impossible.
B.5.QD.CF:5.3 - Return an impossibility instead of hiding retained information
A device receives one bit x, either 0 or 1. Complete erasure in this formal task means that, afterward, its entire accessible state is the same s for both inputs; there is no external record or later input revealing x. A deterministic operation g must then recover the original bit for either input.
For the input 0, recovery requires g(s)=0. For the input 1, it requires g(s)=1. The same operation on the same state cannot satisfy both. The required erasure and universal recovery are incompatible under the supplied model.
An external copy or a different final state would allow other constructions, but each changes the complete-erasure condition. Renaming an external copy as a pointer preserves information rather than meeting that condition. Returning a default value changes the recovery requirement. Neither is a solution to the original task.
The result can already end the construction search under these premises. If the work instead permits a retained distinction, develop that changed question explicitly. A later physical implementation also has a physical model and its own scope; the argument here establishes the finite information constraint stated above.
B.5.QD.CF:6 - Bias-Annotation
The familiar means can dominate the description of a need. Recovering the result it supplies helps make a replacement thinkable. Conversely, a wish for a harmonious answer can lead the practitioner to relax the very condition that mattered. Returning to all retained requirements exposes that loss.
The easiest premise to remove may be the one with the strongest physical or practical basis. Diagnose its role without treating mathematical removability as permission to discard it. People and AI agents can both produce a coherent reformulation that solves a different problem.
B.5.QD.CF:7 - Conformance Checklist
- The needed result and the scope of the incompatibility are recoverable.
- The inference distinguishes requirements, observations, modeling assumptions and proposed means where their different roles change the answer.
- A claimed necessity has its direction and basis; a proposed replacement supplies the result previously attributed to that means.
- A changed participant or condition corresponds to the intended situation, rather than merely changing a name.
- The candidate returns to the retained requirements, including affected conditions outside the diagnosed conflict.
- A compatible account, conditional construction, obtained result and authorized requirement change retain their different meanings.
- The next question serves the unresolved need or states how that need was changed; a sufficient answer or impossibility can stop the work.
B.5.QD.CF:8 - Common Anti-Patterns and How to Avoid Them
| Failure invited by conflict repair | Better move |
|---|---|
| “This way has always worked, so the result requires it.” | Recover what the way supplies and ask whether another operation supplies that contribution. |
| A solver returns a solution after a hard requirement is removed. | State the changed requirement and return to the original need; the witness answers the relaxed problem. |
| Two names are introduced for one quantity in one condition. | Establish the actual distinction or retain the incompatibility, as in :5.1. |
| The small conflicting set is repaired while another affected requirement is ignored. | Reapply the retained requirements; inspect the transition time or lost information that the change can affect. |
| A consistent description is presented as an implemented repair. | State the operation and support still needed to obtain the result. |
| Every conflict is promised a solution that preserves every demand. | Return the supported limit or requirement-change question when no warranted repair exists. |
B.5.QD.CF:9 - Consequences
The method can turn a conflict into a more useful construction question while preserving the purpose of the work. It also makes an impossibility usable: contributors can stop an unproductive search or decide which demand is open to change.
Recovering premises and returning a proposal to the full need costs effort. Concentrating on the inference that changes the next action keeps this effort bounded. Some conflicts remain unresolved because the replacement operation, relevant knowledge or authority is unavailable.
B.5.QD.CF:10 - Architectural Rationale
An incompatibility is relational: it depends on statements used together. That is why inspecting one requirement in isolation often misses the constructive opening. Separating a needed outcome from an assumed necessary means exposes a question about how else the outcome could be obtained.
The return to the original need prevents successful reformulation from becoming accidental goal substitution. A conditional construction, an achieved result and an impossibility make different contributions to the encompassing work. Keeping those contributions distinct allows division of work between people and AI without requiring each contributor to solve the whole problem.
Conflict-driven reformulation is a constituent of question development with its own recurring difficulty and operation. B.5.QD supplies the broader development of a question from either failure or success. This pattern unfolds the move from conflicting premises to an alternative construction or a useful limit, leaving subject construction and validation with their own methods.
B.5.QD.CF:11 - SoTA-Echoing
For the question “How can incompatible demands reveal an alternative means?”, adapt the Theory of Constraints move from a required outcome to its assumed necessary means. Against choosing a side before examining that necessity, the selected method asks for a replacement that supplies the retained outcome. Sections :4.2–:4.4 and :5.2 carry this difference. Goldratt’s Letter #5 gives the original method argument; the current ProConCloud account includes conditional and alternative changes. They are method proposals, not independent evidence of this pattern’s effectiveness. Reject a guarantee of preserving every demand and a mandatory experiment for every case. The selected return to retained requirements can cost more than simply choosing a side, but is warranted when another construction could change that choice. Reopen this comparison if a stronger method finds such constructions with less burden or reveals a missing class of consequential assumptions.
For “What does a diagnosed formal conflict establish?”, adopt the distinction between an inconsistent subset and a correction subset from Gamba, Bogaerts and Guns, Efficiently Explaining CSPs with Unsatisfiable Subset Optimization, Definitions 1–3. Against treating a returned correction as the practical repair, :4.2 and :4.4 preserve its narrower meaning: removing those constraints permits consistency in that formal problem. Adapt the distinction to optional diagnosis here; subset minimality and optimization are required only when their extra result matters. The source’s algorithms concern constraint problems, and their performance does not transfer to arbitrary disagreements. Reopen when a different constraint semantics changes what the diagnostic result means or a cheaper explanation suffices.
For “How should attempted construction change the problem?”, adapt the problem–solution co-evolution account in Parsons and Shukla, Beyond Problem Solving: Framing and Problem–Solution Co-Evolution in Data Visualization Design, §§4–5 and 6.4. Against fixing the problem once and testing only proposed solutions, :4.3–:4.5 return a failed construction to the consequential premise and then to the original need. Their study of eleven selected experts supplies practice-specific observations, not a universal creative mechanism or a test of this method. The extra return is useful when the attempted construction changes the question; an adequate existing formulation needs no such work. Reopen when evidence or another practice reveals that the return loses a needed distinction or obstructs a better continuation.
B.5.QD.CF:12 - Relations
- B.5.QD develops a useful question from a result or construction; this pattern specializes the conflict-to-question contribution.
- B.5.RA recovers the argument; B.5.RR revises the reasoning affected by a premise change. B.5.TC compares accounts whose meanings or conditions may differ.
- B.5.FM constructs a distinction and its relations. C.39 develops a way to obtain the needed result; C.40.CD develops that way and the problem together.
- B.1.5 supplies the Method-parthood relation when this reasoning contributes to an encompassing method while its constituent operations are enacted.
- C.11.DUA helps decide whether further information work can change a useful continuation enough to warrant its burden. A.15.9 helps obtain a needed contribution from another practice.
B.5.QD.CF:End
B.5.1 - Coordinate Development States: Explore → Shape → Evidence → Operate
B.5.1:1 - Problem Frame
Use this state model when a development project needs a shared account of whether a U.Episteme or U.System is being explored, shaped, evaluated or operated. The practical gain is to make the current development focus and the conditions for an intended transition visible. Without that distinction, a team may refine a design indefinitely or claim operational readiness before the required validation.
A development state describes the project’s treatment of its subject, not the assurance of every claim about it. A qualified explanation, proof or empirical result may already answer its receiving question while development remains in an earlier state. Ordinary use of that result needs no new development-state assignment.
B.5.1:2 - Problem
How can a project coordinate concept development and operational readiness without confusing completion of its present task, the subject’s development state and the support for a particular claim?
B.5.1:3 - Solution
Use the four development states to name the current focus for the episteme or system under development. For an intended transition, identify the design, evidence and operational conditions that actually need to hold. The Canonical Reasoning Cycle (B.5) can supply the relevant reasoning contributions; the state names do not prescribe an assurance ladder.
The Four Development States:
| State | Core Activity | Manager’s View: What It Means | Reasoning Contribution | What the state leaves to the receiving claim and use |
|---|---|---|---|---|
| 1. Exploration | Generating possibilities. Frame the problem and compare candidate explanations or designs. | “We are looking for a plausible direction and keeping the serious alternatives visible.” | Abduction (B.5.2) | A qualified conjecture may be sufficient for the present question; its origin does not assign L0. |
| 2. Shaping | Defining a coherent form. Develop the selected direction and derive its relevant consequences. | “We are making the design and its implications clear enough for the next intended use.” | Deduction | Logical support concerns the consequence under its premises. A coherent design alone does not establish actual performance. |
| 3. Evidence | Evaluating the relevant claims. Use applicable empirical or formal results and obtain missing evidence when it is required and feasible. | “We are deciding whether the needed claims are supported in the intended conditions.” | Empirical evaluation and applicable formal reasoning | Relevant existing support can be sufficient. A passed test does not automatically confer a higher assurance level. |
| 4. Operation | Using in a live environment. Begin or continue the intended operation and monitor what its actual conditions require. | “The system or episteme is in use, with the required operational conditions in place.” | Reasoning about operating observations and needed changes | Readiness and continuing use depend on the actual qualification, protective and authority conditions, not maintained L2. |
B.3.3 governs any assurance conclusion about the particular claim and receiving use. Retain an applicable domain profile, proof obligation or validation requirement where that use requires it. Existing results count only when they cover the present conditions; a missing required result can block the intended transition. A proposal to improve an excessive requirement does not waive a currently binding condition.
Didactic Note for Managers: Aligning States with Your Project Plan
Exploration can describe discovery, Shaping design, Evidence evaluation, and Operation live use and maintenance. Name the subject and the intended transition so that the team can tell what remains to be done. Completing a useful answer during Exploration does not mean that the developed system has entered Operation, nor that the answer must wait for every later project state.
Worked case. A service team completes B.5.2’s latency-spike inquiry with a qualified backup-interaction conjecture and live rivals. The possible causal probe is unavailable, so the explanatory result remains limited. An existing operational qualification separately supports a permitted diversion to a spare instance for this traffic and interval. The team can use that basis for the diversion without declaring the explanation validated or advancing a new design through Evidence. If the team instead proposes a new deployment whose required load test is missing, that deployment remains blocked; the useful conjecture does not supply the missing qualification.
B.5.1:4 - Conformance Checklist
- CC-B5.1.1 (State Explicitness): A state-bearing
U.EpistemeorU.Systemcoordinated through this development model MUST be tagged with its current state from {Exploration, Shaping, Evidence, Operation}. Identify the development subject; a separate bounded result need not be given that subject’s state. - CC-B5.1.2 (Sequential Progression): When advancing the development subject through this cycle, the project SHALL follow the state sequence. A departure MUST be justified against the intended transition’s actual prerequisites; it cannot waive binding proof, validation or operational conditions. Completing or using a sufficient bounded result without advancing the development subject is not a skipped state and needs no skip justification.
- CC-B5.1.3 (Reasoning Cycle Alignment): A transition MUST have the reasoning contributions and results needed by its applicable project and domain conditions. Before a hypothesis-led test, derive the consequences needed to interpret it. Reuse applicable prior reasoning or evidence when it meets those conditions; repeat a phase only for an actual unresolved need. Phase completion alone SHALL NOT confer an assurance level or operational permission.
B.5.1:5 - Consequences
| Benefits | Trade-offs / Mitigations |
|---|---|
| Clear Project Visibility: The states give a shared language for the development focus and intended transition. | Risk of Bureaucracy: Treating states as a universal evidence recipe can create unnecessary work. Use the actual transition conditions and reuse covering results. |
| Improved Focus: Exploration, design, evaluation and live operation have distinguishable immediate questions. | A result can serve another use without changing the development subject’s state; keep those two judgements separate. |
| Reduces “It’s Done” Ambiguity: The team can say whether it completed the present answer, the design or the conditions for operation. | A state label cannot replace the applicable readiness criteria. |
B.5.1:6 - Rationale
This pattern operationalizes the Principle of State Explicitness (P-9) for development coordination. The four states make the project’s focus and transition obligations inspectable. B.5 supplies reasoning contributions and B.3.3 qualifies assurance for a claim and use. Keeping those questions distinct supports iterative development without requiring every useful idea or result to become an operational holon.
B.5.1:7 - Relations
- Uses reasoning contributions from:
B.5 Choose the Next Reasoning Contribution (Canonical Reasoning Cycle);B.5.2 Generate and Compare Candidate Explanations (Abductive Loop)commonly supplies Exploration with qualified conjectures. - Uses for claim-specific assurance:
B.3.3 Assurance Subtypes & Levels. Development states neither organize its levels nor establish the adequacy of a claim. - Coordinates with:
B.4 Coordinate Repeated Adaptation (Canonical Evolution Loop). Its evolution phases and these development states are not a one-to-one mapping.
B.5.1:End
B.5.2 - Generate and Compare Candidate Explanations (Abductive Loop)
Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative
Plain-name. Generate and compare candidate explanations (Abductive Loop).
Builds on.
B.5 Choose the Next Reasoning Contribution (Canonical Reasoning Cycle), B.5.1 Exploration, B.5.2.0 U.AbductivePrompt, A.10, B.3.3.
Coordinates with.
B.4.1 Observe-Notice-Stabilize-Route for pre-abductive routing, A.16 for admissible language-state moves, A.6.P for lexical repair before hypothesis publication, and C.16.Q / A.6.A when the initiating publication face or cue is evaluative or action-inviting rather than explanatory.
B.5.2:1 - Problem frame
Use this when. An anomaly, opportunity or probe question needs candidate explanations that can be compared on their present plausibility. State the question and generate its serious rivals. The first useful result is a qualified conjecture with its supports, fragilities and allowed use, or an honest abort, defer or split outcome.
An adequate present answer or action need not enter abduction merely to generate another research task. Use C.11 for a live choice among feasible actions and C.28 when a causal-support claim is needed. Abduction contributes candidate explanatory content; it is not the complete evidence synthesis or action decision.
B.5.2:2 - Problem
Without an explicit abductive pattern:
- Inquiry stalls at surprise. A team encounters an anomaly, opportunity, or probe pressure but has no admissible next action for producing a candidate hypothesis.
- Origin is lost. Once a conjecture appears, the initiating prompt, rival candidates, and early plausibility grounds disappear from the record.
- Candidate space collapses too early. The first plausible-seeming explanation is treated as the explanation, even though alternatives were never exposed.
- Selection becomes opaque. A chosen conjecture moves downstream without a visible record of why it outranked alternatives.
- Untestable hypotheses survive too long. A candidate with no interpretable implication or possible discriminating contrast is treated as a useful explanation. Distinguish this from a meaningful conjecture whose possible check is presently unavailable.
B.5.2:3 - Forces
| Force | Tension |
|---|---|
| Generativity vs discipline | The loop must admit non-deductive candidate generation without making arbitrary guesses look admissible. |
| Breadth vs typed entry | Abduction should begin from more than anomaly alone, but not from any untyped prose fragment. |
| Rival diversity vs decision pressure | Several candidates should remain visible long enough to compare them, while still allowing one prime hypothesis to progress. |
| Speed vs traceability | The loop must be light enough for repeated use but explicit enough to preserve provenance and later review. |
| Plausibility vs evidence | A candidate may be worth pursuing before evidence is strong, but it still needs explicit plausibility grounds. |
B.5.2:4 - Solution - Structured abductive micro-cycle
B.5.2 begins from an admissible U.AbductivePrompt, expands a candidate set, compares it under explicit plausibility criteria, and publishes the selected conjecture as a hypothesis-bearing U.Episteme. Preserve the supports, rivals, limitations and allowed downstream use. Abduction alone assigns no AssuranceLevel.
B.5.2:4.1 - Nature of abduction in FPF
In FPF, abduction proposes a presently most plausible candidate explanation, model or conjecture under a declared prompt. Its plausibility can justify keeping or using that conjecture for a bounded purpose, but does not establish its causal mechanism or a stronger empirical claim. Deduction, evidence synthesis and action choice keep their own questions.
B.5.2:4.2 - Four-step micro-cycle
| Step | Core activity | Required publication outcome |
|---|---|---|
| 1. Frame the prompt | State the initiating U.AbductivePrompt precisely enough that the unexplained contrast, opportunity, or probe pressure is explicit. | A prompt record with open question, scope notes, and provenance. |
| 2. Generate candidate hypotheses | Produce multiple candidate conjectures that could resolve the prompt. | A visible candidate set, even if lightweight. |
| 3. Apply plausibility filters | Compare candidates against explicit plausibility criteria. | A short rationale that records why some candidates remain live and others are rejected. |
| 4. Select and publish the prime hypothesis | Choose the presently preferred conjecture where the comparison warrants one. | A hypothesis-bearing U.Episteme with its prompt, selection rationale, live rivals, supports, fragilities and allowed use. No universal level or mandatory next experiment follows. |
The loop is intentionally iterable. A selected prime hypothesis may later be replaced, narrowed, or reopened if deduction, probe work, or evidence reveals a better rival.
B.5.2:4.3 - Entry discipline via U.AbductivePrompt
AnomalyStatement remains a canonical prompt species, but it is not the only one. B.5.2 also accepts the broader prompt species governed by B.5.2.0, such as ProblemCuePrompt, OpportunityCuePrompt, and ProbeCuePrompt. This broadens entry without dissolving type discipline.
B.5.2:4.4 - Plausibility filters
The filtering step is local and context-sensitive, but the criteria used SHALL be explicit. Typical filters include:
- Parsimony. Does the candidate introduce only the additional structure that the prompt requires?
- Explanatory reach. How much of the prompt does the candidate actually account for?
- Consistency with established constraints. Does the candidate avoid collision with already trusted pillars, mechanisms, or scope declarations?
- Falsifiability / probeability. What implication, deduction or possible observation could discriminate the candidate from its rivals? Keep that question separate from whether a check is obtainable and worth performing now.
- Scope fit. Is the candidate framed for the declared prompt scope rather than for an inflated or shifted target?
No one filter is universally decisive. The pattern only requires that at least two filters be declared when a prime hypothesis is selected.
When a causal hypothesis cannot yet yield a discriminating implication because its mechanisms and rival accounts are unspecified, use C.28.CM to construct comparable causal models. Return their conditional consequences and unresolved premises to these plausibility filters. A useful hypothesis whose present question is already answered needs no additional model merely to remain a candidate.
B.5.2:4.5 - Abductive Unfolding Structure Block
When the question concerns possible continuations of abductive work and their conditions, use A.22.CGUS’s ordinary branch. Open its formal branch only when the receiving use needs the structure’s identity or replay; reuse of a hypothesis note alone does not require that branch.
AbductiveUnfoldingStructureBlock:
unfoldingStructureRef: one independently identified A.22.CGUS structure
abductivePromptRef:
cueSetWithDownstreamPatternAlternativesRef:
rivalHypothesisSetRef:
hypothesisGenerationLoci[]:
plausibilityConstraintRefs[]:
evidenceReturnLoci[]:
languageStateMoveRefs[]:
poolPolicyOrSelectionRef?:
blockedOverread?: not inspiration event, not linear ideation workflow, not evidence by itself
Use unfoldingStructureRef to designate the selected structure. Recover its constituents, obtaining relation occurrences, applied constraints and selection-use frame under A.22; qualify its loci and potential continuations under A.22.CGUS. Keep the describing record separate from that identity. Use cueSetWithDownstreamPatternAlternativesRef when the prompt still carries several possible patterns for the next question. Use rivalHypothesisSetRef before selecting a prime hypothesis. Use evidenceReturnLoci[] to say where later evidence, deduction, probe design, or assurance work can return; do not use those loci as evidence. Abductive plausibility comparison remains here. Use C.18 for archive or front claims, C.19 for live-pool policy, G.5 for a selector’s selected-set declaration, or the direct comparison method when that distinct result is needed.
AbductiveSearchUnfoldingStructure is a local designation for an A.22.CGUS structure selected for an abductive-search question; it supplies no additional identity rule. It is not a root U-kind, ideation workflow, evidence, or selection decision. Use B.5.2 to state the abductive prompt, cue set with alternative next patterns, rival hypotheses, plausibility constraints, and evidence-return loci. Use the patterns that define or test evidence, deduction, probe design, assurance, selected-set result declaration, pool policy, and comparison when those claims become current.
B.5.2:5 - Archetypal Grounding
Tell. Abduction is not “a flash of insight.” It is the governed passage from a typed prompt to a candidate conjecture through explicit rival generation and plausibility comparison.
Show (System). An operations team sees a recurring latency spike that existing explanations do not cover. They publish an AnomalyStatement, compare rival causes against current telemetry and mechanism knowledge, and retain a qualified prime conjecture. They name a possible discriminating probe without assigning a maturity level or committing the service team to an experiment.
Show (Episteme). A research group notices that two accepted results no longer fit together under one framing. It publishes a ProbeCuePrompt, enumerates several rival explanatory reframings, rejects the ones that fail scope fit or would not generate decisive probes, and advances one candidate explanation as the next working hypothesis.
B.5.2:6 - Bias-Annotation
This pattern biases authors toward visible candidate plurality, explicit plausibility criteria, and persistent prompt provenance. That bias is intentional. B.5.2 would rather keep early conjectures slightly over-exposed than let their origin and selection grounds disappear.
B.5.2:7 - Conformance Checklist
CC-B.5.2-1Every abductive run SHALL begin from a declaredU.AbductivePrompt; arbitrary prose fragments are not sufficient prompt-entry forms.CC-B.5.2-2A conforming abductive run SHALL record at least one rival candidate alongside any selected prime hypothesis, unless the author explicitly justifies why no rival candidate was available.CC-B.5.2-3Selection of a prime hypothesis SHALL cite at least two explicit plausibility filters.CC-B.5.2-4The selected prime hypothesis SHALL be published as a hypothesis-bearingU.Epistemewith its scope, support and limitations. An assurance level, if a receiving use requires one, SHALL follow B.3.3’s applicable justified profile rather than the fact that abduction occurred.CC-B.5.2-5The prime hypothesis record SHALL preserve a link to the initiating prompt and to the filtering rationale that justified selection.CC-B.5.2-6A conforming conjecture SHALL expose an interpretable implication, deduction or possible discriminating contrast. The availability and value of a check SHALL be considered separately before selecting evidence acquisition. An unavailable probe neither creates an observation nor by itself forbids a separately supported present decision.
B.5.2:8 - Common Anti-Patterns and How to Avoid Them
| Anti-pattern | What it looks like | How FPF prevents it |
|---|---|---|
| Authority candidate | One favored conjecture is advanced immediately, with no rival set and no explicit filtering. | CC-B.5.2-2 and CC-B.5.2-3 require candidate plurality and visible plausibility grounds. |
| Untestable grand conjecture | The candidate sounds explanatory but has no interpretable implication or discriminating contrast. | Use CC-B.5.2-6 to make its implications clear or refuse that abductive result. Do not confuse absence of a useful implication with temporary unavailability of a meaningful check. |
| Prompt amnesia | A later reader can see the conjecture but not the initiating anomaly, opportunity, or probe pressure. | CC-B.5.2-1 and CC-B.5.2-5 keep prompt provenance attached. |
| Symptom patching | The selected candidate only redescribes a visible symptom and leaves the actual prompt unresolved. | The explicit plausibility filter for explanatory reach forces the candidate to be compared against the whole prompt. |
B.5.2:9 - Consequences
| Benefit | Trade-off / Mitigation |
|---|---|
| Disciplined generativity. Abduction stays inventive without collapsing into formless conjecturing. | Requires explicit prompt and filter publication; mitigation: the required record can remain lightweight. |
| Traceable hypothesis origin. Later review can reconstruct why a conjecture entered the reasoning cycle. | Adds a small provenance-support load; mitigation: reuse prompt and candidate-set notes from adjacent patterns. |
| Cleaner downstream use. A hypothesis-bearing episteme gives the receiving question its scope, rivals, support and limitations. | A candidate can remain useful without being confirmed or receiving a universal level; a stronger claim still needs its own evidence. |
| Admissible reopening. Rival candidates can be revisited when later work undermines the selected prime hypothesis. | Demands editorial discipline so that abandoned rivals remain legible rather than silently vanishing. |
B.5.2:10 - Rationale
For the hypothesis-led empirical inquiry described in B.5, B.5.2 supplies explanation-led abduction before deduction and induction. It keeps hypothesis generation explicit, connects it to typed prompt publications, and prepares the output for later assurance work without pretending that early plausibility is already evidence.
B.5.2:11 - SoTA-Echoing
Contemporary inquiry practice in science, engineering, design, and diagnosis treats candidate generation as iterative and contrast-driven rather than singular and opaque. The pattern aligns with that practice, but keeps the representation lightweight: explicit prompts, visible rival candidates, and local plausibility grounds instead of heavyweight ideation machinery.
B.5.2:12 - Relations
- Supplies explanation-led abduction within: B.5’s hypothesis-led empirical inquiry, before deduction and induction.
- Typically operates during:
B.5.1 Exploration. - Consumes:
U.AbductivePromptpublications fromB.5.2.0, often reached throughB.4.1andA.16. - Produces: hypothesis-bearing
U.Epistemepublications with explicit conjectural content, supports, fragilities and allowed use; no automaticAssuranceLevel:L0. - Provides inputs for: deduction, probe design and evidence synthesis when those questions are live. C.11 governs a separate feasible-action or acquisition choice; C.28 supplies needed causal-use support. A possible experiment is not funded or scheduled Work.
- Uses: C.28.CM when causal mechanisms and alternatives must be constructed before their implications can inform the plausibility comparison.
- Coordinates with:
A.22.CGUSwhen the abductive prompt,B.4.1cue publication, rival hypotheses, plausibility constraints, evidence-return loci, and downstream tests must be inspected as anAbductiveSearchUnfoldingStructure.
B.5.2:12.1 - Prompt-entry broadening via U.AbductivePrompt
Older wording that makes AnomalyStatement the exclusive entry form is superseded. B.5.2 accepts U.AbductivePrompt, where AnomalyStatement remains one canonical species alongside cue-derived prompt species such as ProblemCuePrompt, OpportunityCuePrompt, and ProbeCuePrompt.
B.5.2:13 - Prompt, Candidate, and Hypothesis Package Discipline
Keep the prompt, the candidate set, and the selected prime hypothesis distinguishable in the publication. One paragraph can suffice when the question, rivals, selection grounds and outcome remain recoverable. Separate or link their expressions when independent revision or a receiving use needs that separation.
B.5.2:13.1 - Prompt package
A conforming prompt package should make explicit:
- the prompt species (
AnomalyStatement,ProblemCuePrompt,OpportunityCuePrompt, orProbeCuePrompt), - the open question that makes abduction necessary,
- the declared scope under which the question is being posed,
- the witnesses or provenance cues that made the prompt worth preserving,
- and the reason the current model is insufficient.
If the initiating publication is still primarily evaluative, action-inviting, or lexically overloaded, it should first be repaired by the relevant A.6 family before it is treated as a stable abductive prompt. B.5.2 assumes typed entry, not raw lexical ambiguity.
B.5.2:13.2 - Candidate-set note
A candidate-set note is the minimal record that preserves rival plurality. It need not be heavy, but it should make visible:
- candidate identifiers or short names,
- the differentiating claim each candidate adds,
- the principal plausibility supports and liabilities of each candidate,
- whether the candidate remains live, is deferred, or is rejected,
- and the implication or possible evidence that would best discriminate among remaining rivals, with an availability limitation when it changes the receiving use.
The important point is not bureaucratic completeness. The important point is to prevent retrospective rewriting in which the surviving candidate is made to look as if it had been the only serious option from the beginning.
B.5.2:13.3 - Prime-hypothesis record
A selected prime hypothesis should preserve more than the hypothesis sentence itself. Its record names:
- the selected candidate,
- the prompt it answers,
- the filters under which it outranked rivals,
- the scope within which it is being advanced,
- the allowed downstream use or next question, which may concern deduction, a possible probe, a separately justified action or reconsideration; include availability limits when they change that use,
- and any known fragilities already visible at selection time.
This is how B.5.2 stays connected to the rest of the reasoning cycle. The abductive loop does not merely emit an idea; it emits a conjecture with explicit downstream-use terms.
B.5.2:14 - Admissible Transitions, Abort Paths, and Reopening
The abductive loop keeps its outcomes distinct so the recipient can tell whether it receives a qualified conjecture, deferred rivals, or a prompt that needs reopening. None of these outcomes by itself establishes an assurance level or an evidence-acquisition commitment.
B.5.2:14.1 - Relation to B.4.1 and A.16
B.4.1 and A.16 often supply the pre-abductive seam. They help preserve and stabilize upstream publications, including publication forms that carry route-shaped representations when those forms are explicitly governed, before the publication is fit for explicit conjecture. B.5.2 begins only once the current publication is ready to function as an abductive prompt. This boundary matters because it prevents two opposite errors:
- premature abduction, where a low-articulation cue is treated as if it had already earned hypothesis form;
- delayed abduction, where a now-stable prompt is kept indefinitely in early cue form even though rival conjectures should already be compared.
B.5.2:14.2 - Abort, defer, and split cases
Not every abductive run should end in a prime hypothesis. Three non-selection outcomes are admissible:
- Abort. The prompt dissolves because the initiating anomaly or opportunity was misread, duplicated, or already answered elsewhere.
- Defer. Several candidates remain live and the available comparison does not justify a winner, for example because a needed discriminator is unavailable. Preserve the unresolved set and its limits without inventing a winning explanation. A separately warranted present action may still proceed under C.11.
- Split. The original prompt turns out to contain several distinct questions. The run should fork into several narrower prompts rather than select one over-broad conjecture.
These outcomes are not failures. They are part of keeping abduction honest.
B.5.2:14.3 - Reopening and rival reinstatement
A prime hypothesis may later lose support under deduction, probe results, or new evidence. When that happens, B.5.2 prefers explicit reopening to silent replacement.
A conforming reopening note should identify:
- which prior prime hypothesis is being reopened,
- whether a stored rival is being reinstated or a new candidate is entering,
- what change in evidence, scope, or internal contradiction triggered the reopening,
- and whether the original prompt itself has changed or only the candidate ranking has changed.
This allows the reasoning cycle to keep continuity without pretending that the earlier abductive choice had never been made.
B.5.2:14.4 - Scope discipline during iteration
Abductive drift often comes from silent scope expansion. A conjecture first framed for one target slice quietly becomes a universal explanation. B.5.2 therefore expects scope discipline to remain explicit during iteration. If a candidate requires a broader or narrower scope than the prompt originally declared, that scope move should be stated rather than smuggled in under the rhetoric of a “better explanation.”
B.5.2:15 - Worked Examples
B.5.2:15.1 - Service degradation diagnosis
A service team notices recurring latency spikes during one operating window. The prompt species is AnomalyStatement: why does latency spike in the evening batch window despite unchanged nominal load?
The candidate set includes:
- queue saturation in one downstream dependency,
- a time-window interaction with backup traffic,
- and a recent mechanism regression in cache invalidation.
The backup-interaction conjecture is preferred because its timing fits the existing observations and it remains consistent with known mechanisms; the other two candidates remain live. Isolating backup traffic and comparing latency against prior windows is a possible discriminator. When that probe is obtainable and its expected contribution justifies its cost and delay, it can be selected as separate work. The conjecture itself records no observation from that unperformed probe.
Now keep the same observations and rival set but make the probe window unavailable. The qualified conjecture and its uncertainty remain; if the available comparison cannot select a winner, defer that selection. No new test, waiver or study proposal is needed just to finish the present abductive result.
In both variants, suppose an existing operational qualification independently supports a bounded diversion to a spare instance for this traffic and interval, with sufficient capacity and actual permission, across all three remaining causes. C.11 can support that service response on the available basis. Diverting traffic does not identify the cause; a causal claim about the mechanism still needs the appropriate C.28 support. If that operational basis is absent, do not infer a justified diversion from conjecture plausibility.
B.5.2:15.2 - Opportunity-driven materials inquiry
A research group sees an opportunity rather than a failure: a new fabrication method appears to create a micro-structure with useful thermal behavior. The prompt species is OpportunityCuePrompt rather than anomaly.
Candidate hypotheses include:
- the effect is caused by surface geometry,
- it is caused by composition gradients,
- or it is an effect of one measurement regime.
The geometry explanation is the prime conjecture because it fits more of the initial observations and suggests a clearer discriminating experiment. Keep the composition and measurement rivals visible. The possible experiment can inform a separate research choice; its description neither funds it nor makes it mandatory. Long-horizon research can be worthwhile on its own declared contribution, without treating the conjecture as an established thermal-performance result.
B.5.2:15.3 - Probe-driven theory repair
A theory-maintenance group identifies a probe-worthy mismatch between two accepted claims. The prompt species is ProbeCuePrompt: what changed assumption would allow these two claims to coexist without contradiction?
The candidate set includes:
- hidden scope restriction on the first claim,
- mistaken invariance assumption in the second,
- and a more general missing mediating construct.
The selected prime hypothesis is the mediating construct, but the scope-restriction candidate remains stored as a live rival because it could still outperform if later deductions fail. This example illustrates why B.5.2 tracks the rival set rather than only the currently favored conjecture.
B.5.2:16 - Authoring and Review Guidance
B.5.2:16.1 - For abductive-publication authors
For an abductive publication, make the prompt, seriously considered rivals, plausibility grounds and outcome recoverable. If a prime hypothesis is warranted, explain why it is preferred, its allowed use and a meaningful possible discriminator. Otherwise state the abort, defer or split outcome and its grounds under §14.2. Return to prompt-shaping or lexical repair when the question, scope or intended meanings remain unclear.
B.5.2:16.2 - For hypothesis reviewers
Hypothesis reviewers should not ask only whether the chosen hypothesis looks plausible. They should also ask:
- whether the prompt was typed in an admissible way,
- whether at least one real rival was preserved,
- whether the filters named at selection time actually discriminate among candidates,
- whether the selected hypothesis has interpretable implications and a meaningful possible discriminator, with actual availability kept separate from that explanatory contribution,
- and whether any scope inflation occurred during selection.
A polished hypothesis with no visible rivals is usually less trustworthy than a rougher hypothesis whose rival space is explicit.
B.5.2:16.3 - For integrators and assurance leads
Integrators receive a qualified conjecture, not early assurance conferred by an L0 label. Preserve its prompt, rivals, supports, filter rationale and fragilities. Use B.3.3 only for a receiving assurance question, C.11 for a feasible-action or evidence-acquisition choice, and C.28 for causal support when needed. An unavailable probe can leave the explanation unresolved while an independently warranted bounded service action remains useful; do not turn the conjecture into a mandatory work item.
B.5.2:17 - Migration and Boundary Notes
B.5.2:17.1 - Migration from anomaly monopoly
Older wording that says abduction begins only from anomaly should be rewritten into the broader but still typed claim: abduction begins from an admissible U.AbductivePrompt, of which anomaly is one canonical species.
B.5.2:17.2 - Migration from inspiration rhetoric
Legacy prose that describes abduction as a flash, leap, or raw creative moment may remain as didactic metaphor, but it should not be used as the operational description of the pattern. The operational core is typed prompt -> rival set -> plausibility filtering -> prime hypothesis publication.
B.5.2:17.3 - Boundary to deduction and evidence
B.5.2 ends with a qualified prime conjecture or an explicit abort, defer or split outcome. Deduction, evidence acquisition, synthesis, assurance and action choice remain separate questions. Naming their possible contribution states a downstream-use boundary; it does not require a new experiment, guarantee its availability or prevent a present decision already supported on other grounds.
B.5.2:End
B.5.2.0 - Question Form for Entering Abduction (U.AbductivePrompt)
Type: Definitional (D) Status: Stable Normativity: Normative unless marked informative
Plain-name. Question form for entering abduction.
Use this when. Use this pattern when a stabilized cue, opportunity, probe-related observation or anomaly raises an explanatory question for B.5.2. Publish the question, its scope and motivating grounds while rival explanations remain open.
What goes wrong if missed. A cue is forced into anomaly form, an opportunity is treated as a hypothesis, or a prompt-like sentence silently smuggles in the preferred answer before rival hypotheses can be compared.
What this buys. A small admission form for abduction: prompt species, open question, scope, and provenance stay explicit while the downstream abductive loop remains free to compare rival answers.
Not this pattern when. Not this pattern when the object is still a raw cue (B.4.1), a language-state threshold claim (C.2.4, C.2.5), a chosen hypothesis (B.5.2), or a selector decision about methods, substrates, or portfolios.
B.5.2.0:0 - Kind and publication-form boundary
U.AbductivePrompt is a dependent durable publication-form value under episteme publication and abductive entry, not a root U-kind. Its identity is the typed prompt form that may seed B.5.2 after cue preservation, routing, and language-state threshold checks. A cue, routing note, anomaly sentence, candidate hypothesis, or local prompt label does not become U.AbductivePrompt unless the prompt species, open question, scope, and provenance required by this pattern are present.
B.5.2.0:1 - Problem frame
B.5.2 needs an entry form that can accept admissible language-state trajectories after cue preservation and routing, without pretending that anomaly is the only admissible starting form.
B.5.2.0:2 - Problem
If anomaly is the only admissible input, pre-anomaly opportunity cues and route-derived prompt forms are excluded or misrepresented. If anything can enter, abduction loses its typed starting discipline.
B.5.2.0:3 - Forces
| Force | Tension |
|---|---|
| Breadth vs discipline | Admit more than anomaly, but keep a bounded family of admissible prompt species. |
| Reuse vs type inflation | Introduce a clean entry form without exploding the number of heavy publication kinds. |
| Prompt vs hypothesis | Keep the initiating prompt distinct from the downstream abductive outcome. |
B.5.2.0:4 - Solution
U.AbductivePrompt is a narrow family head for the prompt forms that may admissibly seed B.5.2 after admissible cue preservation and governing-pattern selection under A.16, A.16.1, and B.4.1. A.16.0 is used only when the cue-to-prompt history itself has governance value as an explicit trajectory account. When rendered, a prompt uses ordinary MVPK faces; prompt status is a property of the publication form, not a rival face ontology.
B.5.2.0:4.1 - Starter canonical species and conditional extension species
- starter canonical species:
AnomalyStatementProblemCuePromptOpportunityCuePromptProbeCuePrompt
- conditional extension species:
TaskFamilySpecializationPromptAdaptationProbePromptNonHumanUtilityPromptSubstrateDiversificationPrompt
B.5.2.0:4.1.1 - Specialization-sensitive prompt species
These extension species are admissible only when cue provenance or trajectory account already carries the bounded-specialization evidence requirement by value; they are not the starter canonical entry set for ordinary abduction.
TaskFamilySpecializationPrompt asks what explains a performance difference within the declared task family. AdaptationProbePrompt asks which rival explanations predict whether a proposed adaptation can reach the stated threshold. NonHumanUtilityPrompt asks what could explain the indicated utility advantage of a low-human-overlap approach. SubstrateDiversificationPrompt asks what explains the indicated limitation of the current substrate. In each species, B.5.2 returns qualified explanatory conjectures; task family, utility target, threshold, budget and motivating evidence qualify that question.
B.5.2.0:4.2 - Core shape
A conforming abductive prompt makes promptSpecies, its explanatory openQuestion, scope and motivating provenance explicit. The provenance may be carried by motivatingCueRef, witnessRefs or routeProvenance; include the applicable basis even when no routing history exists. A rendering may additionally include contrastSet and GammaTime.
A prompt is not yet a hypothesis. Prompt admission usually presupposes articulation high enough to publish a stable open question and closure low enough that rival answers remain live; those articulation and closure thresholds remain governed by C.2.4 and C.2.5, typically reached through cue or route provenance from A.16.1 and B.4.1. It is the initiating publication form that licenses entry into the abductive loop.
B.5.2.0:4.3 - Boundary rule
Only a declared prompt species carrying an explanatory question enters B.5.2 through this form. For a choice among available probes, actions or specialist options, use C.11. Use C.38 to develop incomplete alternatives for the same intended result, C.11.DUA to examine an unclear evidence demand, and C.19 when the question is policy over a still-live candidate pool. C.18 records generation and comparison results; C.22.1 describes an adaptation signature. Neither performs the missing choice. An explanatory subquestion arising during planning can still enter B.5.2 on its own grounds.
B.5.2.0:5 - Archetypal Grounding
Tell. An anomaly is one prompt species, not the only one.
Show (System). A control observation may raise competing explanations of an apparent response improvement without being framed as an anomaly. The abductive result qualifies those explanations; choosing a discriminating probe is a separate C.11 decision.
Show (Episteme). A promising mismatch can begin an opportunity-style abductive prompt rather than only a problem statement.
B.5.2.0:6 - Bias-Annotation
The pattern broadens the entry form to abduction, but still keeps it typed and auditable.
B.5.2.0:7 - Conformance Checklist
CC-B.5.2.0-1EveryU.AbductivePromptSHALL declare its prompt species.CC-B.5.2.0-2A prompt SHALL NOT be confused with a finished hypothesis.CC-B.5.2.0-3Cue-derived prompts SHOULD preserve route provenance.CC-B.5.2.0-4Prompt publication SHALL include the explanatory question, its scope and the motivating provenance that make abduction appropriate.CC-B.5.2.0-5A publication that already fixes the answer or suppresses plausible rivals SHALL NOT remain in prompt status.CC-B.5.2.0-6When a specialization-sensitive prompt species is used, the prompt package SHALL make explicit the declared task family or utility target, the threshold or success condition being probed, the current budget window, and the route or cue provenance that made the prompt admissible.
B.5.2.0:8 - Common Anti-Patterns and How to Avoid Them
- Prompt equals hypothesis. Keep the prompt distinct from the abductive output.
- A choice disguised as abduction. Recover the explanatory question, if one exists; send the probe, action or acquisition choice to its actual Method.
- Route amnesia. A cue-derived prompt loses the early route provenance that explains why it entered here.
B.5.2.0:9 - Consequences
The benefit is cleaner, less brittle abduction-entry terms. The trade-off is one additional explicit prompt family head and one more declared publication form.
B.5.2.0:10 - Rationale
This keeps admissible cue preservation and trajectory publication able to dock into B.5.2 through a typed prompt form without anomaly inflation and without making A.16.0 mandatory.
B.5.2.0:11 - SoTA-Echoing
The pattern reflects real abductive practice, where opportunities, probe prompts, and stabilized cues often begin the loop before a full anomaly formulation exists.
B.5.2.0:12 - Relations
- Builds on:
C.2.2a,A.16,A.16.1,B.4.1,C.2.LS,C.2.4,C.2.5. - Coordinates with:
A.16.0,A.16.2,C.2.6,C.2.7,B.5.2,A.6.P,C.16.Q,A.6.A,F.9.1. - Constrains: admissible prompt entry into abduction.
B.5.2.0:13 - Worked Prompt Species
B.5.2.0:13.1 - Anomaly statement as canonical prompt
In a constructed service case, latency rises from 8 ms to 40 ms under the same declared workload. The prompt asks what could explain that contrast, names the service and time window, and cites the measurements. Rival explanations may concern contention or a changed cache path; neither is asserted by publishing the prompt. B.5.2 compares their plausibility and may return a qualified conjecture or defer.
B.5.2.0:13.2 - Opportunity-style prompt
An opportunity cue may raise an explanatory question about an indicated advantage without a failure. For example, an unexpectedly stable response in one operating range invites rival explanations of that stability. Whether to exploit the opportunity is a separate action choice.
B.5.2.0:13.3 - Probe-style prompt
A probe-related observation may prompt an explanatory question: which rival explanations predict the measured contrast under the stated perturbation? If the question is instead which available probe is cheapest or most discriminating for the current purpose, use C.11. The probe choice does not require an abductive prompt merely to acquire that input form.
B.5.2.0:13.4 - Specialization-sensitive prompt set
Use a specialization-sensitive species for its explanatory question in §4.1.1. For example, a measured performance contrast can prompt rival explanations tied to a declared task family and budget. Acquiring a specialist Method or competence bundle instead requires the applicable option or alternative-development decision. Retain task family, threshold, budget and cue provenance in whichever receiving use needs them; prompt publication does not select the acquisition.
B.5.2.0:14 - Prompt package discipline
A prompt becomes reusable in B.5.2 only when its initiating question is explicit enough to remain stable across downstream hypothesis work.
B.5.2.0:14.1 - Minimal prompt package
A robust abductive prompt should make explicit:
- the prompt species,
- the open question,
- the motivating cue or route provenance,
- the contrast set, if one is already visible,
- the scope in which the question is being asked,
- and the witnesses or cue grounds that justify beginning abduction.
This package lets downstream conjectures be tested against the same question rather than against a rewritten paraphrase.
For specialization-sensitive prompt species, the package should also make explicit the declared task family or utility target, the threshold or success condition being probed, the current budget window, the prior route provenance, and the rival prompt shapes still in play.
B.5.2.0:14.2 - Prompts are questions, not claims
A prompt may cue one explanation, but it remains a question-bearing entry form. If the text already asserts the answer, it has moved past prompt status and should be treated under B.5.2 or another governing pattern that carries the asserted answer.
B.5.2.0:14.3 - Prompt provenance remains load-bearing
The motivating provenance is part of prompt admission. Preserve the route, cue or witness basis actually used; a prompt with no routing history does not need an invented route.
B.5.2.0:14.4 - Check prompt against silent promotion
An assurance reader should watch for the common mistake where authors silently upgrade a prompt into a hypothesis merely because the prose sounds explanatory. If the text already leans on one preferred answer as settled, either rewrite it back into a real question or explicitly apply the governing pattern that carries the asserted answer.
B.5.2.0:15 - Species boundary reminders
Use anomaly species for an explanatory question arising from a failure, contradiction or surprising departure from the current model. Use opportunity species for an explanatory question arising from an indicated advantage. Use probe species for rival explanations of an observation or predicted contrast associated with a stated probe.
For the four specialization-sensitive species, use the explanatory questions and conditions in §4.1.1. Questions asking which option to acquire, which probe to perform or which substrate to try follow the direct choice routes in §4.3.
Cue-derived prompt entries should stay prompt-headed species rather than projection-headed aliases. The load-bearing question is the prompt kind itself, not one package-local naming trick.
B.5.2.0:16 - Boundary crossing and invalid drift
A prompt should enter B.5.2 only when the question is explicit enough that rival hypotheses can now be compared against it. If the question is still underspecified, the admissible continuation is further stabilization or routing, not premature abduction.
A routed cue may be close to prompt form but still missing one decisive contrast or witness. In such cases the candidate stays outside U.AbductivePrompt until its initiating question is stable.
A bare intuition, slogan, or rhetorical question with no prompt species and no cue provenance is not yet an admissible U.AbductivePrompt.
A common failure mode is drift from cue -> prompt -> hypothesis without anyone naming the boundary crossings. B.5.2.0 blocks that drift by keeping the prompt package distinct from both the earlier cue pack and the downstream prime hypothesis.
B.5.2.0:17 - Scope, rival-set, and comparative-validity discipline
A prompt should declare the scope in which its question is being asked: the domain fragment, operational horizon, or inquiry-bounded scope cut that makes the question answerable. If scope remains unbounded, rival hypotheses become incomparable because they are answering different questions.
A prompt need not list full hypotheses yet, but it should make visible whether rival answer types are already imaginable. If no rival answer space is even latent, the publication may still be a cue or orientation note rather than a true abductive prompt.
A prompt may be narrowed to become more discriminating, but the narrowing must not silently smuggle in the answer it is supposedly asking about. Otherwise the prompt ceases to be an initiating question and becomes a disguised conclusion. If a prompt already excludes every serious rival except one preferred explanatory line, the publication may already be preloading a hypothesis. Review should then either rewrite the prompt back into a real question or explicitly apply the governing pattern that carries the asserted answer.
Prompts may be compared across contexts only when their species, scope, and provenance are explicit. A probe-shaped question and an opportunity-shaped question are not the same kind of abductive entry merely because both invite explanation.
One note may legitimately contain a bundle of closely related prompts. If so, the bundle members should be distinguishable and still allow downstream rival comparison without confusion.
An assurance reader can test prompt readiness with three questions:
- Is there a real open explanatory question? An asserted answer is no longer a prompt; an action-choice question needs its own Method.
- Is the prompt species plausible? If the initiating cue shape is opportunity-shaped or probe-shaped, forcing anomaly species is a category error.
- Could rival hypotheses now be compared against this prompt? If not, the prompt candidate probably needs more stabilization before entering
B.5.2.
Add three follow-up checks:
- Is the scope tight enough for downstream comparison?
- Is there an imaginable rival-set, even if not yet fully written?
- Is the narrowing still a question rather than a disguised answer?
B.5.2.0:End
B.5.2.1 - Instrument Abductive Hypothesis Generation with Novelty–Quality–Diversity (NQD)
Status. Normative binding to B.5.2 Abductive Loop. The local NQD-Generate Method in §4, or an equivalent declared generator, constructs the candidates. C.18 supplies generation, archive and front records; C.19 supplies the applicable exploration/exploitation policy.
Non-duplication & parsimony. Reuse A.17/A.18 for Characteristics and A.3.1/A.3.2 for the Method and its description. The local Method supplies candidate construction without adding a kernel operator. Distinguish its input and seed conditions, conditions for any actual generation Work, and the generated candidate’s later admission to comparison. C.18 records the identified generator and its results; filling that record performs no generation. Terminology discipline. Use NQD consistently (Novelty–Quality–Diversity). Treat S/I as secondary metrics unless explicitly promoted by policy (see §3, §5).
B.5.2.1:1 - Problem Frame
- Conceptual binding: B.5.2 Abductive Loop (this pattern specifies the how for Steps 2–3).
- FPF pattern: a domain‑neutral Creativity‑CHR (C‑cluster) that declares the Characteristics used here (see §2). (No change to Γ/LOG.) This binding uses C.18 for generation/archive/front records and C.19 E/E-LOG for EmitterPolicy.
- Manager’s mental model (informative): “We add measurable characteristics for newness, spread, and fit, then use a generator that explores widely and returns a front over the declared Q components together with retained exploration/archive evidence when the policy asks for it, not a single winner and not one bundled
{Q,N,D}default.” - Operational loops: compatible with B.4 Canonical Evolution Loop (ideas generated here flow into Run→Observe→Refine→Deploy) and with B.5 Canonical Reasoning Cycle, which selects the reasoning contribution needed by the current question.
- Decision-subject note. Later choices are attributed to one declared
DecisionSubjectat explicitDecisionSubjectGranularity. Contexts publish measurement spaces and admissible policies as semantic frames; they do not enact choices.
B.5.2.1:2 - Intent & Problem
Intent. Turn Step 2 (generate) and Step 3 (filter) of the Abductive Loop from ad‑hoc brainstorming into a disciplined, instrumented exploration that can (i) produce many distinct, plausible hypotheses and (ii) surface the few worth pursuing—without bloating the kernel or forcing a specific creative method.
Problem. Unstructured ideation routinely fails on two fronts: it either produces too little variety (pet ideas win by seniority) or too little plausibility (grand theories with no testable predictions). B.5.2 names these failure modes; this pattern adds a minimal, measurable counter‑mechanism aligned to FPF’s assurance lanes and state machine.
B.5.2.1:3 - The Creativity‑CHR (references only; no re‑definitions here)
This binding references the context‑local Creativity‑CHR (see C.17) and does not restate measurement templates. The primary coordinates are:
Novelty@context(C.17 §4.1), •ΔDiversity_P(marginal; C.17 §5.1), and •Qcomponents (per A.18). Surprise is an optional coordinate; IlluminationSummary is a retained-set telemetry report under C.17. Use either in comparison only when the C.19 policy names that use and its constituted basis; promotion into dominance requires an explicit policy.Use‑Value(alias:ValueGain) is informative for decision lenses (Decsn‑CAL) and MUST NOT enter NQD dominance by default (see C.17 §4.2).
For each coordinate actually used, declare its bearer, Characteristic, Scale, polarity, admissible operations, scope, window and evidence basis under C.17. Cite a constituted C.16 measurement result when the coordinate was measured, or a C.2.1 ascription under its declared rule. Candidate must-constraint eligibility and the conditions for performing generation are separate questions.
Lexical discipline. The items above are Characteristics in the sense of A.17/A.18; avoid reserved names such as “validity” or “operation.” Comparison basis. Compare each Q coordinate under its declared Scale, polarity and admissible order. Different units across coordinates do not by themselves require normalization for componentwise Pareto comparison. If the chosen comparator requires a transformation, declare it and preserve the order distinctions on which dominance depends (see CC-B.5.2.1-6). D and I. D = ΔDiversity_P(h | Pool) is a marginal retained-set reading under the same declared measurement policy. It is outside primary dominance unless explicitly promoted. IlluminationSummary reports the retained set; it is not a per-hypothesis primitive coordinate. A C.19 policy may name a tie-break or promoted use with the corresponding report and basis. Measurement invariants. Distances, grids, and transforms MUST be declared once per run, versioned, and referenced from provenance (§3, §5).
B.5.2.1:4 - Solution — NQD-Generate and its C.18 records
Method name (Plain/Unified Tech). NQD‑Generate — a U.Method that, given (i) a HypothesisSpace and (ii) a CharacteristicSpace with a CoverageGrid, returns a finite candidate package: a current front over the declared DominanceSet plus the retained archive/tie-break telemetry needed to keep diversity and novelty reviewable without making them default dominance dimensions.
Minimal signature.
-
Inputs (declared in MethodDescription):
HypothesisSpace,CharacteristicSpace,Seeds?,Budget (time/compute),EmitterPolicy(E/E-LOG policy id),QualityMeasures (Q components),NoveltyMetric,CoverageGrid/Granularity,CellCapacity K? (default=1),EpsilonDominance ε? (default=0),TieBreakPolicy? (S/I),DedupThreshold?,Policy(TimeWindow),DeterminismSeed? -
Outputs: CandidateSet = {h_i: (desc_i, Q_i, N_i?, D_i?:=ΔDiversity_P(h_i | Pool), S_i?, UseValue_i?), genealogy_i?, provenance_i (including DHCMethodRef.edition and policyId from E/E-LOG)} where
Q_iis a vector andprovenance_icaptures generator settings and evaluation sources. The coordinate entries cite the constituted results actually used. When illumination is reported, carry IlluminationSummary separately as a report about its declared retained set. Unused optional readings need not be produced. If Use-Value is present, identify its objective or acceptance criterion and scope. For a gain claim, also identify the baseline and comparison or counterfactual Method; for a predicted reading, identify the model edition and assumptions under C.17. Note:N,D,S, andIare archive, tie-break, telemetry, or policy-promoted signals by default; only the declaredDominanceSetenters the current front.Use-Valueis decision-side/supporting unless the current Context explicitly declares it inside the activeQtuple /DominanceSet; when it is only recorded as a side measure, keep it outside dominance.
Strategy (notation‑neutral).
- Seeding and constructors. Declare the explanatory question, hypothesis space and permitted variation operators in the MethodDescription. Initialize with admissible seeds: known explanations, random draws under that grammar or prior hypothesis-bearing epistemes with their grounds and limits. Name how an operator constructs a changed explanatory claim, for example by replacing a proposed mechanism or combining two mechanisms under a stated interaction assumption. When there are no seeds, use the declared finite enumeration or sampling rule.
- Construct and assess. Apply the selected variation operators to the seeds or retained candidates within the budget; record each resulting hypothesis and its parent/operator provenance. Then test candidate must-constraints for comparison and evaluate each required Q component. Keep an excluded candidate and its reason distinguishable from a candidate not yet generated. Maintain up to K retained entries per declared cell; obtain only the N, ΔDiversity_P and Surprise readings actually used under C.17, and any required retained-set illumination report. Deduplicate under the declared rule and threshold.
- Budget‑bounded loop. Iterate until budget or coverage‑convergence; return the (ε‑)Pareto front over the declared
DominanceSet. When the Context consumes the ordinary default, that means the declaredQcomponents underDefaultId.DominanceRegime, not one fresh local doctrine. KeepN,D=ΔDiversity_P,Surprise, andIlluminationSummaryas archive/tie-break/telemetry signals unless one Context policy explicitly promotes one of them into dominance and records the policy id.Use-Valueenters dominance only when the current Context explicitly declares it inside the activeQtuple; otherwise it may appear as one decision-side/supporting side note. - Traceability. Emit a Design Rationale Record (DRR): grids/metrics versions, seed(s), policy and
TimeWindow, which cells were filled, why items were dominated (list Characteristics), and how the final set was produced (includingε,K, and dedup). (Lightweight DRR is permitted per B.4 guidance.) - Algorithmic freedom (informative). Implementations MAY use MAP‑Elites/illumination, novelty search with local competition, Bayesian/surrogate‑assisted search, or deterministic enumerations; ε‑dominance or knee‑point thinning MAY be used after recording the full front in provenance.
No kernel growth. This is a method/work use of
A.3,A.15, andB.1.5plus a characteristic-space import; no new Γ‑operator is added (per A.11).
B.5.2.1:5 - Implementation & Binding into B.5.2 (two injection points)
Step 2 — Generate candidates. Before generation. Establish the Method’s applicable input/seed conditions. For actual generation Work, satisfy its independently applicable authority, assignment, scope, window, budget and permission conditions, including USM coverage and an enactable RSG state when the governing use requires them. A theoretical candidate comparison does not acquire a fictional performer or permission gate. A generated candidate’s ConstraintFit is assessed after construction and controls its admission to the specified comparison.
When the pattern is imported, use NQD-Generate for the selected generation contribution. Its candidate package carries conjectural content and the constituted coordinate results and provenance actually used. Report diversity to the extent supported by its declared reading; generation assigns no assurance level.
Step 3 — Plausibility filters. Apply B.5.2’s plausibility criteria, now with explicit hooks:
- Falsifiability / probeability → require an interpretable implication or possible discriminating contrast under B.5.2. Keep a meaningful conjecture distinguishable from the present availability or worth of its check.
- Explanatory power → prioritize candidates whose Q‑improvements (and attached rationales) align with the framed anomaly.
Apply B.5.2 to return a qualified prime conjecture when its comparison warrants one, or an explicit abort, defer or split result. Deduction, evidence acquisition and action choice remain separate questions.
Primary dominance test: compute the (ε-)Pareto front over the declared DominanceSet. When the Context consumes the ordinary default, that means the declared Q components. For tie-breaking, use only the constituted Novelty, ΔDiversity_P, Surprise or IlluminationSummary results named by the active C.19 policy. Optional archive or telemetry readings retain their own declared use; promotion into dominance requires an explicit policy. Use-Value remains non-dominant unless the active Q tuple explicitly includes it.
Ordinary fallback posture when no narrower local policy is specified
Do not mint one local dominance doctrine here. Consume the ordinary default
DefaultId.DominanceRegimefromG.Core/G.5together with the activeC.19policy-side defaults; in ordinary Q-front use this means the declaredQcomponents, withConstraintFit=passas the candidate admission condition for that front, assessed after generation. Tie-breakers: use only the constitutedNovelty@context,ΔDiversity_PorSurpriseresults named by the active C.19 policy.IlluminationSummaryremains report-only unless that policy names a tie-break or promoted use. Unused optional readings need not be produced. Archive:K=1,ε=0, deduplication inCharacteristicSpace. Policy family: one uncertainty-aware explore policy family with one declared regime key;UCB-class with moderate temperature andexplore_share ≈ 0.3–0.5is one didactic starter profile, not the semantic default family. Provenance (minimum): recordDescriptorMapRef.edition,DistanceDefRef.edition,EmitterPolicyRef,TimeWindow,Seeds.
“Scope‑of‑claim annotation (descriptive). Record the BoundedContext and TimeWindow that delimit where each N/Q/D measurement is intended to hold; this is for reasoning traceability only (no operational gates).”
Note — Status Surprise (scope and default role):
Use Surprise as a secondary tie-break only when the active C.19 policy names that use, among candidates otherwise Pareto-equivalent on the declared primary characteristics. A policy may explicitly promote Surprise into dominance with its constituted basis. If the policy does not use Surprise, omit that reading.
B.5.2.1:5.1 - Creative-generation consistency with the declared dominance doctrine
- When candidate generation speaks about fronts, use the declared
DominanceSetfor the front and keep archive retention separate when archive mode is active. - Do not write novelty or diversity terms into the front definition merely because they are important to archive quality or exploration value.
- If one generator emits both a front-facing result and an archive-facing result, say which surface each result belongs to.
- If one generator speaks about selected results, keep that language in the shortlist family rather than silently reusing front language.
- Prefer wording like
front over the declared DominanceSet, plus the corresponding ExplorationArchive when archive mode is activeover wording that foldsQ, novelty, and diversity into one default front by habit. - The local generation story should stay consistent with the declared
Front,Archive, andShortlistlanguage so comparison stays intelligible and lawful.
B.5.2.1:6 - Conformance Checklist (normative)
CC‑B.5.2.1‑1 (CHR discipline). If this pattern is applied in a Context, that Context SHALL declare the Creativity‑CHR Characteristics with A.18‑style templates (type, unit/range, polarity). No new kernel terms are introduced.
CC‑B.5.2.1‑2 (Instrumented generation). Step 2 of B.5.2 SHALL either (a) invoke NQD‑Generate or (b) justify a Context‑specific generator of equivalent effect (diversity + quality + novelty with measurable Characteristics).
CC-B.5.2.1-3 (Diversity coupling). Whenever a D reading is used, it SHALL be ΔDiversity_P computed against the current candidate Pool using the C.17 definition of Diversity_P under the same Context, CharacteristicSpace, kernel and TimeWindow.
CC-B.5.2.1-Eligibility. The MethodDescription SHALL state applicable input/seed conditions. Any actual generation Work SHALL meet its independently governed authority, assignment, scope/window and permission conditions. Assess each generated candidate’s must-constraints before admitting it to the comparison/front that consumes ConstraintFit; a result about that candidate SHALL NOT be a precondition for creating it. Preserve exclusions and their reasons.
CC‑B.5.2.1‑4 (Non‑dominated candidate front). The CandidateSet MUST include the Pareto front over the declared DominanceSet. If the Context consumes the ordinary default, cite that consumed DefaultId.DominanceRegime rather than restating one local default doctrine. Every exclusion SHALL retain its actual reason. A dominance exclusion names the dominating candidate and declared coordinates; deduplication cites its equivalence or distance rule; archive retention and post-front thinning cite their policies. Preserve the complete computed front before thinning and label a thinned result separately. N, D=ΔDiversity_P, Surprise, IlluminationSummary, and similar signals enter dominance only under an explicit recorded promotion policy; otherwise they remain archive, tie-break, or telemetry signals.
CC‑B.5.2.1‑4a (Archive companion when retained exploration is in scope). If the active policy depends on retained exploration, stepping-stone retention, or open-ended search, the emitted candidate package MUST include the corresponding ExplorationArchive or cite one explicit policy id that says archive mode is disabled for that run.
CC-B5.2.1-5 (Hypothesis-led testing). Before claiming empirical corroboration, the practitioner SHALL derive the consequences needed to interpret the test and retain how the tested hypothesis was obtained. Generation SHALL NOT assign an assurance level, require a new experiment or prescribe the next reasoning contribution independently of the receiving question.
CC-B.5.2.1-6 (Coordinate comparability). Dominance SHALL use compatible readings on each declared coordinate and its polarity. Any required transformation SHALL be explicit and preserve the comparator’s relevant order distinctions; heterogeneous units across different coordinates alone SHALL NOT trigger mandatory normalization.
**CC‑B.5.2.1‑7 (Use‑Value separation). ** If Use‑Value (C.17 §4.2) is recorded outside the active DominanceSet, it SHALL remain outside Assurance scores and MAY inform decision lenses (Decsn‑CAL). If the current Context explicitly places Use-Value inside the active Q tuple, record that declaration together with its objective id / acceptanceSpec. Do not alter R/G semantics based on side-measure Use‑Value. (see C.17 §4.2 for Use-Value and ValueGain definitions)
CC‑B.5.2.1‑8 (Provenance). Each h_i in the CandidateSet MUST reference its provenance_i sufficient to reproduce scores given the same Policy(TimeWindow), score/metric versions, and DeterminismSeed?.
CC‑B.5.2.1‑9 (Secondary metrics). I (illumination) and S (surprise) SHALL be used only for tie‑breaking/reporting unless explicitly promoted by policy; the primary dominance test uses the declared DominanceSet, which under the ordinary default means the context-declared Q components.
CC‑B.5.2.1‑10 (Cell capacity & ε). If K>1 or ε>0 are used, the values MUST be declared and recorded in provenance; any thinning AFTER recording the front SHALL be documented in the DRR.
CC-B.5.2.1-11 (Dominance set). If the Context consumes the ordinary default DefaultId.DominanceRegime, the active dominance set SHALL be the declared Q components and provenance SHALL cite that consumed default plus the active C.19 policy or lens id. Any Novelty@context or ΔDiversity_P tie-break SHALL be named by that policy and use a constituted result on a compatible basis; an unused optional reading need not be produced. Promotion into dominance SHALL be explicit and recorded with the policy id.
B.5.2.1:7 - Cognitive Load & Kernel Growth Budget
For engineers/managers (user cognitive load).
- Added steps: selecting descriptor Characteristics and granularity; reading the returned front. Start with front membership; consult dominated entries when their exclusion or retained archive role matters.
- Mitigations: a compact comparison note or table can suffice. Keep the required coordinate meanings and provenance available, and reuse applicable Context grids and metrics.
- Reader quickstart (engineer‑manager): (1) Pick 2–3 Q characteristics aligned to the anomaly + a simple CharacteristicSpace (2–4 dimensions). (2) Accept defaults for
NoveltyMetric, grid granularity, andK=1. (3) Run NQD‑Generate to a fixed budget; inspect the front under its declared Q coordinates. (4) Apply Step 3 filters; log decisions in the DRR.
For the framework (kernel growth).
- Zero new primitives; only a CHR import and a Method. Passes A.11 minimal‑sufficiency.
B.5.2.1:8 - Placement in the Reasoning Cycle (ADI)
This pattern structures candidate hypothesis exploration within B.5.2. A receiving use determines whether deduction, evidence acquisition, assurance or action choice is needed next. Actual development transitions meet B.5.1’s project and domain conditions; a conjecture does not itself make that transition.
B.5.2.1:9 - Context‑Level KPIs (optional, informative)
Contexts may monitor these—not as gates, but to improve practice:
- Profile-specific assurance progression (optional). When a receiving domain uses an assurance-level profile, report the fraction of cycles whose candidate meets a named level under that profile within the policy window. Name the claim, use and satisfying evidence; omit this KPI when no such profile is used.
- Frontier‑Hit Rate (FHR). % of cycles where the chosen candidate lies on the Pareto front over the declared
DominanceSetat selection time; track novelty/diversity contribution separately as archive, tie-break, or policy-promoted evidence. - Coverage Gain (ΔI, report). Change in the illumination summary (coverage map/%filled cells) per cycle (how much of the descriptor space is now “lit”).
- Exploration Cost Ratio (ECR). Compute/time spent in NQD‑Generate divided by downstream Shape/Evidence cost saved (tracks whether the pattern pays for itself).
- Refutation Learning Yield (RLY). Among refuted candidates, % that added new coverage or raised SurpriseScore—turning “failures” into map‑building.
B.5.2.1:10 - Worked micro-example: explanatory rivals and a separate next action
Question and case facts. In a constructed service case, O1 is a latency rise above eight concurrent requests, O2 an increase in blocked threads, O3 a higher cache-miss rate, and O4 normal latency in a serial replay. The question is what explains this contrast. These are stipulated teaching inputs, not empirical results about a real service.
Construction. Declare hypothesis grammar v1 with three mechanism flags: lock contention, cache churn and scheduler stalls. The seeds are A, a lock-contention explanation, and B, a cache-churn explanation. NQD-Generate enumerates two declared variations: combine A with B to construct C, an interacting lock/cache explanation; replace A’s mechanism with scheduler stalls to construct D. The finite budget is four hypotheses including the seeds. Provenance records each seed, constructor and resulting claim. The comparison’s must-constraints are that a candidate addresses these service observations using the declared mechanism grammar and makes a discriminating prediction. All four pass after construction.
Coordinates and comparison. Q has two ordered count Scales: predicted observations among O1–O4, maximized, and auxiliary assumptions not established by the case facts, minimized. Prediction coverage is calculated under each candidate’s stated auxiliary assumptions; it is not independent confirmation. A predicts O1/O2/O4 with one unverified lock-scope assumption. The seed cache model B predicts O1/O3 from the stipulated inputs with no additional assumption. C predicts all four using the lock-scope and lock/cache-coupling assumptions. D predicts O1/O4 using unverified scheduler-threshold and recovery assumptions. Their complete comparison is:
| Hypothesis | Descriptor (lock, cache, scheduler) | Predicted observations ↑ | Unverified auxiliaries ↓ | Novelty | Front result |
|---|---|---|---|---|---|
| A: lock contention | (1,0,0) | 3 | 1 | 0 | retained |
| B: cache churn | (0,1,0) | 2 | 0 | 2 | retained |
| C: interacting lock/cache | (1,1,0) | 4 | 2 | 1 | retained |
| D: scheduler stalls | (0,0,1) | 2 | 2 | 2 | dominated by A, B and C |
The declared DominanceSet is exactly the two Q coordinates, with ε=0. Novelty is Hamming distance on the three Boolean flags to the preceding archive containing A only; it is an integer count from 0 to 3 and stays outside dominance. The descriptor grid has one cell per flag tuple, K=1. Exact duplicate claims are removed; none of these four is a duplicate. D’s scheduler cell is retained under the stated stepping-stone policy even though D is dominated. No D, Surprise or IlluminationSummary reading is needed in this example.
The complete front is {A,B,C}: each trades prediction coverage against auxiliary assumptions. C.18 records that front separately from the retained archive {A,B,C,D}, and its generation record names this NQD-Generate procedure and the seed/operator provenance. No front thinning is applied.
Qualified abductive result. For the present question about blocked threads, B.5.2 compares candidates that explain O2 with at most one unverified auxiliary assumption. A meets that stated plausibility criterion; C needs two, while B and D leave O2 unexplained. A is the qualified prime conjecture, conditional on the lock-scope assumption. Evidence that the blocked threads never wait on that lock would defeat it. Generation and the coordinate counts supply no assurance level or empirical corroboration.
Next-use choice. The separate C.11 question is which available diagnostic action fits a one-hour budget. Reading the existing lock traces takes one hour and addresses A’s open assumption; the combined intervention needed for C takes three hours. Under the declared criterion of addressing the current blocked-thread question within that budget, choose the trace reading and decline C’s intervention for this action. C remains a front member and D remains an archive stepping stone. This choice authorizes no performance beyond its independently applicable permission conditions.
B.5.2.1:10a - Trade‑offs & mitigations
- Cognitive effort. Interpreting Pareto sets and coverage maps adds overhead. Use the compact comparison view in §7 with its coordinate meanings and provenance.
- Locality. Novelty/diversity are context‑local; Cross‑context reuse requires re‑measurement or an explicit mapping. This pattern does not define Cross‑context operational controls.
- Not a magic idea machine. Abduction remains human/agentic; the pattern structures search, it does not automate insight. B.5.2 supplies the explanatory-hypothesis contribution; B.5 selects the next needed reasoning contribution.
- Metric gaming & collinearity. Avoid making N and S redundant by policy; when strong collinearity is detected, freeze one as informative only and record rationale in the DRR.
B.5.2.1:11 - Related Patterns
- Extends: B.5.2 Abductive Loop (Step 2/3 operationalization).
- Driven by / feeds: B.5 Canonical Reasoning Cycle, B.4 Evolution Loop (Observe/Refine).
- Uses: A.17/A.18 for characteristic discipline and B.5 for choosing reasoning contributions. May refer to Context‑specific MAP‑Elites/novelty‑search implementations in the MethodDescription. Independent conditions for actual Work remain applicable; this pattern adds no universal gate to theoretical comparison. C.17 (Use‑Value / ValueGain, normative definition).
- Respects: A.11 (no kernel growth beyond CHR template import + Method).
B.5.2.1:End
B.5.3 - Interpret Domain Vocabulary for an FPF Claim (Domain-Concept Bridge)
B.5.3:1 - Problem Frame
FPF keeps a small set of admitted U-kinds, ontics, slot relations, mechanisms, characteristics, methods, work values, epistemes, and publication-use relations. Working domains use their own words. A thermodynamicist says “system”, “macrostate”, “control volume”, and “free energy”; a safety engineer says “hazard”, “mitigation”, and “assurance case”; a software team says “service”, “endpoint”, and “release”.
Those words are useful. The problem starts when one local word is silently treated as a new root kind, a role assignment, a characteristic, a method, a work occurrence, an evidence relation, or a publication claim without saying which FPF value the claim uses.
B.5.3:2 - Problem
How can FPF let project teams keep domain vocabulary while preserving the current FPF ontology? A dictionary-style alias is too weak because it only says that two labels are being associated. It does not say whether the claim concerns an entity, a kind, a slot filler, a characteristic coordinate, a role assignment, a method, a mechanism, a work plan, a performed work occurrence, an episteme, a publication-use relation, or an evidence-use relation.
B.5.3:3 - Forces
| Force | Tension |
|---|---|
| Domain fluency vs. ontological parsimony | Teams need familiar words, but FPF must not grow a new root kind whenever a local term appears. |
| Same word vs. different claim | The same expression can make different local claims in different sources or schemes and can point to different FPF values. Spelling alone decides none of them. |
| Meaning recovery vs. role overuse | Some domain uses concern a system-role kind or assignment; many concern another value or relation. Recover the claim before choosing the terminology. |
| Small result vs. hidden ontology | The result should be as small as the use permits, yet still expose any real kind, relation, loss, and return condition instead of hiding them behind a synonym. |
B.5.3:4 - Solution
Use this bounded interpretation move when domain vocabulary leaves the FPF claim unclear.
- Start from the exact expression, source, edition, and relevant passage. Use F.0.1 to recover the source-local claim. Recover an F.17 cell and test its basis relation when the current claim needs them, including when an F.9 Bridge is claimed. Add a durable term row only when the receiving use needs that packaging under F.17.
- Ask which exact FPF value or relation the current claim needs, then use the pattern that defines or constrains it. For example, the answer may concern a System, characteristic, Method, Work occurrence, episteme, system-role assignment, or evidence-use relation; the list is illustrative, not a set of new bridge kinds.
- If the use really needs a new kind, apply E.24.UK and C.3. A familiar expression, table row, or diagram label supplies no kindhood.
- If the recovered source-local claim already answers the question, return it and stop. If a receiving use must relate two distinct local-sense claims, use F.9 to test whether an exact Bridge between their F.17 cells actually obtains. Shared spelling, a mapping table, or a completed card proves no such relation.
- State the receiving use separately. Name the direction, scope or applicability boundary, tolerated loss, evidence or reliance basis, and reopen condition only when each changes that use. The semantic relation alone neither authorizes nor performs the use.
- When role wording is material, use E.10.ROLE and A.2 to distinguish a local system-role kind, classification, assignment, participation, responsibility, or ordinary language before making the direct claim.
The practical result can be one readable sentence. Use a note, row, or card only when a later reader or tool needs durable packaging. The package describes the result; it does not create the FPF value, local meaning, relation, or permitted use.
An alias says only that L is another name for V. A completed B.5.3 move instead says what the exact source means here, which FPF value the current claim uses, whether any direct relation actually obtains, and what the named receiving use may rely on. Thus a component called “sensor” may lead to a System claim, measurement-capability claim, publication claim, or system-role-assignment claim; the expression alone chooses none of them.
B.5.3:5 - Archetypal Grounding
A thermodynamics team models a heat engine.
- In the cited thermodynamics source, “thermodynamic system” names the engine under concern together with the boundary and state variables relevant to that local claim. Recover the same System already used elsewhere; the expression does not automatically name a kind or assignment.
- “Macrostate” makes a source-local claim about a state description or characteristic bundle over, for example, pressure, volume, temperature, and particle amount. State the effective scheme and units directly; recover an F.17 cell and its basis relation when the receiving claim needs them, and add a durable term row only when reuse needs one.
- “Control volume” may name a boundary or region relation. The claim must say which entity is bounded and which exchanges cross the boundary.
- “Free-energy objective” may name an objective claim, characteristic, or selection criterion. The claim must say which FPF value the decision uses.
- If the engine control System is assigned a locally defined heat-source-controller system-role kind, establish a separate obtaining occurrence of the declared
U.SystemRoleAssignmentspecies. The source-local meaning, classification, assignment, Work, claim scope, and time window remain separate.
Current physical-system claims in this example use A.1 for system identity. A.14 distinguishes the part and whole relations actually claimed; A.22 defines how to identify a selected organization of already established constituents and direct relations. A.3.4 identifies an actual bounded change when one is claimed. Use B.1.6 for any work-resource aggregation needed here and C.16 for measured characteristics.
The control-volume boundary and exchange claims require the applicable thermodynamic rule. If that rule is unavailable, retain the local description and name the missing rule rather than asserting the relation. Planned C.1 (Sys-CAL) may later consolidate that guidance; it is not a current governor.
What this achieves:
- Domain constraints become reviewable without turning every domain word into a root kind.
- Verification can use the direct pattern for the recovered value: boundary discipline for a control volume, characteristic-space discipline for state variables, system-role-assignment discipline when an assignment is claimed, and publication-use or evidence-use discipline for reports and dashboards.
- The heat engine remains the same System when a power-plant architecture, finance model, safety case, and thermodynamics model all discuss it. Any actual F.9 relation states how two distinct local meanings correspond; the named receiving-use claim states which losses block that use.
The same expression can be reused in an architecture view, a requirements document, and a simulation model only after each local claim identifies its actual value. If the claims use distinct local meanings, test any required F.9 relation and its receiving use separately.
Conformance Checklist
- CC-B5.3.1 (Recover the FPF value used by the claim): The result names the exact FPF value or relation used by the current claim before treating a preferred expression as reusable.
- CC-B5.3.2 (No kindhood by spelling): A local expression, dotted name, table row, or diagram label does not become a U-kind. A needed durable kind requires its own E.24/E.24.UK and C.3 settlement from independent ontic and membership evidence.
- CC-B5.3.3 (Role boundary): When role wording changes the claim, E.10.ROLE first recovers whether it means a local system-role kind, classification, assignment, participation, responsibility, or ordinary language. Each resulting claim then uses its own FPF pattern.
- CC-B5.3.4 (Relation and use boundary): Claim an F.9 Bridge only when its exact endpoint cells and predicate make it obtain. State the receiving use, direction, applicable scope, tolerated loss, evidence or reliance basis, and return condition separately; shared spelling proves none of them.
- CC-B5.3.5 (Description boundary): If the local expression appears in a requirement, diagram, dashboard, report, or publication, use the direct description and publication patterns to keep the described entity, description episteme, publication form, and carrier distinct.
Common Anti-Patterns and How to Avoid Them
| Anti-Pattern | What it looks like | Better FPF move |
|---|---|---|
| Subtype explosion | Every domain expression becomes a new root kind. | Keep the source-local claim as wording unless E.24.UK and C.3 establish a needed kind from independent ontic evidence. |
| Magic synonym | A table says “sensor = component” and is treated as identity or permission. | Recover each exact local claim and the FPF value used. If two distinct cells must be related, test the actual F.9 relation and judge the named use separately. |
| Role-for-everything | Evidence, status, local meaning, responsibility, and document use are all called roles. | Apply E.10.ROLE, then name the actual value or relation and use its direct pattern. A local system-role kind or assignment is only one possible result. |
| Description collapse | A diagram label is treated as the entity, interface, or method itself. | Keep entity, description episteme, representation scheme, and publication form distinct. |
B.5.3:6 - Consequences
| Benefits | Trade-offs / Mitigations |
|---|---|
| Domain language stays usable: Experts keep familiar words without forcing every word into the kernel. | Recovery overhead: A load-bearing expression needs its exact source-local claim and governed value. Keep the returned explanation short; recover F.17 cells and their basis relations for claims that need them, including F.9 Bridges, and add durable rows only when reuse needs them. |
| Kernel stays lean: New kinds require explicit admission and ontic support. | More precise modeling choices: The bridge may reveal that one local word hides several FPF values. That is the point: split them before they drive work. |
| Cross-document clarity: Requirements, diagrams, dashboards, simulations, and reports can be compared without pretending they are the same artifact. | Need for an exact use boundary: Do not reuse a source-local claim or semantic relation in another project, scheme, scope, or action without checking the actual changed values, tolerated loss, and reliance basis. |
B.5.3:7 - Rationale
This pattern implements open-ended parsimony: FPF can use many domain vocabularies without turning every useful expression into a kernel kind. It recovers the source-local claim first, routes the needed FPF value to its direct pattern, and introduces an F.9 Bridge only for an actual relation between distinct local senses.
B.5.3:8 - Relations
- Builds on:
A.2,A.6.5,C.3,E.24.UK,F.0.1,F.1,F.2,F.3,F.5,F.8, andF.17. - Coordinates with:
A.7,C.2.1,E.10.ROLE,E.17,A.13,A.15,B.3.3,F.7,F.9, and the direct domain-specific CHR, LOG, and CAL patterns. - Used when: a project must recover what an exact source expression means for one FPF claim, or must relate two distinct local meanings for a named receiving use without confusing the wording, governed value, semantic relation, and use.
B.5.3:End
B.5.4 - Recognize a Reusable Concept in a Concrete Situation
Type: Method-description pattern Status: Candidate Normativity: Normative unless marked informative
B.5.4:1 - Problem frame
Use this when you understand a concept’s explanation but cannot yet connect it to an unfamiliar situation. You need to interpret what is happening before you can explain it, construct a model or choose the next observation.
Begin with the question this interpretation should help answer. Identify what you can point to or describe, recover the relations a candidate concept requires, and construct their correspondence in this case. The first useful result is an interpretation with a consequence that guides the next action.
This requires an accessible domain account and enough background to understand it. If the concept itself is unfamiliar, obtain that explanation first. If the interpretation is settled and only a calculation remains, use the appropriate calculation Method.
B.5.4:2 - Problem
A familiar textbook question supplies cues that an encountered situation may lack. Knowing what polarization means can coexist with being unable to use it while looking at water. Even recognizing the material leaves the surface, directions and relations to be identified.
The missing contribution is the passage from the encountered situation to a usable interpretation. A correct interpretation should make a difference to an explanation, prediction, construction or action.
B.5.4:3 - Forces
- A concept directs attention toward particular relations, while the first description of a situation can obscure them.
- A sketch can expose a correspondence; a premature equation can leave its variables uninterpreted.
- A familiar example helps learning, while changed conditions reveal which relations the learner can recover.
- A useful interpretation depends on domain knowledge, whose acquisition may cost more than the immediate recognition work.
B.5.4:4 - Solution
- Name the question. Say what the interpretation should enable: reducing glare, explaining a changed reading, arranging compatible activities or choosing an observation. This determines which distinctions matter.
- Describe the situation at a useful scale. Indicate the relevant region, objects, time and conditions. Separate available observations from your proposed explanation. Try another boundary or viewpoint when the first description hides an interaction.
- Recover the candidate concept through its relations. Consult its explanation, examples and conditions. Identify its participants, how they are related, and a consequence that distinguishes its application from a plausible alternative. Use the domain account to supply knowledge omitted by a short definition.
- Construct the correspondence. Point to what supplies each participant here and explain the relations between them. Use a sketch, gesture, annotated observation or short account. If mathematics helps, connect each variable or mathematical object to its interpretation and identify consequential simplifications.
- Derive and examine a consequence. Work out what should follow in this situation. Vary one relevant condition and compare the resulting prediction with an available observation, counterexample or inexpensive trial. Where competing interpretations support the same sufficient action, keep that bounded answer.
- Return to the question. Give the explanation, construction, action or next observation now supported. When a consequence fails, revisit the object boundary, relation, condition, representation or candidate concept that produced it. Identify the missing domain contribution if the available account cannot resolve the question.
The result can be an interpreted sketch and a next action. Record the reasoning when another participant or later use needs to recover it.
For capability assessment, separate the correctness of a supplied interpretation from the reader’s ability to select and construct it. Give a consequentially changed situation before supplying its decisive conceptual cue; retain the references and assistance allowed in the intended work.
B.5.4:5 - Archetypal Grounding
B.5.4:5.1 - Glare from water
You want to reduce glare in an image. Identify air, water, a selected interface patch, incoming light and the direction from that patch to the camera. Draw the local normal and incidence plane. For unpolarized illumination of a smooth dielectric interface at Brewster incidence, reflected light is polarized perpendicular to that plane. Rotating a linear polarizer before the camera changes the transmitted reflected contribution. This is the domain relation supplied by Feynman, I.33, §33-4.
The interpretation tells you what to adjust. Moving the viewpoint changes incidence; ripples change local normals, so a single planar sketch may need several patches. Inspect a changed view and determine whether the proposed adjustment still follows.
B.5.4:5.2 - Recognize a conflict relation before colouring a graph
A laboratory must place three tests in two simultaneous-run slots. Its operating conditions say that A and B need the same exclusive fixture throughout a run; B and C need the same exclusive power unit; A and C can run together. There are no other constraints in this constructed case.
Represent tests by vertices and a pairwise inability to share a slot by an edge. The observations supply edges AB and BC. The construction in B.5:5.1 produces slots {A,C} and {B}; reading the result back means that neither exclusive resource is double-booked.
Now change the conditions: A and C also require the same observer throughout a run. This adds edge AC. The triangle needs three slots under these conditions; two-colouring no longer supplies an arrangement.
Consider instead three tests with independent fixtures whose shared resource is a 5 A supply. Each draws 2 A. Any pair can run together, but all three exceed the supply’s capacity. A graph with no pairwise conflict edges loses that group constraint. Retain the currents and the slot-wise capacity inequality when constructing the arrangement.
B.5.4:6 - Bias-Annotation
Answer-bearing demonstrations favour recognition from familiar wording. Obtain a changed situation when independent selection matters. Representation familiarity can also encourage premature graph, table or equation use; compare the represented relations with the constraint that actually changes the answer.
When a teacher, colleague or AI supplies the decisive interpretation, retain that contribution in any account of what the learner performed.
B.5.4:7 - Conformance Checklist
- The concrete question determines which distinctions matter.
- The interpretation identifies the participants, relations and applicable conditions in the encountered situation.
- A consequence connects the interpretation to an explanation, construction or action.
- A consequential change is interpreted using the retained relation and its conditions.
- The domain account, prerequisites and permitted assistance are accessible to the intended reader.
- An independent-recognition claim is supported by an appropriately uncued attempt.
B.5.4:8 - Common Anti-Patterns and How to Avoid Them
Definition recitation. Return to what supplies the definition’s participants and relations in this case, then derive a consequence.
Representation chosen before the constraint. Compare what the representation preserves with what the use needs. In the laboratory case, pairwise compatibility leaves aggregate current to be handled separately.
A demonstrated answer credited as independent recognition. Use the demonstration for learning. For assessment, obtain a changed case with the assistance permitted in later work.
B.5.4:9 - Consequences
The practitioner obtains an interpretation they can use and revise. A mismatch becomes a particular question about an object, relation, condition or domain account. A later calculation receives identified quantities; a model receives interpretable elements; further inquiry receives a discriminating observation.
The cost is constructing and examining the correspondence. This work can be small when the relevant relations are already clear.
B.5.4:10 - Rationale
Concepts become useful through their relations to a situation. Recovering these relations and following a consequence connects interpretation to action. Reversing that passage after a failed consequence makes the interpretation correctable. A sketch and an equation can serve this work differently; their usefulness depends on the distinctions they expose.
B.5.4:11 - SoTA-Echoing
The working question is how to interpret a particular situation when a usable concept account is available but its concrete participants are still missing. For this entry, use the concept-led correspondence in steps 3–4 as a specialization of the broader first-model route in B.5:4.1.1. The broader route remains useful when the relevant relation itself has to be proposed.
Compare the two routes on :5.2 using the same operating conditions, an explanation of graph colouring, and a sketch plus the resource checks. B.5 first asks which tests and resources must remain distinguishable, then asks the engineer to propose their connection. An exclusive-resource conflict supplies AB and BC; a cheap consequence supplies {A,C}/{B}; challenging an omitted interaction can expose the shared-current constraint. That route can solve the case.
Here the reader’s stated difficulty lies inside that “propose their connection” move. Steps 3–4 work back from the understood relation: an edge joins two participants that cannot share a slot. Fill the two participants with A and B, and identify the fixture whose exclusive use makes the relation hold; repeat for B and C and check A with C. This supplies both the graph and the reason for each edge before colouring. In the 5 A variant, the same correspondence question asks what the empty graph represents: permission for each pair. Comparing it with the required permission for the whole group exposes the missing sum, 2 + 2 + 2 > 5. Both routes yield the same correct schedule; this specialization supplies the concrete relation and its operating-condition check inside the broader instruction.
The selected trade-off is more explicit participant-by-participant work where the broader instruction leaves that work to the reader. It uses the same domain account and case data; retain it only while constructing the correspondence is the difficulty. When the reader already has that correspondence, :1 returns directly to the calculation. When no usable relation has been selected, B.5’s first-model route retains the wider search. These case comparisons establish the additional instruction and its consequence; comparative learning speed and transfer remain empirical questions.
Sirnoorkar, Bergeron and Laverty (2023), §III supplies the target-to-representation, internal-reasoning and interpretation-back account used in steps 4–6. Its discussion of problem assessment, model construction and interpretation makes the broader modeling route a substantive alternative. The adaptation here unfolds the target-to-representation work from the relations in an already understood concept. Its empirical basis is two physics problem-solving cases; the scheduling comparison above is a constructed comparison of the instructions.
Kashyap and Singh (2026), §II and case B shows redrawing alongside spatial reinterpretation and continuing grounding errors in electrostatics problem solving. Adapt that contribution in step 2 and :5.1: change a viewpoint when it can reveal a needed relation, then check the relation’s physical conditions.
Reconsider this choice if an intended reader cannot fill a decisive relation from the available concept account, or if the broader modeling instruction supplies the same recoverable correspondence with less effort. Change the affected instruction or its prerequisite; a comparison showing that the explicit recovery adds no useful contribution would remove the reason to use this specialization. The optics law remains supplied by the linked Feynman account, and the laboratory consequences follow from their stipulated operating conditions.
B.5.4:12 - Relations
- C.3 supplies kind recovery, classification applicability and judgment when a classification question arises.
- C.29 helps select and interpret a mathematical representation, including its preserved and lost structure.
- B.5 connects the interpreted question to construction, inference, observation and a useful continuation.
- A.7.1 supplies consequence-guided ontological repair when a working claim gives a defeated engineering result.
B.5.4:End
B.5.PI - Initiate Inquiry from Ongoing Work
Type: Method pattern Status: Stable Normativity: Normative unless marked informative
B.5.PI:1 - Problem frame
Use this pattern to make room for a useful question in work that people or agents currently treat as ordinary. Reports arrive, calculations run, repairs succeed, and nobody asks whether the way of obtaining or using those results needs examination. Use it also when someone says that an explanation misses something but cannot yet say what. A known error, an anomaly label and a request for help are not prerequisites.
Start at a small occasion already connected with the work: preparing a handover, demonstrating a result, explaining a consequential choice, or resuming work after a change. Recover what the result is supposed to enable and examine one available episode of obtaining and using it, including the adjustments that made it succeed. A performer can do this while preparing their own work; a colleague or team can arrange the occasion. It takes access and attention, even if only briefly.
The useful result is a question with an attainable next move, an early cue retained for further consideration, or a reasoned continuation without change. Here, inquiry includes a short question to a colleague or consultation of an existing explanation; it need not become a research project. The method helps bring an unexamined part of work into consideration. It does not promise that every hidden difficulty will be found.
Use an adequate existing answer directly. When the question is already clear, use its subject method. When a known useful method merely goes unnoticed at the right moment, A.15.11 helps arrange that encounter. Continuous monitoring, statistical anomaly detection and a full audit have their own methods; they are not mandatory implementations of this one.
B.5.PI:2 - Problem
A worker receives enormous values from a familiar calculation and says, “It sometimes does that.” A team meets every deadline through repeated manual repair. An assistant answers a colleague’s objection with a familiar recommendation, then treats the colleague’s inability to name a better answer as closure. The work continues without a question about the unexplained part.
More searchable advice cannot help until something makes that advice worth seeking. “Ask for help when there is a problem” assumes the recognition that is missing. “Look for anomalies” leaves both the occasion for looking and the relevant comparison unspecified. Even a passed checklist establishes only the conditions it actually checked.
The difficulty is to let ordinary work generate a question without requiring a prior diagnosis, a permanent observer or an expert who already knows the answer. The opposite error is to manufacture a defect whenever something differs from expectation, or to turn every small uncertainty into an expensive investigation.
B.5.PI:3 - Forces
| Need | Difficulty |
|---|---|
| Begin before a problem is recognized | A worker absorbed in producing a result has no independent reason to search for another method. |
| Learn from successful work | An adaptation can reveal a dependency worth changing, or be the best available way to do the job. |
| Preserve an emerging concern | Familiar terminology and a listener’s expertise can replace what has not yet been expressed. |
| Obtain a meaningful comparison | A rare value can be valid; a routine outcome can fail its intended use. |
| Keep the whole work going | Attention, advice and investigation consume resources and can disrupt the action they support. |
| Share the work of inquiry | A participant can supply a cue without knowing its cause; another contribution must make interpretation or action possible. |
B.5.PI:4 - Solution
At an ordinary work occasion, recover the use and what it takes; compare; keep what the account misses; form a question or retain the cue; obtain a worthwhile next contribution; return to the whole work. These moves form one connected method. Enter where a contribution is missing, return when a comparison changes the question, and stop when the receiving use is settled. The links below supply particular operations, not an obligatory chain of pattern applications.
B.5.PI:4.1 - Give the work an occasion to become a question
Select a bounded occasion that does not depend on someone first reporting trouble. At an ordinary handover, for example, ask the producer to show one result and how its recipient will use it. Recover what the producer actually had to do, including work that the official account omits. In preparing your own work, follow one result through its intended use instead of merely checking that you have produced it.
Choose an occasion with some prospect of a useful comparison: a consequential decision, a result passed to another person, a recurrent activity whose effort is poorly understood, or an available contrasting case. A small agreed sample can expose something that reviewing only failures would miss. Do not require every occurrence to undergo this examination. Keep the immediate work and its constraints in view.
A performer may adopt this as a habit; a teacher, team or tool maintainer may make it available through A.15.11. For example, an existing handover conversation can include “Show what the recipient can do with this, and what you had to add to make that possible.” This question does not anticipate a specific error. A publication alone does not establish the habit or supply the conversation. If access to the result, its use or an attentive participant is unavailable, identify that missing contribution rather than claim that inquiry has begun.
B.5.PI:4.2 - Compare before deciding what is wrong
Connect the intended use with an accessible episode. Try using the result, ask its recipient to demonstrate the use, compare an available prediction with what occurred, or work through a nearby case whose consequence can be established. Include the adjustments that made a successful outcome possible. Keep observations, memories and constructed cases distinct.
Ask what makes an apparent difference acceptable or inevitable. “This always happens” states frequency; it does not establish adequacy. “The procedure was followed” supports conformance; it does not establish that the procedure answered the receiving question. Conversely, unfamiliarity does not make a result defective. A symbol that looks like a numerical answer may be an agreed status marker; an adjustment may preserve a necessary constraint.
Use subject knowledge to interpret the comparison. When that knowledge is missing, the question may concern what the result means or which conditions justify its use. Do not invent the missing observation or explanation. If the available account already explains the difference and supports the intended use, continue the work without creating a problem.
An anomaly is a difference relative to an account, expectation, comparison class or intended use that merits consideration. Make that reference clear when it affects the next move. Statistical rarity, a breached requirement, a felt mismatch and an unused possibility are different reasons to look. Problematization develops or questions what is taken for granted so that a consequential question becomes possible. It can change the comparison itself: something previously normal can become questionable under a better account. Anomaly detection therefore need not be completed before problematization starts.
B.5.PI:4.3 - Keep the part that the familiar account loses
Retain the episode, expression or contrast that cannot yet be explained. B.5.EA helps a participant develop a distinction when familiar words conceal it. The listener should try the proposed interpretation on the original case: if following the offered advice would leave the concern untouched, reconsider the interpretation. Use the conversation, document or work already available before asking the participant to collect more evidence. Ask for a missing fact when it is actually needed; do not require the participant to supply the diagnosis that the joint work is meant to develop.
For example, advice to make a help form clearer does not answer why someone who sees no problem would open it. Preserve that difference even when neither participant can yet state a complete alternative method. An objection warrants examination of the account; it does not make the objector’s causal explanation true.
An early cue is something already noticed as worth retaining before its meaning or continuation is settled. It is not yet a confirmed anomaly or a formulated question. Keep the passage, observation or rough expression that lets someone return to it. The existing conversation may suffice. A.16.1 supplies deliberate preservation when otherwise the cue would be lost; B.4.1 can make possible continuations explicit after stabilization when someone needs that contribution. Neither requires every exchange to acquire a new form or route record.
Stop here if only the cue is recoverable and further articulation is presently unproductive. Identify an attainable return occasion when one is available, without inventing a commitment or declaring the concern resolved.
B.5.PI:4.4 - Ask from the situation before naming a solution
State what the work should enable, what comparison or experience raised the question, under which conditions, and why the answer could matter. Ordinary words are enough: “How can this figure help price the next batch when it has no numerical value on some days?” is a usable question without the phrase “division by zero”. Search a library or ask a colleague using the situation and needed result. A PatternID is one way to obtain an answer after its relevance becomes intelligible, not a prerequisite to inquiry.
Let the first answer change the question. A calculation can be correct for the wrong quantity. An explanation can answer an easier question than the one the recipient needs. Return to the original use before accepting either as closure. B.5.QD develops a consequential question when the initial one needs reconstruction; B.5.QD.CF examines assumptions behind an apparent conflict. Use those contributions only while the question needs them.
An adequate known explanation, instruction or direct correction may finish this use. If the question needs a new construction, explanation or test, B.5 connects the reasoning contributions. Keep later investigation and problem formulation under their own conditions; a provisional question need not be promoted immediately to a fully specified Problem or research programme.
B.5.PI:4.5 - Obtain a continuation that can actually be used
Choose what is missing now: an existing answer, one discriminating comparison, accessible expertise, a capability to develop, or a larger inquiry. Judge the effort against what the answer could change in the encompassing work. C.11.DUA examines burdens imposed by advice; C.11.CRC compares an attainable change with continuing as now. They help choose an intervention, not decide whether a participant is allowed to voice an unresolved concern.
Carry an answer back to the receiving use. Does it let the recipient act, understand or ask a better question? If a small comparison can discriminate between plausible explanations, make that comparison before prescribing a larger change. If the performer understands the needed action but cannot execute it, obtain support or a suitable learning method; repeating the question does not develop the capability.
If no worthwhile improvement is available, retain the current adaptation with its relevant conditions. If inquiry cannot be afforded or a needed observation is inaccessible, say what remains unknown and what that means for the current use. Inability to investigate does not certify adequacy. A retained cue and an available later occasion can be the bounded result. Where consequences require a decision now, obtain it through the applicable subject and authority rules rather than letting unresolved uncertainty silently authorize continuation.
B.5.PI:4.6 - Keep the opening usable while the whole work continues
After use, examine whether this occasion brought something consequential into consideration and whether the result justified its burden. Change an unhelpful question, move a disruptive occasion, obtain a missing response, or remove a ritual that produces only ticks. Passing an execution checklist can support selected claims; it does not close concerns outside those claims. A known-condition checklist is designed through A.15.11, while the present method keeps a way to question what that list leaves unexamined.
Make it possible to respond. A worker with no access to receiving outcomes cannot inspect them. A request that nobody can answer does not supply assistance. When raising a concern is punished, changing the conditions of joint work may be necessary; asking for greater personal vigilance does not repair those conditions. Use the smallest attainable support that answers the need, without assuming a permanent observer.
Producing a result, keeping it usable and learning from the attempt can be enacted together in the same action. B.1.5 and B.1.5.EW help recover the relevant Method composition and how those actions enact encompassing work, including the constituent capabilities and receiving use. In a time-critical or bodily action, a pause, later replay or another participant’s observation may preserve the whole better than an added question during execution. Human learning and changes to an AI system’s access, instructions or training require their respective methods. An answer obtained with supplied guidance is not evidence of later independent recognition.
B.5.PI:5 - Archetypal Grounding
These are constructed cases with stated conditions, not measurements of the method’s effectiveness.
B.5.PI:5.1 - An on-time handover hides recurring work
A team hands over a completed daily schedule. Nobody requests an audit: the recipient receives the schedule on time. While preparing an ordinary handover, the producer follows one entry from the incoming list to the recipient’s use. They show that they retype twelve equipment names from memory because the incoming abbreviations differ from the recipient’s names. The deadline is met because the producer knows both conventions.
The listener first says, “Make the deadline reminder clearer.” Applying that suggestion would leave all twelve retypings and the reliance on one person’s memory unchanged. The producer cannot name a better method, but can point to those transformations. Keeping that contribution changes the question from punctuality to whether the recipient can identify the equipment without repeated reconstruction. The producer’s skill remains a successful adaptation, not evidence of misconduct.
The next question is small: “Can we make the correspondence available without losing distinctions the recipient needs?” In this case an authoritative list already exists. The two participants compare twelve entries with it; ten have a unique correspondence, while two abbreviations denote different equipment in different buildings. A single global replacement would conceal that difference. They retain the building context, give the recipient the resolved names and leave the two unresolved entries for the person who can supply their locations. The receiving schedule is checked by identifying the intended equipment, not by counting replaced labels.
For repeated handovers, an available mapping keyed by name and building may remove some reconstruction. Whether to prepare and maintain it depends on actual use and effort. A one-off schedule with no further receiving difficulty can keep the manual translation. In either case the inquiry returns to the schedule: the recipient can use the supplied identities, or knows which entries still need a location. It need not create a new organization-wide programme.
If the recipient instead demonstrates that both naming conventions are already understood and the retyping merely changes typography, the proposed identity problem disappears. Ask whether the extra effort is worth removing; do not preserve the first diagnosis merely because it motivated the comparison. If neither receiving use nor the authoritative list is accessible, retain the dependency on memory as an early cue and obtain access when worthwhile. No claim of safe replacement follows from that cue alone.
B.5.PI:5.2 - A familiar calculation produces an unusable figure
A daily report divides total operating cost by completed units. On a day with zero completed units, the software displays an infinity marker. The preparer treats it as normal because it happens regularly. During a handover for pricing the next batch, the preparer tries to explain what price decision that entry supports. The gap becomes apparent through the use, before anyone names a division rule.
An existing mathematical explanation establishes that the quotient has no real-valued result when the denominator is zero. That answer removes a false numerical reading; it does not choose a pricing method. The receiving question now concerns which costs, output and period can support the proposed price. Obtain the appropriate accounting and modeling contribution rather than replace the marker with an invented number.
If the receiver shows that the marker already means “no production”, is never used in pricing, and the pricing calculation uses appropriate separate inputs, the unfamiliar display need not be a defect. The relevant use is already explained. Altering the software solely to remove the unusual value would answer a different question.
B.5.PI:5.3 - An objection cannot yet become a named problem
A reader says, “This guide misses something,” and points to its instruction to ask for help when trouble occurs. The assistant proposes a more visible help button. The reader objects again but cannot name the missing method.
The assistant returns to the available exchange and tests its own advice. A person who regards the work as ordinary would still have no reason to use the button. This comparison preserves a difference between reaching help and finding a reason to seek it. The assistant can now examine ordinary work occasions instead of requiring the reader to prove a new diagnosis.
If the reader can only point to the phrase and must leave, keep that passage and the unresolved concern in the existing conversation. A usable question may come later. Neither a polished paraphrase nor the reader’s departure proves that the concern has been answered.
B.5.PI:6 - Bias-Annotation
An expert can mistake the absence of their preferred method for a defect. A familiar institution can instead normalize costly adaptations or silence a contribution because it has no accepted vocabulary. Test both interpretations against what the work enables. The person who notices a difference need not know its cause; the person who supplies an explanation still needs to show that it answers the original use.
B.5.PI:7 - Conformance Checklist
For guidance or an application claiming this method, examine the consequential conditions:
- The entry can occur without a recognized error, a diagnostic term or a request for an audit; its actual occasion, access and attentional demand are recoverable.
- The comparison retains the receiving use and what it took to obtain the result, including successful adaptations when they matter.
- A proposed interpretation is tested on the original case; the participant is not required to invent a diagnosis before their concern can be examined.
- An early cue can remain open without being mislabeled a confirmed anomaly, Problem or selected investigation.
- The continuation can obtain a usable contribution, identify missing means, or stop without change under stated conditions.
- Conformance, result achievement, adequacy for the receiving work and completeness of the description remain different claims.
- The result returns to the encompassing work, and any claim about later independent use has its own basis.
These checks cover the stated method, not every possible anomaly in the work under consideration.
B.5.PI:8 - Common Anti-Patterns and How to Avoid Them
Wait for the worker to complain. Use an ordinary demonstration or handover to connect a result with its use before a complaint exists.
Normalize by repetition. Compare the recurring feature with the use it serves; frequency alone settles neither harm nor benefit.
Solve the listener’s substitute question. Apply the proposed remedy to the originating episode and retain what it leaves untouched.
Require a named defect before listening. Work with a recoverable fragment or early cue. Interpretation and warrant can follow separately.
Turn every difference into a project. Use an adequate explanation directly, make a small useful comparison, or retain the present arrangement. An inquiry must earn its additional burden.
Treat a passed checklist as comprehensive adequacy. State what was checked and keep consequential concerns outside the list available for inquiry.
B.5.PI:9 - Consequences
An apparently routine task can yield a question that a search service, colleague or pattern library can help answer. Successful adaptations and inarticulate objections can contribute without already being recognized defects. The work gains a connection between doing, questioning and obtaining another method.
This consumes attention and sometimes exposes a need that cannot yet be met. False leads and imposed interpretations remain possible. The method supplies a way to begin and return, not a guarantee of discovery, learning or organizational improvement. Its use depends on accessible work, interpretation and an attainable response.
B.5.PI:10 - Rationale
Detection presupposes something to compare and attention to a difference. Ordinary work can supply both at an occasion where its result must mean something to another action. Recovering successful adjustments reveals dependencies that an output check alone omits. Asking what makes those dependencies necessary allows both criticism and justified retention.
The whole method is longer than a reminder because its intermediate results differ. A selected occasion makes a comparison possible; the comparison may supply an early cue; articulation can develop a question; the question makes a relevant answer findable; use of that answer tests whether the original work was helped. None of these contributions can be replaced merely by naming the next pattern. The sequence can shorten, loop or stop as the available contribution changes.
B.5.PI:11 - SoTA-Echoing
The practice question is how ordinary work becomes open to useful inquiry before its performer recognizes a problem. The synthesis combines problem detection, questioning of assumptions and examination of successful work. It does not generalize a laboratory effect or one industrial practice into guaranteed autonomous discovery.
Interpretation, not only signal strength. Klein, Pliske, Crandall and Woods, Problem detection (2005), is a historical account of how context and interpretation affect recognition. It motivates comparing accounts and revisiting explanations in §§4.2–4.3. A technical detector is a serious alternative when a suitable representation and criterion already exist. Ruff et al., A Unifying Review of Deep and Shallow Anomaly Detection (2021), makes those technical choices explicit. Its detector families do not decide what an unexamined work practice should regard as worth questioning. Use such a detector for its stated object, rather than substitute statistical rarity for practical inadequacy.
Question the premise that makes a situation ordinary. Alvesson and Sandberg, Generating Research Questions Through Problematization (2011), supplies a historical method of articulating and challenging assumptions, including one’s own. Adapt that operation in §4.2 and §4.4. Their research-literature setting does not make novelty or academic audience interest sufficient practical value. A routine explanation remains preferable when it already settles the use.
Examine what successful work required. Marques et al., Learning from normal work in complex sociotechnical system—Case in midstream operation (2025), uses facilitated accounts of ordinary work, adaptations and constraints. This informs the non-incident entry in §4.1 and the handover case. The situated industrial study does not demonstrate spontaneous inquiry by an unsupported performer; neither its interview duration nor a permanent facilitator is prescribed here. Tucker, Edmondson and Spear, When Problem Solving Prevents Organizational Learning (2002), supplies a historical contrast: local workarounds can sustain output while leaving recurrent conditions unchanged. Retain the adaptation’s contribution before deciding whether to alter those conditions.
A noticed discrepancy is not yet learning. Bascandziev, Thought Experiments as an Error Detection and Correction Tool (2024), shows the importance of representation and reasoning in bounded force-and-motion tasks. Theobald et al., Do reflection prompts promote children’s conflict monitoring and revision of misconceptions? (2024), distinguishes effects on monitoring from later learning and transfer. These comparisons support separating encounter, interpretation and later capability in §4.6; they do not establish the same learning mechanism in humans and AI systems.
Reconsider the arrangement when a simpler ordinary interaction supplies the same contribution, repeated comparisons leave the original concern untouched, attention costs exceed the attainable benefit, or missing access makes the intended operation impossible. More prompts alone do not resolve these failures.
B.5.PI:12 - Relations
- A.15.11 arranges an encounter with a potentially useful method, including this inquiry method, and supports known-condition execution checklists. It does not supply the question developed here.
- B.5.EA develops a correctable expression; A.16.1 preserves an early cue; B.4.1 makes grounded continuations explicit when needed. Their results can remain provisional.
- B.5.QD, B.5.QD.CF and B.5 develop questions, examine conflicting assumptions and connect reasoning contributions after or during this entry.
- C.22.PFR, C.22.2 and E.18.1 govern problem-side distinctions, inspectable problem formulation and carrying an accepted formulation into work. They do not require every early cue to be such a formulation already.
- C.11.DUA/.CRC help choose a worthwhile continuation; A.15.7 selects a next action under current conditions. E.11.PUA returns a selected pattern’s result to its receiving use and can reopen inquiry here.
- B.1.5 and B.1.5.EW recover simultaneous constituent and encompassing methods; E.23.CDI frames capability development when the needed contribution cannot yet be performed.