Human–Machine Convergence

Higher structure and internal logics

Rajesh Ranjan Mahapatra

A first-principles account of context-indexed truth, higher coherence and a practical scoped logic model for deciding when claims may travel across levels.

© 2026 Rajesh Ranjan Mahapatra. 30 min read

Higher structure and internal logicsAll Human–Machine Convergence

Formal bridges and comparison discipline

Higher structure and internal logics

Framework-relative truth stays disciplined when every claim carries a context, a witness rule and a translation path, while higher cells record whether rival paths cohere instead of flattening them into one verdict.

TLDR

  1. A proposition is not decision-ready until its object, time, evidence rule, logic and authority are named.
  2. Internal logic formalises what counts as truth inside a framework; it does not turn preference into fact.
  3. Moving a claim between levels requires a typed translation that declares which relations it preserves.
  4. Higher morphisms compare translation paths, so agreement can be evidenced without declaring frameworks identical.
  5. The scoped logic model classifies claims as local, transported, coherent, blocked, undecided or conflicting before action.

The recovery that is true, false and withheld

At 09:14, a synthetic recovery system called Aster-7 closes an incident. Its model layer sees six green health checks and writes, “Service restored.” A customer-journey probe completes a test payment and writes the same sentence. The business ledger still contains 312 unsettled effects, so the operations view writes, “Service not restored.” The release controller sees the disagreement and writes, “Decision withheld.”

Which screen is wrong? The natural answer is that at least two must be. One event cannot be restored, not restored and undecided at once.

That answer hides an assumption: every screen is evaluating the same proposition under the same rules. It is not. The model means that component health is inside tolerance. The journey probe means that one end-to-end route works. The ledger means that promised effects have been applied. The controller means that a governed release condition has been met. The English label stayed fixed while the object, evidence and authority changed.

The error is not local disagreement. The error is deleting the address from each judgement and then treating the remaining sentence as global truth.

The same sentence in four rooms

Imagine a theatre built as four stacked stages. The lowest stage contains model activations and health metrics. Above it sits the running service, with queues, retries and end-to-end probes. The third stage contains business effects such as balances, bookings and fulfilled commitments. The highest stage contains policy, authority and release. The phrase “recovery complete” is projected onto every backdrop.

Nothing mysterious happens when the projection changes colour between stages. Each stage supplies a different truth condition. A model-health claim is true when specified measurements satisfy a rule. A business-effect claim is true when authoritative state confirms a promised change. A release claim is true only when evidence and permission satisfy a policy. These conditions can be related, but they are not interchangeable.

Figure 1. The layered theatre of “recovery complete”

Conceptual figure
Four stacked stages use different witness rules for the same phrase A theatre cutaway shows model, service, business and authority stages. Each stage displays recovery complete but attaches a distinct witness: health metrics, journey probe, effect receipt or release sign-off. A vertical beam labelled translation obligation connects the stages. MODEL STAGEwitness: six health metrics inside tolerance SERVICE STAGEwitness: end-to-end journey probe succeeds BUSINESS STAGEwitness: promised effects are read back AUTHORITY STAGEwitness: policy conditions and sign-off hold “recovery complete”“recovery complete”“recovery complete”“recovery complete” translation obligations accumulate Same words do not fix scope Each higher stage asks for a new witness.
The label is stable while its warrant changes. A claim may be true at one stage and unavailable at another because the target stage asks a different question. Promotion requires a declared translation, not confidence in the shared wording. Practitioner synthesis. The composition is specific to the Aster-7 recovery puzzle.

A useful discipline is to give every operational claim an address. Write the address as ⟨object, time, evidence rule, logic, authority⟩. The object says what the claim is about. Time fixes the valid state. The evidence rule says what counts as a witness. Logic says how missing or conflicting evidence is treated. Authority says who may turn the judgement into action.

For Aster-7, “recovery complete” at the model stage might have the address ⟨six services, 09:14, health threshold, Boolean test, monitor⟩. At the release stage it might be ⟨customer payment journey, 09:14, probe + effect receipt, constructive gate, release controller⟩. The lexical overlap is nearly total. The logical overlap is not.

Relativity without relativism

Three positions are easy to confuse. The first says that a sentence can have different meanings in different contexts. The second says that one proposition can be supported by different evidence. The third says that contradictory propositions are equally acceptable. Only the first two follow from internal logic. The third does not.

Consider “the customer is verified”. In an identity service, the object may be a credential holder and the witness a valid cryptographic challenge. In a fraud investigation, the object may be the legal person behind a network of accounts and the witness a body of corroborating records. In a payment flow, the same phrase may merely mean that a prior verification token has not expired. These claims can be related, but copying the sentence does not copy the proof obligation.

The address prevents a quiet slide between them. Object identity must be mapped. The decision cutoff must be preserved or deliberately changed. The source witness must be shown sufficient for the target predicate. The target logic must say what absence and contradiction mean. Finally, authority must be carried by a valid grant rather than inherited from linguistic confidence.

This resembles coordinate dependence in physics only in a limited sense. A coordinate value may vary with the frame while invariant relations permit comparison. Here the claim address identifies the frame, and a translation declares the proposed invariants. The analogy ends because operational contexts are not automatically related by reversible transformations. A release policy may intentionally discard a model’s confidence score, and a legal rule may forbid a fact from entering a decision even when the fact is true.

Boundary condition

An internal logic does not manufacture the world it describes. It specifies which propositions and inferences are available within a structured setting. A failed readback can leave a claim unwarranted without making the physical event indeterminate. Conversely, a local proof can be impeccable while remaining irrelevant to a different object, time or authority.

The decisive test is alignment. When two judgements have different addresses, diagnose a translation problem. When their addresses match and their witnesses oppose one another, diagnose a contradiction or provenance failure. Calling both cases “perspective” hides the difference that action depends upon.

Figure 2. The five-field address of a claim

Decision anatomy
A claim surrounded by five address fields The phrase recovery complete sits at the centre of a compass. Five surrounding lenses identify object, time, evidence rule, logic and authority. A lower panel shows that removing any lens changes the decision permitted by the claim. RECOVERY COMPLETE OBJECTcomponent, journey, effect? TIMEwhich valid state? EVIDENCE RULEwhat counts as a witness? LOGICunknown and conflict policy AUTHORITYwho may act? Delete a field, and a local judgement can masquerade as a universal fact.
A claim without an address is not portable. The five fields are not decorative metadata. They determine whether a statement can be compared, translated, authorised or replayed. Scoped claim address proposed in this paper.
The load-bearing mechanism

Index truth first, then translate it. A local judgement remains meaningful because its witness rule is explicit. A cross-level judgement becomes meaningful only when a translation maps the object, time, evidence and authority into the target context. This mechanism blocks two opposite mistakes: pretending one vocabulary has identical meaning everywhere, and treating every local judgement as beyond comparison.

This idea has a precise mathematical ancestry. Lawvere’s categorical programme represented theories and their models through structure-preserving mappings, then developed indexed accounts of predicates and quantification. Categorical logic later made the correspondence between logical syntax and categorical structure systematic. A topos, under appropriate conditions, supports an internal higher-order language whose logic need not be classical.[1][3][5][6]

The practical lesson is not that an incident platform should become a topos prover. It is that truth conditions belong to a framework, and movement between frameworks is an operation with obligations. The next question is what “internal” means without allowing each framework to invent whatever truth it prefers.

The argument in one pass
Chart · flow
flowchart TD
  A["The same sentence in four rooms"] --> B["Truth needs a stage"]
  B --> C["Translations have paths"]
  C --> D["The scoped logic model"]
  D -. "re-test" .-> A
  classDef first fill:#0a1424,stroke:#D95545,stroke-width:2px,color:#e6f3ff
  classDef step fill:#0a1424,stroke:#3f7da0,stroke-width:1px,color:#e6f3ff
  class A first
  class B,C,D step
A structural route through Higher structure and internal logics: from The same sentence in four rooms to Make every promoted claim carry its…. Reading use: follow the relation, then return to the surrounding argument for evidence and limits.

Truth needs a stage

Suppose a technician asks whether a database write succeeded. Before any readback arrives, a classical completion policy may insist on two outcomes: succeeded or failed. A constructive evidence policy asks a different question: do we have a witness for success, or a witness that success is impossible? Until one appears, neither conclusion is licensed.

The physical write has not become vague. What changed is the rule for asserting a proposition. Framework-relative truth is a relation between a claim, a stage and a witness condition, not a licence for arbitrary belief.

Thought experiment 1 · Change only the available evidence

The sealed control room

Two control rooms monitor the same payment switch. Room North sees process heartbeats. Room South sees settled ledger effects. At 10:00, all heartbeats are green, but the settlement feed is delayed. North can witness “the processes are healthy”. South cannot yet witness “the payment effects settled”.

Now change one causal property: deliver the missing ledger receipt to South while leaving the switch untouched. South’s judgement changes because its evidence state changes, not because the underlying payment happened twice. If North’s local predicate is silently renamed “payment settled”, the apparent agreement is produced by vocabulary, not mechanism. The real question is whether a translation from process health to settlement is justified under this failure mode.

A minimal Kripke model makes the distinction visible. Let w₀ be the current information state. It has two possible refinements. In w₁, a readback receipt proves p, where p means “the effect committed”. In w₂, a rollback receipt proves that the effect did not commit. Information only grows as we move from w₀ to a refinement.

At w₀, we cannot assert p. We also cannot assert ¬p, because one accessible refinement proves p. Therefore p ∨ ¬p is not forced at w₀. This is the smallest useful example of intuitionistic persistence. Kripke’s semantics formalised such monotone information states for intuitionistic logic.[9]

Figure 3. One proposition across three information states

Exact toy model
A branching Kripke frame for an undecided proposition An initial state w zero branches to w one, where a commit receipt forces p, and w two, where a rollback receipt forces not p. At w zero neither p nor not p is forced, so excluded middle is not available constructively. w₀no effect receiptneither p nor ¬p forced w₁commit receiptp is forced w₂rollback receipt¬p is forced The world need not be indeterminate for the current stage to be undecided.
Constructive undecidedness is not a third physical outcome. It records that the current stage lacks a witness for either branch. A later refinement may settle the claim without revising the earlier evidence record. Based on Kripke-style monotone forcing; notation simplified for this paper.
Worked example 1 · The implication rule

In a Kripke frame, w ⊩ p → q means that for every accessible refinement v ≥ w, whenever v ⊩ p, we also have v ⊩ q. Here w is the current evidence state, v is any state with at least as much information, and ⊩ means “is warranted at this stage”.

Let p be “the commit receipt is valid” and q be “the balance reflects the write”. The implication is warranted at w only if every future state that validates the receipt also validates the balance relation. One successful sample is not enough. The rule asks whether the relation persists through all relevant refinements.

Categorical logic expresses a related idea more structurally. Contexts can be organised as objects. Predicates over a context form a fibre or internal universe of propositions. A map between contexts induces reindexing, analogous to substitution. Under suitable conditions, existential and universal quantifiers appear as adjoints to that reindexing. Lawvere’s hyperdoctrines made this indexing explicit, while Lambek and Scott, Jacobs, Mac Lane and Moerdijk developed the connection between type theory, logic and categorical structure.[2][3][4][8]

An elementary topos generally supports intuitionistic higher-order reasoning. Classical excluded middle becomes available only with additional Boolean structure. This is not a defect waiting to be fixed. It reflects a proof discipline in which assertions require construction, and local truth may vary with stage.[6][7]

Missing evidence and opposed evidence

A practical system often receives two independent signals about one proposition: a positive witness and a negative witness. This creates four information states. Positive only supports the claim. Negative only supports its negation. Neither records an evidence gap. Both records a conflict. The last two states are routinely collapsed into a single value called “unknown”, although they demand different responses.

When neither witness exists, the next action is usually acquisition. Retry a readback, wait for a bounded interval, or ask an independent source. When both exist, more acquisition may deepen the contradiction. The next action is provenance analysis: compare identifiers, versions, signatures, cutoffs and causal lineage. A system that treats both cases as low confidence loses the difference between ignorance and inconsistency.

Belnap’s four-valued logic was motivated by information that may be incomplete or inconsistent. It distinguishes true only, false only, neither and both, and prevents one contradiction from automatically licensing every conclusion.[10] That is useful for collection and containment. It does not decide which receipt describes the world, and it does not authorise action when opposed evidence affects the same governed claim.

Logic therefore belongs in the claim address because different tasks need different closure rules. A monitoring screen may use a total two-state display after a timeout. A recovery controller may require constructive positive evidence. An investigation store may retain both signed assertions without explosion. These are not competing metaphysical universes. They are distinct inference contracts whose consequences must be visible.

A discipline for framework choice

Choose a logic from the failure you must preserve. Use constructive withholding when a missing witness must block assertion. Use paraconsistent containment when opposed evidence must remain queryable without contaminating unrelated claims. Use classical reasoning where propositions, valuations and closure assumptions are genuinely fixed. Do not choose a logic merely because its output is operationally convenient.

The monotonicity boundary

The Kripke example assumes that information grows. Once a proposition is forced at a stage, every accessible refinement preserves it. This is defensible for an append-only proof record with stable meanings. It is unsafe for a live system in which credentials expire, policies change or a source retracts a faulty receipt.

The repair is not to abandon staged truth. It is to make time and version part of the context. “Authorised at 09:14 under policy 7” need not remain authorised at 09:22 under policy 8. The earlier judgement can remain true at its historical address while becoming unavailable for the later action. A revocation creates a new context and a translation obligation, rather than erasing the audit trail.

This boundary matters for human and machine reasoning alike. A conclusion may be valid under the information and rules available when it was made, yet invalid as a present instruction. Framework-relative truth becomes disciplined only when historical validity, current entitlement and action authority are kept separate.

Figure 4. Missing and conflicting evidence are not one problem

Comparison instrument
Logic choice changes what a system may conclude from absence and conflict. The first column is an operational completion policy, not a definition of classical logic. The four-valued column follows Belnap’s motivation for reasoning over incomplete or inconsistent information.[10] Decision comparison. It does not claim that intuitionistic and paraconsistent logics are interchangeable.
Boundary condition · Indexing does not dissolve contradiction

Suppose two claims have the same object, time, predicate, logic and authority. One has a valid positive receipt; the other has a valid negative receipt. Calling them “different perspectives” is evasion. Once the addresses align, the conflict is real. A paraconsistent collector may contain the contradiction while investigators trace provenance, but it does not make both actions safe.

This is the first defence against “all views are equally true”. Internal logic constrains what follows from a framework’s objects and proof rules. The second defence is translation. A local truth may remain local because no structure-preserving route to another level exists.

Translations have paths

A category gives us objects and morphisms. For this paper, think of objects as contexts and morphisms as translations. A translation may map a model-health predicate into a service-availability predicate, or a service predicate into a business-effect predicate. Composition lets us travel through several contexts.

That still leaves an important question. What if two routes connect the same source and target? A direct dashboard mapping may translate model health straight into “release ready”. A governed route may pass through journey evidence, business readback and policy. Both end at the release context. Their endpoints match, but their evidential histories differ.

Thought experiment 2 · Change only the translation route

The two translators

A sensor reports “temperature normal”. Translator Fast maps this directly to “batch safe”. Translator Careful maps it first to “temperature inside range”, then combines sterility, duration and seal evidence before producing “batch safe”. In one trial, both output the same words.

Now leave the sensor value unchanged and remove the sterility receipt. Fast still outputs “batch safe”. Careful withholds it. The shared output in the first trial did not establish equivalent translation. It only showed accidental agreement on one input. The decision question is whether a comparison can show that both routes preserve the relations required by the target claim over the relevant domain.

Higher structure supplies language for that comparison. In a 2-category, objects are contexts, 1-morphisms are translations and 2-morphisms relate translations. If F: M → S maps model claims to service claims, G: S → A maps service claims to authority claims, and H: M → A is a direct path, then a 2-cell α: G∘F ⇒ H records a specified comparison between the composite route and the direct route.

A 2-cell does not declare the routes identical. It may show that one refines the other, that they agree under a bounded condition, or that an invertible comparison exists. If no cell can be supplied, the diagram does not commute. The disagreement is not philosophical pluralism. It is missing coherence evidence.

Figure 5. A higher cell compares routes, not just endpoints

Higher-structure diagram
A direct and governed translation route between model and authority contexts Model context on the left connects directly to authority context on the right through H. A governed lower route passes through service and business contexts using F, G and K. A translucent membrane labelled alpha compares the direct route with the composite route and lists preservation tests. MODELhealth claim SERVICEjourney claim BUSINESSeffect claim AUTHORITYrelease claim H · direct translation FGK α comparison cell: object · time · effect · authority Same endpoint + same label ≠ coherent translation.
Higher structure keeps the history of how agreement was reached. The direct route and governed route are comparable only after the cell names the preserved dimensions and the domain in which agreement was tested. The mathematical inspiration comes from 2-categories and higher coherence; the operational interpretation is practitioner synthesis.

Higher category theory extends this recursively. There can be morphisms between 2-morphisms, recording coherence among comparisons. In weak higher categories, associativity and identity may hold up to specified higher equivalence rather than literal equality. Lurie’s higher topos theory and Riehl and Verity’s account of infinity-categories develop rigorous versions of this idea. Homotopy type theory similarly treats identity proofs as paths that can themselves have higher paths.[11][12][13][14][16]

Riehl and Shulman’s synthetic approach defines Segal types whose composites are unique up to homotopy, making coherent associativity part of the structure rather than an afterthought. Recent work has continued this programme by constructing substantial higher-categorical objects inside simplicial type theory.[15][17]

For an operational decision tool, we do not need an infinity-category implementation. We need the discipline it suggests: retain the route, retain the comparison, and distinguish literal equality from bounded agreement.

Equality is only one kind of agreement

A dashboard usually stores a final value and discards the path that produced it. Higher structure asks us to keep more distinctions. Two routes may be literally the same sequence. They may be different sequences with equal outputs. One may refine the other by adding evidence. They may be reversibly translatable over a limited domain. Or they may agree on the current case while diverging under the next intervention.

These are not stylistic variants. They license different decisions. Literal equality permits substitution without further work. A reversible equivalence permits substitution only while the inverse and preservation conditions remain available. Refinement permits a stronger route to replace a weaker one, but not necessarily the reverse. One observed agreement permits almost nothing beyond the observation.

In the Aster-7 case, the direct route and governed route both say “release” at 09:21. The direct route uses model health. The governed route uses journey success, effect readback and authority. Their outputs coincide, yet the direct route cannot replace the governed one. Under a delayed-effect fault, the first still says release while the second blocks. The intervention identifies a break condition for the apparent agreement.

The commuting update test

A small square captures a common coherence obligation. Let f update a source context, such as moving a service from configuration 7 to configuration 8. Let g update the target policy context. Let τ₇ translate claims before the update and τ₈ translate them afterwards.

There are now two routes. Update the source, then translate: τ₈ ∘ f. Or translate first, then update the target judgement: g ∘ τ₇. A strict commuting square requires equality. An operational comparison can use the weaker relation τ₈ ∘ f ≈ g ∘ τ₇, provided the meaning of ≈ is specified.

Suppose configuration 8 changes the health threshold while policy 8 adds an independent effect receipt. Translating after the source update yields “healthy under the new threshold”. Updating the old release judgement cannot add the missing receipt by itself. The square fails. That failure tells us that the policy update is not a relabelling of the model update. It introduces a new proof obligation.

A comparison cell can record this precisely. It names the two routes, the test domain, preserved fields, known exceptions and the evidence used to compare them. In software, this may be a signed test result or a typed transformation receipt. In mathematics, the comparison has stricter laws. In both cases, agreement becomes an object that can be inspected rather than a feeling produced by matching endpoints.

Where the higher-category comparison stops

The configured system in this paper has not been proved to form a 2-category, an infinity-category or a higher topos. Its translations may be partial, stateful and non-associative. The paper borrows a discipline of path, comparison and coherence. Formal language earns stronger force only after objects, morphisms, composition and laws are supplied.

This limit is especially important in comparisons among scientific theories, contemplative traditions and machine architectures. Two frameworks may support a carefully defined correspondence without sharing ontology. A higher cell can document a relation between translations. It cannot turn awareness into computation, a proof rule into a psychological mechanism, or a bounded analogy into equivalence.

Thought experiment 3 · Move the authority boundary

The proposal that becomes an action

A model assigns 0.94 probability to “recovery complete”. In System A, the same process that generates the score also sends the release command. In System B, an external policy kernel treats the score as a proposal and requires an effect receipt plus an authorised sign-off.

Hold the model, score and wording constant. Move only the authority boundary. System A acts; System B waits. The intervention shows that model-level confidence and system-level permission are different properties. No amount of semantic similarity between “likely restored” and “release allowed” creates the missing authority morphism.

Figure 6. Authority is a causal boundary, not another confidence score

Counterfactual intervention
Two systems with the same model output but different authority placement The left system lets a model output cross directly into release. The right system places a policy boundary between the same model output and the action, requiring effect receipt and sign-off. The left releases and the right waits. SYSTEM A · authority inside proposal path SYSTEM B · authority outside proposal path Model proposalP(recovery) = 0.94 Model proposalP(recovery) = 0.94 RELEASE EXECUTEDproposal authorises itself External authority kerneleffect receipt requiredauthorised sign-off required WAITmissing receipt same process proposes and permits proposal unchanged, action changed
Changing only authority placement changes the system outcome. This counterfactual separates epistemic confidence from permission. It also shows why authority must be represented in the claim address. Synthetic configured-system comparison; no deployment claim.
Thought experiment 4 · Change only the explanatory grain

The hundred healthy services

One hundred services each pass their local health check. A dashboard therefore reports 100 per cent health. Yet the customer journey fails because service 37 emits a valid message under schema version 4 while service 38 still interprets version 3. Every component-level proposition remains true.

Change only the grain of the claim. At the component level, “all services are locally healthy” is supported. At the compositional level, “the journey works” is false. The higher-level predicate is not the average of lower-level truth values. It depends on relations among components. A bridge from local health to journey success needs compatibility conditions, ordering and end-to-end evidence.

Worked example 2 · Aster-7 as a configured system

At 09:14, Aster-7 has four local judgements. Model health is true. The journey probe is true. Business recovery is false because 312 effects remain unsettled. Release readiness is undecided because policy forbids release while the business predicate is false. The direct model-to-release path says “true”; the governed path says “blocked”.

At 09:21, the ledger records all effects, a second journey probe succeeds and the release controller signs. The governed path now transports a positive claim through every stage. The direct path still agrees, but agreement becomes decision-relevant only because the governed route supplies the missing effect and authority witnesses.

Figure 7. The Aster-7 route from local health to governed release

Configured-system view
A five-stage recovery decision with receipts A vertical route moves from model health to service probe, business effect readback, authority decision and release action. Each transition lists what must be preserved. A dashed shortcut from model health to release is marked insufficient. Model healthsix metrics inside tolerance Journey probetest payment completes Effect readbackledger confirms promised effects Authority decisionpolicy + authorised sign-off Release actiontyped and independently verified preserve object + timeadd end-to-end relationadd effect + provenanceadd authority Shortcut: health → releasedrops effect and authority witnesses Every promoted claim travels with a translation receipt.
The governed route earns a stronger statement by adding witnesses. It does more than repeat the model with more boxes. Each stage changes the proposition and records the relation needed for the next stage. Synthetic architecture. Solid paths are executed obligations; the dotted shortcut is rejected.

This route demonstrates why higher structure is not a doctrine of universal equivalence. The mathematics becomes useful precisely because it distinguishes identity, equivalence, transformation, refinement and failed comparison. A framework can be internally coherent yet unable to support a target claim. Another can be richer for one decision and irrelevant for another.

How the claim changes under pressure
Chart · state
stateDiagram-v2
  [*] --> Claim
  state "Figure 1. The layered theatre<br/>of “recovery complete”" as Claim
  state "Relativity without relativism" as Test
  state "Figure 2. The five-field<br/>address of a claim" as Revision
  Claim --> Test: expose mechanism
  Test --> Decision: evidence survives
  Test --> Revision: rival survives
  Revision --> Claim: narrow or rebuild
  Decision --> [*]
The revision loop begins with Figure 1. The layered theatre of… and keeps counterexamples inside the reasoning path. Reading use: follow the relation, then return to the surrounding argument for evidence and limits.

The scoped logic model

The preceding ideas can be compressed into an operational instrument. Call it the Scoped Logic Model, or SLM. It is not a formal replacement for categorical logic. It is a typed decision record inspired by indexing, reindexing and higher coherence.

An SLM contains five things. C is a set of contexts. P is a set of addressed propositions. J records local positive and negative witnesses. T contains typed translations with preservation obligations. K contains comparison cells between routes. Write the whole model as S = (C, P, J, T, K).

Each translation lists the dimensions it must preserve. A model-to-service translation may need object identity, time alignment and a relation between metric health and service behaviour. A business-to-authority translation additionally needs policy version, purpose and authorised signer. If any required dimension is absent, the translation is blocked even when its output sounds plausible.

Six operational statuses

Local means a claim has a witness only in its source context. Transported means a declared translation produced a target judgement while satisfying its obligations. Coherent means rival transported paths agree and a comparison record covers the relevant domain. Blocked means a required mapping or witness is missing. Undecided means neither a positive nor negative witness is available under the selected logic. Conflict means aligned positive and negative evidence coexist.

Five invariants for a scoped decision

Address completeness. Every proposition used in a consequential decision names its object, cutoff, witness rule, logic and authority. A human-readable label may be shorter, but the decision record cannot be. Missing fields produce a blocked status rather than an inferred default.

Witness polarity. Absence of a positive witness is not a negative witness. A timeout can trigger a safe operational default, but the receipt must say “defaulted after timeout”, not “proved false”. This preserves the difference between a fact, an inference and a control response.

No untyped promotion. A claim can leave its source context only through a named translation. The translation declares its source and target predicates, the dimensions it preserves and the evidence that justifies the bridge. A copied string, shared embedding or high semantic similarity is not a translation receipt.

Scoped coherence. A comparison between routes names the cases and interventions over which agreement was tested. “The routes agree” is incomplete unless the record states where they agree and which failure changes the result. New configurations invalidate a comparison when they alter a preservation obligation.

Authority non-inheritance. Factual transport does not carry permission by default. A model can transport a supported proposal into a policy context while the policy still denies the action. Authority has its own source, scope, expiry and revocation path.

The four-pass evaluator

The SLM evaluates a decision in four passes. The local pass computes positive and negative evidence for each addressed proposition. The transport pass attempts each declared route and returns either a transported judgement or a list of missing obligations. The comparison pass checks rival routes and records coherent agreement, conflict or uncovered cases. The action pass applies authority to the strongest supported target claim.

This order matters. If authority is checked before the target proposition is established, a valid permission can be mistaken for evidence. If route comparison happens after action, disagreement becomes an audit finding instead of a control. If local evidence is compressed into one confidence number, missing and conflicting witnesses become hard to reconstruct.

A final readback creates a new addressed proposition about the realised effect. The action receipt says what was attempted under which authority. The effect receipt says what the environment became. These are different witnesses. A successful API response can prove acceptance of a request while leaving the business outcome undecided.

Decision rule

Permit action only when the target proposition is transported or coherent, the selected policy accepts its evidence state, authority is current, and the action has a defined verification and recovery path. Otherwise retain the strongest local claim and report what is missing.

The evaluator deliberately produces blocked and undecided states. Those outputs are not failures of intelligence. They are evidence that the system has preserved the boundary between what is supported and what would merely be convenient to say.

Worked example 3 · Four evidence bits

Represent local evidence with two bits: one for a positive witness and one for a negative witness. 10 means positive only, 01 negative only, 00 neither and 11 both. This does not force one universal logic. It creates an information layer that a selected logic can interpret.

For Aster-7 at 09:14, model health is 10, journey success is 10, business recovery is 01 and release readiness is 00. The direct path sees the first bit and says true. The governed path encounters the negative business witness and blocks release. The difference is traceable, not rhetorical.

Figure 8. Logic laundering strips scope until a local claim looks global

Failure anatomy
A funnel removes fields from an addressed local claim A wide claim containing object, time, witness, logic and authority passes through four narrowing stages that remove context, time, evidence and authority. It emerges as the bare sentence system restored and triggers release. A side path preserves a translation receipt and ends in governed review. ⟨services, 09:14, health metrics, Boolean test, monitor⟩“model health is inside tolerance” Drop source context and predicate“service is healthy” Drop time and witness rule“service restored” Drop authority“release now” UNGOVERNED ACTION Preserve the addresstyped translationeffect receiptauthority check GOVERNED REVIEWclaim remains scoped
Logic laundering is a specific failure mode. A valid local claim is progressively stripped of context and promoted until it authorises an action it never supported. Recovery preserves the address and requires a translation receipt. New failure mode proposed in this paper.
Worked example 4 · A genuine conflict

Suppose two independent business ledgers refer to the same payment, cutoff and policy. Ledger A has a signed commit receipt. Ledger B has a signed rollback receipt. Both are authoritative for the same target context. The SLM returns conflict, not “two local truths”. A containment policy may prevent inference from spreading, but the release decision remains blocked until provenance or state reconciliation resolves the contradiction.

Figure 9. Scoped logic lab

Toggle evidence and preservation obligations, then compare the shortcut and governed routes to release.

Local witnesses
Direct-path preservation
The lab exposes accidental agreement. A direct route may output “release” when model health is positive, yet remain blocked because it does not preserve effect or authority. The governed route becomes coherent only when positive effect evidence and sign-off are present without aligned negative evidence. Runnable JavaScript using synthetic inputs. No external data is transmitted.

How to apply the lab

Start with “Green model only”. The shortcut produces a local positive signal, but its translation is blocked because business effect and authority are not preserved. Add a journey witness. The service route becomes transported, yet release remains blocked. Add a positive business receipt and sign-off. The governed route becomes coherent.

Then choose “Conflicting receipts”. The target now has both positive and negative business evidence. The lab returns conflict even though the model remains green. This result means “contain and reconcile”, not “average the evidence”.

A positive coherent result permits a bounded statement: the tested paths support the same release judgement for the represented scenario and preservation obligations. A blocked result means the claim must remain local or gather missing evidence. A conflict means the target scope contains opposed evidence. The lab cannot establish metaphysical truth, complete formal equivalence or safety outside the declared scenario.

JavaScript · core evaluator
function evidenceState(positive, negative) {
  if (positive && negative) return "conflict";
  if (positive) return "true";
  if (negative) return "false";
  return "undecided";
}

function transport(path, requiredDimensions) {
  const missing = requiredDimensions.filter(
    dimension => !path.preserves.includes(dimension)
  );
  if (missing.length) {
    return { status: "blocked", missing };
  }
  return { status: "transported", value: path.value };
}

function compare(pathA, pathB) {
  if (pathA.status === "blocked" || pathB.status === "blocked") {
    return { status: "blocked" };
  }
  if (pathA.value !== pathB.value) {
    return { status: "conflict" };
  }
  return { status: "coherent", value: pathA.value };
}
Technical depth: why the SLM resembles an indexed logic

In a hyperdoctrine-style picture, a base category contains contexts and substitutions. A contravariant assignment sends each context to a category or ordered structure of predicates. A context map induces reindexing of predicates in the opposite direction. Under additional conditions, existential and universal quantifiers are left and right adjoints to reindexing.

The SLM borrows only this discipline. Its contexts are operational scopes, its local predicates have explicit witness rules, and its translations reindex or transform claims. It adds comparison records between paths. The SLM does not prove that an organisational system forms a topos, a hyperdoctrine or a higher category.

Open research hypothesis

Teams using addressed claims and translation receipts will make fewer premature cross-level closure decisions than teams using untyped status labels, especially under partial failure. The hypothesis would be strengthened by a lower false-release rate without a prohibitive increase in recovery time. It would be weakened if a conventional checklist performs equally well, or if users routinely mis-specify claim addresses. A rival explanation is that any structured pause improves judgement, regardless of logic. The smallest useful study is a synthetic incident simulator with matched teams, hidden effect failures and preregistered release criteria. The model should not be imposed on low-stakes communication where scope loss carries little consequence.

Evidence status

The foundations of internal logic, indexed predicates, intuitionistic semantics and higher coherence are established mathematical work. Their use as an engineering vocabulary for incident and AI-system decisions is practitioner synthesis. The SLM, logic-laundering failure mode and empirical hypothesis are new proposals in this article.

The evidence conversation
Chart · sequence
sequenceDiagram
  participant Q as Question
  participant M as Mechanism
  participant E as Evidence
  participant D as Decision
  Q->>M: The same sentence in four rooms
  M->>E: Figure 1. The layered theatre of “recovery complete”
  E-->>M: compare rival explanations
  E->>D: Make every promoted claim carry its address
  D-->>Q: revise scope or act
Question, mechanism, evidence and decision exchange the burdens developed in Higher structure and internal logics. Reading use: follow the relation, then return to the surrounding argument for evidence and limits.

Make every promoted claim carry its address

When two teams, models or theories appear to disagree, do not begin by asking which vocabulary is correct. First ask whether their claims share an address. Are they about the same object and time? Do they use the same witness rule? How do they treat missing and conflicting evidence? Who has authority to act?

When a claim travels upward, require a typed translation. It should state what object is preserved, how time is aligned, which causal relation supports the move, what evidence is added and which authority is invoked. When two routes reach the same target, require a comparison record. Agreement on one example is not coherence.

Do not flatten local truths into one global verdict, and do not protect weak claims by calling every disagreement a different perspective. Keep local judgement, translation and comparison separate. This makes genuine pluralism representable, genuine contradiction visible and action conditional on the strongest warranted scope.

Decision rule

Promote a claim only when its address, translation obligations and coherence receipt travel with it. Otherwise keep it local, gather the missing witness or declare conflict. The burden belongs to the move between levels, not to the eloquence of the sentence that arrives.

Glossary

Claim address
The object, time, evidence rule, logic and authority that determine the scope of a judgement.
Internal logic
A logic interpreted within a mathematical or operational framework, using its own objects, predicates and proof conditions.
Reindexing
The movement of a predicate along a context map, analogous to substituting or translating the context in which it is evaluated.
Higher cell
A morphism between morphisms, used here to record a specified comparison between translation paths.
Coherence
Evidence that multiple compositions or translations agree in the required structured sense over a declared domain.
Logic laundering
The promotion of a valid local judgement into an unqualified global claim by stripping context, witness and authority fields.

References

  1. Lawvere, F. W. (1963). Functorial semantics of algebraic theories. Reprints in Theory and Applications of Categories.
  2. Lawvere, F. W. (1969; reprint 2006). Adjointness in foundations. Reprints in Theory and Applications of Categories.
  3. Lawvere, F. W. (1970). Equality in hyperdoctrines and comprehension schema as an adjoint functor. Proceedings of Symposia in Pure Mathematics XVII.
  4. Lawvere, F. W. (1971). Quantifiers and sheaves. Proceedings of the International Congress of Mathematicians.
  5. Lambek, J., & Scott, P. J. (1986/1988). Introduction to higher-order categorical logic. Cambridge University Press.
  6. Mac Lane, S., & Moerdijk, I. (1992/1994). Sheaves in geometry and logic. Springer.
  7. Johnstone, P. T. (2002). Sketches of an elephant: A topos theory compendium. Oxford University Press.
  8. Jacobs, B. (1999). Categorical logic and type theory. North-Holland.
  9. Kripke, S. A. (1965). Semantical analysis of intuitionistic logic I. In Formal systems and recursive functions, 92–130.
  10. Belnap, N. D. (1977). A useful four-valued logic. In Modern uses of multiple-valued logic, 5–37.
  11. Awodey, S., & Warren, M. A. (2009). Homotopy theoretic models of identity types. Mathematical Proceedings of the Cambridge Philosophical Society, 146(1), 45–55.
  12. The Univalent Foundations Program. (2013). Homotopy type theory: Univalent foundations of mathematics. Institute for Advanced Study.
  13. Lurie, J. (2009). Higher topos theory. Princeton University Press.
  14. Riehl, E., & Verity, D. (2022). Elements of infinity-category theory. Cambridge University Press.
  15. Riehl, E., & Shulman, M. (2017). A type theory for synthetic infinity-categories. Higher Structures, 1(1), 147–224.
  16. Rasekh, N. (2018). A theory of elementary higher toposes.
  17. Gratzer, D., Weinberger, J., & Buchholtz, U. (2026). The infinity-category of infinity-categories in simplicial type theory. LICS 2026.