belief-replacement-is-topology-safe-and-view-consistent
IN derived (depth 2)
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.
Summary
When the system needs to replace one belief with another — whether by superseding it or merging duplicates — both paths keep the dependency graph intact and present a clean view to anyone querying the system. Supersession can be undone by simply retracting the newer belief, and deduplication carefully rewires all connections to the surviving copy, so neither operation leaves behind broken links or confusing redundancies.
Justifications
SL — Two independent belief replacement mechanisms both achieve the same dual guarantee, establishing a system-wide replacement invariant
Antecedents (all must be IN):
- supersession-is-reversible-and-view-consistent — 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.
- dedup-is-topology-preserving-and-auditable — Deduplication preserves network topology (rewrites both antecedent and outlist references to survivors), selects structurally-optimal survivors (most dependents with lexicographic tiebreak), and supports human oversight (KEEP/RETRACT markers in a user-editable plan format).
Dependents
These beliefs depend on this one:
- all-belief-replacements-converge-with-topology-preservation — All mechanisms for replacing or restructuring beliefs — individual supersession with view-consistent gating, batch deduplication with bidirectional reference rewiring, and import reconciliation with dual convergent modes — both preserve network topology (no dangling references) and converge deterministically to stable states.