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.

Version: v1 · 2026-09-28 · History
Domain-specific #: 10482
Domain group: Humanities
Origin domain: Philosophy
Subdomains: Logic, Existential Graphs, Diagrammatic Reasoning → Philosophy

Core Idea¶

A logical graph here means Peirce's existential-graph system: an iconic notation for logical assertions paired with a formal calculus. Instead of writing only a linear formula, the reasoner places predicate and identity marks on a sheet of assertion, juxtaposes compatible claims, and encloses graphs in cuts whose nesting changes logical context.

The Alpha system expresses propositional structure with blank graphs, juxtaposition, and cuts. Beta adds devices for quantification and identity; Gamma explores further modalities and higher expressive devices. Exact vocabulary differs among presentations, so a graph must name its fragment and interpretation rather than mixing signs from different reconstructions.

Inference operates by licensed diagram transformations such as insertion, erasure, iteration, and deiteration under polarity and nesting constraints. Soundness lies in the relation between those rewrites and logical semantics, not in visual intuitiveness alone. The system's limited historical adoption and later scholarly reconstruction should be distinguished from contemporary conceptual graphs, which are influenced by it but not identical.

Structural Signature¶

Sig role-phrases:

sheet of assertion. Provides the region in which placed signs are jointly asserted under a context. Constitutive semantic ground. If altered: A decorative page has no assertion convention.
graphical atoms and identity. Represent predicates, individuals, or continuity through marks and lines. Constitutive representational elements. If altered: Exact interpretation depends on Alpha/Beta/Gamma fragment.
cuts and nesting. Use enclosures to alter logical context, classically supporting negation and scope. Identity-bearing spatial syntax. If altered: An arbitrary circle is not a logical cut.
juxtaposition. Combines graphs on a common sheet or region as a logical conjunction-like assertion. Constitutive composition rule. If altered: Visual proximity without the convention is insufficient.
transformation rules. Permit insertion, erasure, iteration, deiteration, and related sound graph rewrites. Constitutive calculus. If altered: A picture without licensed transformations is notation but not the full calculus.

What It Is Not¶

Not any node–edge graph. Graph theory structure alone lacks existential-graph semantics.
Not a Venn diagram. Cuts and placement obey another calculus.
Not merely notation. The full system includes inference rules.
Not conceptual graphs. Those are a later, distinct knowledge-representation formalism.

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.

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.

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.

Abstract Reasoning¶

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.
Apply only transformations licensed in the current polarity/context.
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.

Examples¶

Canonical¶

An Alpha graph places P and Q together on the sheet to assert their conjunction and surrounds P with a cut to express negation, with nested cuts interpreted under the stated polarity rules.

Mapped back: sheet of assertion → outer asserted region; graphical atoms and identity → P and Q; cuts and nesting → negating enclosure; juxtaposition → shared-region conjunction; transformation rules → Alpha rewrite conditions.

Applied / In Practice¶

A proof exercise starts from a Beta existential graph, tracks identity lines and cut nesting, uses a licensed iteration followed by erasure, and checks the resulting first-order formula rather than accepting a visually appealing shortcut.

Mapped back: sheet of assertion → proof context; graphical atoms and identity → predicate marks/identity lines; cuts and nesting → quantifier and polarity scope; juxtaposition → joint claims; transformation rules → iteration and erasure.

Structural Tensions¶

T1: iconic intuition vs. formal discipline. Spatial form can aid insight while resemblance alone does not guarantee validity. Diagnostic: Which semantic rule interprets this mark?

T2: local rewrite vs. global scope. A small diagram edit is convenient while its legality depends on enclosing polarity. Diagnostic: What region contains the occurrence?

T3: expressive power vs. diagram manageability. Beta/Gamma add structure while graphs become visually dense. Diagnostic: Would formula translation expose hidden scope?

Structural–Framed Character¶

Logical graphs are structural. Their topology, semantics, and rewrite rules are formal, though notation choices and claims of intuitive superiority are historically framed. Their portable skeleton is Representation, related rather than a strict parent because existential graphs are a specific logic. Evaluative weight is low; practice affects readability; institutional origin is logic/semiotics; vocabulary travels only with semantics. Its character: an iconic formal representation whose spatial transformations carry inferential force.

Structural Core vs. Domain Accent¶

Skeletal core. Encode relations through placement and enclosure, then reason by semantics-preserving transformations.

Domain-bound accent. Peirce, sheets, cuts, identity lines, Alpha/Beta/Gamma, and proof rules define existential graphs.

Why not prime. Representation and rewriting travel, but this is a particular logical notation/calculus.

This entry is a kind of Representation.

Representation. Spatial signs stand for logical structure.
Transformation. Licensed rewrites implement inference.
No strict DAG edge is added.

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 (40^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Logical Inference, Modality & Conditional Structures (27 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Existential graph. Tell: This is the intended Peircean identity, not generic graph existence.
Conceptual graph. Tell: Is the later knowledge-representation formalism intended?
Venn diagram. Tell: Are sets or logical cuts being represented?
Graph theory. Tell: Do vertices/edges or spatial logical syntax define the object?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Existential_graph (revision 1360656913).
Preserved source candidate: https://archive.org/details/writingsofcharle0002peir
Preserved source candidate: http://dx.doi.org/10.1007/978-3-642-86718-7_13
Preserved source candidate: https://books.google.com/books?id=Gqs0DwAAQBAJ&q=Ogden+Welby&pg=PT244
Preserved source candidate: https://archive.org/details/beginningthirdr00randgoog/page/n58
Preserved source candidate: http://psychclassics.yorku.ca/Baldwin/Dictionary/defs/L4defs.htm#Logical%20Diagram
Preserved source candidate: https://web.archive.org/web/20050901083355/http://www.existentialgraphs.com/#table2
Preserved source candidate: https://archive.org/details/beginningthirdr00randgoog/page/n671
Preserved source candidate: https://books.google.com/books?id=3KoLAAAAIAAJ&pg=RA2-PA492

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.