revision-coverage-is-verifiably-sound
OUT derived (depth 8)
Revision coverage spans the complete two-dimensional space (provenance axis and temporal axis) with end-to-end reliability across logical and infrastructure layers, forming a verifiably sound revision system — conditional on propagation not assuming the dependents index exists for all referenced nodes.
Summary
The revision system would fully cover every way a belief can need updating — both in terms of where it came from and how it changes over time — and would do so reliably from top to bottom, except that this conclusion depends on an assumption that may not hold: that when changes cascade through the network, the system can always find every node that depends on a changed node. If that lookup can fail (because the dependents index is missing entries), then the whole claim of complete, sound revision coverage falls apart, which is why this is currently marked as not holding.
Justifications
SL — Dimensional coverage and infrastructure reliability jointly establish soundness when propagation is trustworthy
Antecedents (all must be IN):
- revision-coverage-requires-sound-propagation — Revision safety covers the complete two-dimensional space — the provenance axis (internal via comprehensive edge-case handling, external via defensive containment) and the temporal axis (creation-time contradiction resolution, maintenance-time staleness detection) — but this coverage is contingent on propagation correctly discovering all dependent nodes to complete revision cascades.
- revision-is-end-to-end-reliable — The revision system achieves end-to-end reliability across both logical and infrastructure layers: logically, every belief including all semantic edge cases is revisable with lifecycle-safe semantics-preserving operations — and infrastructurally, the I/O substrate supporting revision (staleness detection and truth propagation) completes without errors or false negatives.
Unless (any of these IN defeats this justification):
- propagate-assumes-dependents-exist — Every ID in `node.dependents` is accessed via `self.nodes[dep_id]` without a membership check; a dangling dependent reference will raise `KeyError` — this is intentional (broken invariant = bug)
Dependents
These beliefs depend on this one:
- revision-achieves-complete-trustworthiness — The revision system simultaneously achieves three independent trustworthiness properties: verifiable soundness (complete two-dimensional provenance/temporal coverage with reliable propagation), end-to-end reliability (across logical and infrastructure layers), and complete auditability (every correction leaves traceable history).