B.1.3 - Knowledge Aggregation (Γ_epist): Synthesis and Target-Scheme Compilation
Status: Stable
At a glance. Use B.1.3 to compose identified U.Episteme inputs into one knowledge aggregate while preserving their provenance, interpretation conditions, conceptual mappings, and contribution to its warrant.
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.
Mereology and identity (A.14/C.2.1). Use ConstituentOf for semantic parts. Measure a text or data split on its selected expression or carrier under C.2.1 and E.24.PUB; use PortionOf only when those measured entities independently meet A.14:5.1. Use PhaseOf only 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 assert EpistemeEditionRelation only 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 composes the episteme’s structure and semantics. Use Γ_ctx, Γ_time, or Γ_work for the corresponding questions after recovering their required inputs.
-
Mereology (A.14). For knowledge composition we primarily use ConstituentOf (logical or semantic parts), UsageOf or ReferenceTo (external reliance), and each collection’s 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 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 dated
U.Workoccurrence, stop with the ordinary sentence. If it does, recover each performer’s A.13 core and independently admit the occurrence under A.15.1. Add F.6 only when the receiving use also needs 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 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 when the recovered facts leave a question about whether the existing whole still carries the current claim or a new whole must be identified; 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. Combining mismatched concepts without explicit mappings and their interpretation limits can change or obscure the resulting claim despite its formal appearance.
- 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 mappings and—when meanings cross—an F.9 Bridge plus a separately warranted bounded-use claim, 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 contribution of complementary and alternative support. |
| Universality vs. Domain nuance | A common composition account across domains ↔ 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, 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
-
U.Episteme — a claim-bearing knowledge holon. C.2.1 identifies it through the participant-determined
EpistemeConstitutionRelationover<claim content, EntityOfConcern, effective ReferenceScheme>. These three participant identities determine its identity. Claim content and ReferenceScheme are epistemic constituents; EntityOfConcern is the independently governed subject related through aboutness.Empirical grounding uses the separate
EpistemeEmpiricalGroundingRelation, while text, code, figures, datasets, SCR/RSCR references, publication forms, and presentation carriers remain separately governed provenance, representation, publication, or carrier material. -
Constitution participants and typed positions. When the receiving use needs a reusable designation of the EntityOfConcern, C.2.1:4.2.1 supplies
EntityOfConcernSlotwithValueKind=U.EntityandrefMode=U.EntityRef. It is a participant meaning in the relation declaration, not an internal slot of the episteme. Claim content and effective interpretation rules remain necessary constituents without being additional SlotKinds. A receiving relation declaration that needsClaimGraphSlotorReferenceSchemeSlotmust supply each independently governed ValueKind and A.6.5 SlotSpec; the constituent name alone provides neither. -
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 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, and reliance separate. Retain a CL summary when the receiving rule uses one, including the applicable KD-CAL substitution or cross-notation reasoning rule in C.2. CL alone neither grants the use nor supplies a numerical penalty. -
Source and carrier record (SCR) — a recoverable account of which sources and carriers materially contributed to one identified synthesis or compilation result, and what each contributed. Keep the source versions, methods and carrier information needed to reconstruct that aggregation. The account may be expressed as prose, a table or a graph.
An account meeting C.2.1’s episteme criterion is one
U.Episteme: its claim content records those participation facts, its EntityOfConcern is the aggregate, and its effective ReferenceScheme determines their interpretation. Apply C.2.1 to its identity: a corrected participation claim changes the episteme, while another layout can express the same claims. Working notes can precede that completed account. -
Semantic context — Plain shorthand for the local interpretation basis recovered from one 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.
Collection membership. • A collection’s 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.
B.1.3:4.2 - The operator family
Γ_epist has two companion operations with different semantic questions and the composition conditions below. Their declarations contain the values on which the result depends. A performer, local system-role kind, or assignment is not an operator argument: the fold can be specified before staffing and applied in Work performed by different Systems without changing its result semantics. This preserves the design/run distinction under A.15.
When one 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 dated U.Work claim is current, that ordinary sentence needs no classification or assignment apparatus. If one is current, recover every 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 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 input epistemes into a draft aggregate. The displayed signature is a family template. An operation declaration states which receiving claim, use and composition rules are fixed and how varying values are supplied; it determines the result’s claim content, EntityOfConcern and interpretation basis from its admitted inputs. Its domain is restricted by the applicable conditions in :4.4. Ordinary bounded synthesis may state this basis in its explanation without a separate operation declaration.
Γ_epist^synth : ( D_know : DependencyGraph< U.Episteme > ) ⇀ U.Episteme
-
Domain.
D_knowdesignates source epistemes and the relations used in their composition: governed ConstituentOf, UsageOf and ReferenceTo relations; support and derivation relations under their predicates; and collection belonging under each collection’s rule. It also identifies the mappings used by the fold. Those relations must independently obtain; graph labels do not establish them. -
Result. One synthesized episteme whose claim content, EntityOfConcern, and effective reference scheme satisfy C.2.1. Its ClaimGraph integrates the retained content. Keep material source contributions recoverable, adding the SCR when the receiving use requires reconstruction of the aggregation. 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 target reference scheme. Recover the operative target rules through C.2.1:4.1.1 and fix them as S for this compilation operation. A journal’s name or the document describing its rules does not by itself identify those rules.
Compare S with the source scheme by its interpreted rules, their domains and dependencies under C.2.1:4.1.1. A different spelling or encoding can express the same rules. A changed semantic rule or domain identifies a different target scheme even when a selected answer agrees; this compilation then identifies the result with that target S.
Γ_epist^{compile,S} : ( E_synth : U.Episteme ) ⇀ U.Episteme
S is fixed in the operation’s declaration. The declaration states how input claims are mapped into S and the conditions for admitting the result. The partial arrow means that an identified input episteme alone does not establish an admissible compilation: the mapping, preservation, and reliance conditions in :4.5 must hold. An unresolved interpretation or required mapping leaves the affected compilation unresolved.
- Domain. One synthesized episteme whose retained claims can be interpreted in
Sunder the declared mapping. For every meaning that crosses semantic contexts, the fold also relies on source and receivingSchemeSenseCellvalues, an obtaining F.9 Bridge, and a separately stated bounded-use claim. Reliance on that claim requires the A.10 evidence-provenance path and same-useRelianceDispositionunder F.9:4.2:passsupports the named use;degradesupports only its named narrower use. A named assurance claim additionally requires a B.3 result supporting that same bounded assurance use. - Result. One compiled episteme with explicit mapping and loss information and a C.2.1 identity determined by its claim content, EntityOfConcern, and effective target scheme
S. The result is not thereby a publication, release, carrier, or accepted artifact.
When the target must be replaceable. A receiving use that selects or substitutes a target scheme within one operation needs an independently governed range for that argument. Use C.3 to identify the candidate rules, their identity criterion, and the membership condition required by that use; then declare the argument and its binding conditions under A.6.1.
Range membership does not establish that the chosen scheme can express this input’s claims or that a proposed mapping preserves the required meaning. Those application conditions still need :4.5.
E.24.UK:4.2c supplies no admitted general U.ReferenceScheme range. Fixing one S permits the compilation above without claiming that general range; changing the fixed rules requires reconsidering the declaration, mappings, and affected results.
Relationship to Γ_ctx / Γ_time. If the knowledge fold depends on argument order (for example, a derivation), the internal fold uses Γ_ctx for the sequence. If a temporal storyline matters, first identify each 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 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 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 while preserving its claim content, EntityOfConcern and effective ReferenceScheme returns that same episteme. Repeating the same source or data creates no additional evidence or accidental assurance upgrade.
- COMM/LOC (Local commutativity / locality). Reordering 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 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. Keep a recoverable account of every material source contribution, method, mapping and dependency. Include carriers and source versions where their identity, currentness, integrity or participation matters to the named use. When that use requires reconstruction of the aggregation, retain the SCR and the information needed for that reconstruction.
Use the developing record to expose a missing source, shared data or an unsupported inference. Keep contrary contributions visible under rule 4. Pass the recoverable account with the aggregate or through resolvable references. When a source changes, reconsider the retained claims that depended on it.
3. Object alignment. Identify the result’s one 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 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, their limitations, and any CL summary required by the receiving rule, without merging homonyms.
4. Recover the support relation before combining. For the 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 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 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. Assess F under C.2.3 from the expression properties of essential constituents and their connecting inferences. A minimum applies only under a justified composition rule on a shared local ordered scale; it concerns that expression assessment, 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 use limitations and any CL summary consumed by the receiving rule. 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 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 support and any mode declaration needed by the receiving use:
- 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. A local ordinal formality summary describes only its declared ordinal meaning. Any value proposed for an R calculation needs a receiving model establishing meaning, scale, conversion, and assumptions; rescaling a formality rank into [0,1] is insufficient. - For a postulative input, retain its 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.
- When the receiving use requires a mode classification, apply its rule to the support operative in the claimed conclusion. Under the axiomatic/postulative distinction, if all operative inputs are axiomatic, the conclusion is axiomatic; an operative postulative input makes that conclusion 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. Account for resource use separately. When the receiving question requires a resource account for computation or collection, use B.1.6/Γ_work and reference that account separately from the epistemic support.
B.1.3:4.5 - Core rules for target-scheme compilation
When computing Γ_epist^{compile,S}(E_synth), retain the fixed rules S and the mapping used for this input:
1. Reference-scheme bindings.
Map every operative concept, unit, and claim into S and record the mapping, its limitations and any CL summary required by the receiving rule. 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, 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 S. 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 result needs grounds for its claimed calculations or derivations; its mode alone requires no additional numerical tuple.
3. Compilation trace. Carry the recoverable source-contribution account with the compiled episteme or through resolvable references. Add carrier hashes or other reconstruction details when the receiving claim requires carrier integrity or replay of the compilation. 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 conclusion depends on derivational order, carry the ordered relations, positions and OrderSpec required by that use. If it selects knowledge for a time-bounded use, name the 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 used.
B.1.3:5 - Archetypal grounding
B.1.3:5.1 - Episteme — Heterogeneous evidence into a guidance statement
This is an 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 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 ClaimScope. - Synthesis: record the source findings and the protocol, dataset or analysis details on which the synthesis relies. Include carrier information when the receiving use needs it. Establish any dosage or outcome mapping from its 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 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.
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 source-contribution account 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 preserve the source-contribution account with any SCR or carrier-integrity details required by the receiving use. 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 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 the expression properties; the probability that the actual controller is safe needs its assurance basis.
- 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 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 probability; otherwise return the narrower formal conclusion and the unresolved system assurance.
- Positive quantitative case: if a receiving model 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 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 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 system protection remain separate claims.
To make the target choice explicit, fix S_cert with two interpretation rules: “proved under A” states A ⇒ P in the named model; “protection established in service” states that the installed system delivers the protective function in the named operating conditions. The proof input can be compiled into the first statement with A retained. It cannot supply the second statement without the model-to-world and assurance basis already identified above.
Reformatting the document that describes these two rules leaves S_cert unchanged. If another target reads “proved” as an unconditional claim about the installed system, that is a different scheme: the earlier mapping of the proof is inadmissible there, while the original theorem remains available.
Selecting that target within one replaceable-scheme argument also requires the declared range membership; matching its document format establishes neither membership nor an admissible mapping.
B.1.3:5.3 - Knowledge composition and system aggregation
| 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 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 remains traceable to its material sources and methods. An SCR MUST be retained when required to reconstruct the aggregation for its named use.
- PO-SYN-OBJ. The result MUST name one EntityOfConcern already identified under its 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 limitations and any CL summary required by the receiving rule.
- PO-SYN-CL. Every mapping used in the support account MUST retain its use limitations and any CL summary consumed by the receiving rule. 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. When a resource account is required, use B.1.6 and reference its result separately; resource expenditure does not itself establish epistemic support.
At compilation (Γ_epist^compile):
- PO-COMP-SCHEME. The operative target rules MUST be identified and fixed in the compilation declaration. If the receiving operation instead accepts a replaceable scheme argument, its independently governed range and binding conditions MUST be declared and satisfied for that use. Every active concept and unit MUST have an explicit mapping; a cross-context meaning use MUST name the F.9 Bridge, separate bounded-use claim, permitted loss, and the A.10 path and same-use
RelianceDispositionrequired by F.9:4.2. A named assurance claim additionally requires its B.3 result for that same bounded assurance use. - 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 keep its material source contributions recoverable. Retain the SCR and the hashes, versions or dates required by a named reconstruction, currentness or carrier-integrity use. This obligation does not assert release or publication.
- PO-COMP-ID. The output MUST be identified through its C.2.1 claim content, 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 C.2.1 episteme identity and reference the already recovered proper restriction, edition-relation order, applicability window, and B.1.4/Γ_time aggregation consumed.
B.1.3:7 - Conformance Checklist (normative)
| ID | Requirement | Purpose |
|---|---|---|
| CC‑B1.3.1 | Every knowledge constituent supplied to Γ_epist MUST be a U.Episteme holon; ComponentOf is forbidden; use ConstituentOf, UsageOf, or ReferenceTo for their different claims; use a collection’s belongs-to predicate only for collections. | Prevent category errors. |
| CC‑B1.3.2 | Material sources, methods and their contributions MUST remain recoverable with the aggregate; preserve any SCR details required by the receiving use. | Preserve source contributions and required reconstruction grounds. |
| 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 | Any mode declaration consumed by the receiving use MUST follow that use’s rule and the support operative in the claimed conclusion. Under the axiomatic/postulative distinction, an operative postulative input makes that conclusion postulative; separately supported formal subclaims remain usable. | Preserve the relevant warrant distinction without substituting a tag for support. |
| CC-B1.3.6 | A cross-context meaning use names explicit mappings, source and receiving F.17 cells, an obtaining F.9 Bridge, a separate bounded-use claim and permitted loss, and the A.10 evidence-provenance path and same-use RelianceDisposition required by F.9:4.2. A named assurance claim additionally requires its B.3 result for that same bounded assurance use. 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, 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 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 merged | Declare the mapping. For cross-context meanings, identify and test the F.9 Bridge, state the bounded use and permitted loss. Decide the proposed use under its applicable correspondence and reliance rules; leave it unresolved when required grounds are unresolved. |
| Unsupported semantic crossing | Local senses or schemes are mixed without a tested correspondence and use boundary | Declare the mappings; for cross-context meanings identify the F.9 Bridge, separate bounded-use claim, permitted loss, and the A.10 path and same-use RelianceDisposition. Retain the additional B.3 result when a named assurance claim is current. |
| 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 recovered temporal relations the current use needs. |
| Work stuffing | Compute/curation cost blended into reliability | Remove the unsupported inference from resource expenditure to warrant. Use B.1.6/Γ_work only when a separate resource-aggregation claim is current. |
| 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 construction and identity facts leave an existing-whole versus candidate-new-whole question. |
B.1.3:9 - Consequences
Benefits
- Traceable composition. Every retained claim remains tied to its sources; the SCR identifies the carriers needed to reconstruct the aggregate.
- 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.
- Separate composition questions. Separates semantic folding (Γ_epist) from order (Γ_ctx), time (Γ_time), spend (Γ_work), and emergence (B.2).
Trade‑offs
- Mapping overhead. Establishing correspondences and their limitations costs time and makes interpretation differences inspectable.
- 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 applies only to an 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. Declared reference schemes and local senses let a reader identify reinterpretation. F.9 governs any cross-context Bridge; C.2.1 governs the resulting episteme identity.
- Synthesis without a common score. Provenance, support roles and dependencies, 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 application bindings), A.14 (ConstituentOf, collection belonging under each collection’s 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 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 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 cross-context Bridges and bounded-use claims; A.10 for reliance accounts and the same-use
RelianceDispositionrequired for relied-on Bridge use; B.3 additionally when a named assurance claim is current; 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 construction facts leave a separate whole-reidentification question after the existing-whole explanation check. -
Used by: B.3 assurance uses the aggregate’s 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.