supersession-is-reversible-and-view-consistent
IN derived (depth 1)
Supersession is both mechanically reversible (implemented via outlist, so retracting the superseder restores the original node's truth value) and view-consistent (superseded nodes are excluded from gated belief lists even if they retain active blockers), making it a first-class lifecycle operation rather than just a truth-value toggle.
Summary
When one claim replaces another through supersession, the system handles it cleanly in both directions: undoing the replacement automatically brings the original claim back to life, and superseded claims stay hidden from active views so they don't clutter decision-making. This means supersession works as a proper "replace" operation rather than a hack on top of simpler mechanisms.
Justifications
SL — Reversibility (mechanism) and view exclusion (presentation) together make supersession a well-integrated feature
Antecedents (all must be IN):
- 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
- api-superseded-nodes-excluded-from-gated — `list_gated()` omits nodes that have been superseded via `api.supersede()`, even if they still have active blockers — stale conclusions don't pollute the blocker view.
Dependents
These beliefs depend on this one:
- belief-replacement-is-topology-safe-and-view-consistent — Both belief replacement mechanisms achieve topology safety and view consistency: supersession operates through reversible outlist semantics with gated view exclusion of superseded nodes, while deduplication rewires all justification references (both antecedent and outlist) to the most-connected survivor with user-auditable plans — ensuring the dependency graph remains structurally sound and consumers see a clean non-redundant belief set regardless of which replacement mechanism was used.