semantics-and-revision-share-minimal-foundations
IN derived (depth 4)
Both truth maintenance semantics and belief revision achieve comprehensive coverage through the same minimal primitives — the outlist primitive simultaneously enables emergent truth evaluation (disjunction over conjunction with absence semantics) and all non-monotonic revision mechanisms (defeat, backtracking, dialectics), confirming minimality as a cross-cutting architectural principle rather than a property of any single subsystem.
Summary
The minimal building blocks needed for truth maintenance turn out to be the same minimal building blocks needed for belief revision. The outlist mechanism is not just pulling double duty — it is the shared foundation that makes both subsystems work, which means the system's simplicity is not a coincidence within one area but a deeper architectural property that holds across the entire design.
Justifications
SL — Both subsystems derive comprehensiveness from shared outlist/disjunction primitives — minimality is cross-cutting
Antecedents (all must be IN):
- system-semantics-are-minimal-and-complete — The entire TMS — both monotonic truth maintenance and non-monotonic defeat — derives from a minimal set of uniform primitives: emergent truth rules (disjunction over conjunction, premise-from-absence) combined with a single reversible outlist mechanism that underlies all defeat features, with no additional machinery required.
- belief-revision-is-comprehensive-and-minimal — The system handles all forms of belief revision through two complementary minimal mechanisms: the outlist primitive provides a single reversible defeat mechanism for challenges, kill-switches, and supersession, while dependency-directed backtracking resolves detected contradictions by retracting the least-entrenched premise with minimal disruption.
Dependents
These beliefs depend on this one:
- completeness-and-minimality-are-unified — The reasoning-and-revision architecture achieves completeness through minimality rather than despite it — both forward truth computation and backward belief revision derive from the same small set of primitives (outlist, disjunctive truth, vacuous validity), so completeness requires no feature accumulation beyond what minimality already provides.
- revision-invariants-follow-from-shared-foundations — Both revision paths (reactive contradiction resolution and proactive dialectical challenge) preserve system invariants not through path-specific correctness arguments but because they operate through the same minimal primitives — shared foundations guarantee that any revision entry point inherits the same invariant-preserving behavior.