Logical graph¶
Peirce's existential-graph notation and calculus, in which logical assertions are arranged spatially on a sheet using juxtaposition, enclosure by cuts, identity lines, and transformation rules rather than only linear formulas.
Core Idea¶
A logical graph here is Peirce's existential-graph notation and calculus: assertions are placed on a sheet, combined by juxtaposition, scoped by cuts, connected by identity devices, and transformed under formal inference rules. The Alpha system expresses propositional structure with blank graphs, juxtaposition, and cuts. The Alpha system expresses propositional structure with blank graphs, juxtaposition, and cuts.
Scope of Application¶
Existential graphs are studied in logic, history of notation, semiotics, visual reasoning, proof theory, knowledge representation, and human–computer interaction with formal diagrams. Use it with the Alpha/Beta/Gamma fragment, sheet and cut semantics, identity convention, polarity, exact rewrite rule, formula translation, and distinction from Venn diagrams, graph theory, and conceptual graphs explicit.
- Propositional logic. Alpha graphs encode conjunction and negation.
- Predicate logic. Beta graphs add identity and quantification.
- Proof transformation. Rules rewrite graphs under context.
- History and semiotics. Studies Peirce's iconic-sign program.
- Knowledge representation. Traces influence on conceptual graphs.
Clarity¶
Specify Alpha, Beta, Gamma, or a modern formalization; define sheet, cut, identity conventions, polarity, and each rewrite. A visually similar diagram may express a different logic, and a valid formula translation does not license arbitrary drawing changes. The closest near miss sets the boundary: Conceptual graphs are the nearest descendant: they borrow graph-based knowledge representation but have their own formal syntax and semantics.
Manages Complexity¶
Spatial enclosure can make scope and nesting perceptually accessible while making large graphs unwieldy. The calculus compresses some symbolic bookkeeping but shifts complexity into topology, polarity, identity connections, and transformation discipline. The central iconic intuition–formal discipline tradeoff is this: Spatial form can aid insight while resemblance alone does not guarantee validity. A second local rewrite–global scope tension matters because A small diagram edit is convenient while its legality depends on enclosing polarity. The expressive power–diagram manageability tension adds that Beta/Gamma add structure while graphs become visually dense.
Abstract Reasoning¶
Use three linked moves: fix the existential-graph fragment and semantics; parse regions, cuts, atoms, and identity connections before interpreting proximity; translate to a formula when useful to check scope and quantification. As a collapse test, the case exits when spatial marks lack formal interpretation or a transformation is not justified by the chosen existential-graph rules. A fourth check is to apply only transformations licensed in the current polarity/context. A final check is to verify that the transformed graph preserves or entails the intended assertion.
Knowledge Transfer¶
Enclosure, juxtaposition, and graph rewriting transfer to diagrammatic logics, but the Peircean identity requires its sheet semantics and calculus. A concept map inherits neither validity nor quantification merely by looking graphical. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. Spatial signs stand for logical structure. Licensed rewrites implement inference.
Relationships to Other Abstractions¶
Current abstraction Logical graph Domain-specific
Parents (1) — more general patterns this builds on
-
Logical graph is a kind of Representation Prime
A logical graph is a spatial representation and calculus for logical assertions.
Hierarchy path (1) — routes to 1 parentless root
- Logical graph → Representation → Abstraction
Neighborhood in Abstraction Space¶
Logical graph sits in a moderately populated region (40th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Logical Inference, Modality & Conditional Structures (27 abstractions)
Nearest neighbors
- Writing system — 0.90
- Bongard Problem — 0.87
- Logical possibility — 0.87
- Modus ponens — 0.87
- Constructional System — 0.87
Computed from structural-signature embeddings · 2026-10-08