all-defeat-mechanisms-are-reversible
IN derived (depth 1)
Every outlist-based defeat operation (challenge, kill-switch, supersession) is inherently reversible because outlist semantics flip truth values without deleting nodes
Summary
The system never permanently destroys information when one claim defeats another. Whether an agent is shut down, a belief is replaced by a newer version, or a claim is challenged in debate, the mechanism is always the same: a flag flips the old claim off rather than erasing it. This means any defeat can be undone just by removing the flag, which makes the entire dialectical layer — challenges, defenses, supersessions, kill-switches — safe to use freely without risk of data loss.
Justifications
SL — Reversibility is an emergent property of using outlists rather than deletion for defeat
Antecedents (all must be IN):
- kill-switch-cascade-is-reversible — Retracting `agent:active` cascades all agent beliefs to OUT via the inactive relay flipping IN; re-asserting `agent:active` reverses the cascade, restoring all beliefs to IN via the same BFS propagation
- supersession-is-reversible — `supersede()` adds the new node's ID to the old node's outlist rather than deleting the old node; retracting the new belief automatically restores the old one through normal propagation
- challenge-uses-outlist-mechanism — `challenge` works by creating an IN premise node and adding it to the target's outlist in every justification, reusing the same non-monotonic mechanism as `supersede`.
- defend-is-recursive-challenge — Defense is implemented by calling `challenge()` on the challenge node itself, enabling arbitrarily deep dialectical chains using the same outlist mechanism recursively with no special-case code
Dependents
These beliefs depend on this one:
- agent-subsystem-is-self-contained — The agent subsystem provides complete lifecycle management: import handles mixed truth states and topological cycles, namespace/relay pairs provide isolation and kill-switches, and all defeat operations are reversible for agent reactivation.
- defeat-reversal-propagates-automatically — All outlist-based defeat mechanisms (challenge, kill-switch, supersession) not only reverse in principle but propagate recovery automatically through safe terminating BFS — when a defeating node is retracted, the outlist entry becomes satisfied, and propagation cascades truth-value restoration to all affected nodes without manual re-assertion
- defeat-reversal-with-guided-recovery — All defeat mechanisms (challenge, kill-switch, supersession) are reversible through outlist semantics, and the system provides surgical restoration hints for cascade victims with viable recovery paths — enabling guided recovery from retraction cascades where multi-premise justifications have surviving premises.
- defeat-reversals-are-lifecycle-governed — All outlist-based defeat reversals (challenge, kill-switch, supersession) operate within metadata-enabled lifecycle governance — every reversal produces not just a truth-value change but a fully governed lifecycle transition with metadata-tracked state (retraction flags, stale reasons, access tags), ensuring reversals are first-class lifecycle events rather than bare truth flips.
- dialectical-defeat-is-reversible-but-identity-is-permanent — The dialectical system exhibits a fundamental asymmetry between defeat and identity: the truth-value defeat caused by a challenge is fully reversible (defending or retracting the challenge node restores IN status via outlist semantics), but the premise-to-justified identity transformation is permanent — a challenged premise can never return to unjustified status because the added justification cannot be removed, only defeated.
- non-monotonic-system-is-single-reversible-primitive — The entire non-monotonic reasoning system — challenges, kill-switches, supersession, and dialectics — is built on a single primitive (outlist) that is inherently reversible, with no dedicated machinery for any defeat pattern.