truth-semantics-are-emergent-and-uniform
IN derived (depth 2)
Truth maintenance semantics are fully emergent from simple uniform rules: premise behavior arises from empty justification lists, evaluation is pure and type-agnostic across SL/CP, and node truth is a clean disjunction-of-conjunctions — no special cases exist anywhere in the evaluation path.
Summary
The entire truth maintenance system runs on a single, simple evaluation rule applied uniformly everywhere — there are no special cases, no type-specific logic, and no hardcoded behaviors. What looks like distinct features (premises staying true, complex justification types, logical OR across multiple reasons) all fall out naturally from the same minimal machinery: check if supporters are in and opponents are out, combine multiple justifications with OR, and let nodes with no justifications default to true. This matters because it means the system has no hidden complexity or edge cases lurking in the evaluation path — if you understand one rule, you understand the whole thing.
Justifications
SL — Three independent design choices (empty-list defaults, uniform eval, DNF truth) converge to eliminate all special-case logic
Antecedents (all must be IN):
- premise-behavior-emerges-from-absence — Premise behavior is not explicitly implemented — it emerges from three defaults: nodes with no justifications default to IN, empty antecedent lists are vacuously valid, and the system preserves a premise's current truth value rather than deriving it.
- truth-is-disjunctive-over-conjunctive-rules — A node's truth is a disjunction over justifications (any valid justification makes it IN), where each justification is a conjunction (all antecedents IN and all outlist OUT), and any-mode explicitly reifies OR semantics as per-premise justifications.
- justification-evaluation-is-uniform-and-pure — All justification types (SL and CP) use the same validity rule (antecedents IN, outlist OUT), evaluated as a pure function with no side effects
Dependents
These beliefs depend on this one:
- all-semantic-edge-cases-are-uniform — All semantic edge cases — absence of justifications yielding premise behavior, absence of nodes producing asymmetric fail semantics, and empty antecedent lists satisfying vacuous truth — emerge from the same uniform evaluation rules without special-case handling, including the emergent disjunctive-over-conjunctive truth structure.
- dialectics-are-semantically-transparent — Challenge/defend dialectics are semantically indistinguishable from ordinary beliefs: they inherit fully-specified outlist semantics (conjunction, absence-as-OUT, persistence) and are evaluated by the same uniform pure rules that govern all truth maintenance — no dialectical special cases exist anywhere in the engine.
- 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.