論理 ronri.net
depth · 01

Axiom Nodes

Three foundational propositions, isolated in the dark substrate. They pulse, but do not yet speak to each other.

AXIOM · α if P then Q ∀x · P(x)→Q(x) AXIOM · β Q implies R Q ⊢ R AXIOM · γ R or ¬S R ∨ ¬S // no edges yet // dormant // awaiting input
scroll to connect ↓
depth · 02

First Connections

Edges arc outward from each axiom. Twelve nodes form. The graph begins to think.

AXIOM · α P→Q AXIOM · β Q⊢R AXIOM · γ R∨¬S P(x) ¬P→¬Q Q(x) ∃x R(x) R∧Q R(x) ¬S S→⊥ R∨T ∧ → ∧ → ∨ ¬
depth · 03

Dense Network

Three sub-networks of inference grow, bridged by occasional cross-arguments. Hover any node to illuminate its subgraph.

cluster · A cluster · B cluster · C premise · A1 P(x) A2 P→Q A3 ¬¬P lemma · A4 Q(x) A5 ∀x P B1 M(x) premise · B2 M→N B3 ¬N→¬M lemma · B4 N(x) B5 ∃x M B6 N∧M premise · C1 Q→R C2 R∨¬S C3 ¬S lemma · C4 R(x) C5 R∧¬S → ∧ → ∨ → ∧ ⇝ bridge ⇝ bridge ⇝ bridge
depth · 04

Convergence

All paths funnel inward. The lemmas resolve. A single conclusion crystallises in gold.

A4 · Q α P→Q B4 · N C4 · R γ Q→R β ∀x ¬S M(x) R∨¬S 論理 ronri convergence · 0%

From three isolated axioms — through twelve propositions, three sub-networks, and the bridges that join them — the graph resolves into a single inference: logic is not a chain, but a web that lights up when you walk it.

— ronri.net · 論理