[AXIOM-00: PREMISE]
logic.quest is a running inference engine: a terminal into formal thought where propositions become nodes, deductions become circuits, and every valid step leaves a phosphor trace behind.
The machine does not persuade. It evaluates. Enter the cockpit, follow the proof state, and watch certainty assemble itself from exact operators.
[THEOREM-01: DEDUCTION]
Reasoning is a path through constrained space. Each premise narrows the graph. Each rule validates a connection. Each conclusion survives only if the route from axiom to theorem remains unbroken.
Trace the branches: assumption, implication, contradiction, resolution. The proof tree constructs itself top-down as the deduction stabilizes.
[LEMMA-02: TOOLS]
The instruments are primitive and sharp: truth tables for exhaustive state, inference rules for motion, quantifiers for scope, and contradiction for detecting impossible worlds.
No feature grid is required. The readouts below are the tools: live cells, active gates, and propositions that flash as the engine calculates.
[COROLLARY-03: APPLICATION]
Logic leaves the chalkboard when systems must prove what they will do before they do it: verification, planning, program analysis, theorem search, policy reasoning.
Application is not decoration here. It is a live inference chain: signals enter, gates constrain them, and the output only lights when the conclusion is forced.
[QED-04: RESOLUTION]
The final node resolves when every dependency is accounted for. No appeal to authority remains. No rhetorical flourish survives. The conclusion stands because the path to it is illuminated.
logic.quest ends where a proof begins again: with a blinking cursor, a validated tree, and the next proposition waiting for command.