Diameter Logic.
A first-class language construct for dialectical reasoning. Every node has two poles — thesis and antithesis — and resolves through mathematical tension synthesis.
The Diameter Primitive
In traditional computing, logic evaluates to true or false. Diameter Logic introduces a third paradigm: two conflicting structural constraints (poles) that resolve through deterministic mathematical synthesis. The distance between the poles is tension — the engine of resolution. When tension → 0, the node is resolved.
This is implemented as OBJ_DIAMETER — a first-class object type in the VM with 30+ dedicated opcodes including OP_SYNTHESIZE, OP_MODUS_PONENS, OP_DE_MORGAN, OP_PROOF_CHECK, and more.
Language-Level Syntax
The Braid compiler has native diameter syntax. The parser (parser.c, 1,773 lines) handles diameter declarations, evolve, and observe. The VM evaluates tension directly in its execution loop.
diameter temperature {
pole hot: { return 80.0 }
pole cold: { return 10.0 }
}
temperature.evolve()
let tension = temperature.observe("tension")
// tension = |80.0 - 10.0| = 0.7 (high conflict)
// After enough evolutions, synthesis resolves:
// child.content = 0.6*hot + 0.4*cold (weighted blend)
// child.tension → 0 (resolved)The Algebra — 28 Operations
Implemented in diameter_algebra.c (518 lines), the algebra includes:
Boolean Logic
and, or, not, xor, nand, nor, implies, biconditional
Propositional Calculus
modus_ponens, modus_tollens, hypothetical, disjunctive
Dialectical Synthesis
synthesize, antithesis, thesis, dialectic, coherence, diverge
Formal Verification
verify, proof_check, axiom, theorem, consistent, satisfiable
Current Limitations
Synthesis is arithmetic: The dialectical synthesis is 60% thesis + 40% antithesis. No semantic check on the synthesized value. Two unrelated poles can converge on a meaningless midpoint.
DTS Overseer is dead code: The geometric distance check in the DTS cascade is defined but never called. The cascade freely synthesizes without Overseer gatekeeping.
Foundation enforcement is narrow: Only the "no_harm" axiom has operational enforcement (string matching). The other 6 axioms exist as strings but have no enforcement logic.