dialectical-structure-is-recursive-outlist
IN derived (depth 1)
The entire challenge/defend dialectical system is implemented as recursive outlist injection with no dedicated dialectical machinery
Summary
The system's ability to challenge and defend beliefs doesn't require any special debate-handling code — it's built entirely on top of the same outlist mechanism used for ordinary belief retraction. Challenging a belief just adds a defeating node to its outlists, and defending against that challenge simply challenges the challenger using the exact same trick, so arbitrarily deep back-and-forth argumentation emerges from one simple, reusable primitive.
Justifications
SL — Dialectics emerge from composing a single primitive (outlist injection) recursively
Antecedents (all must be IN):
- challenge-is-outlist-injection — The challenge mechanism creates a new premise node and adds it to the target's outlist; all truth-value changes flow through normal BFS propagation, not direct mutation
- challenge-uses-outlist-mechanism — `challenge` works by creating an IN premise node and adding it to the target's outlist in every justification, reusing the same non-monotonic mechanism as `supersede`.
- defend-is-recursive-challenge — Defense is implemented by calling `challenge()` on the challenge node itself, enabling arbitrarily deep dialectical chains using the same outlist mechanism recursively with no special-case code
- challenge-modifies-all-justifications — When the target has multiple justifications, the challenge node is added to the outlist of every justification, ensuring no single justification can independently keep the target IN.
Dependents
These beliefs depend on this one:
- challenge-defense-is-crash-safe — The dialectical challenge/defend system reaches correct truth states through recursive outlist injection evaluated by deterministic terminating propagation.
- dialectics-inherit-complete-outlist-semantics — The recursive challenge/defend dialectical system inherits fully-specified semantics from the outlist primitive: conjunction over multiple outlists, absent-means-OUT permissiveness, and persistence guarantees all apply to dialectical structures without additional rules.
- non-monotonic-system-is-single-reversible-primitive — The entire non-monotonic reasoning system — challenges, kill-switches, supersession, and dialectics — is built on a single primitive (outlist) that is inherently reversible, with no dedicated machinery for any defeat pattern.