A diagrammatic calculus of n-term syllogisms

We extend the diagrammatic calculus of syllogisms introduced in our previous paper to the general case of n-term syllogisms, showing that the valid ones are exactly those whose conclusion follows by calculation. Moreover, by pointing out the existing connections with the theory of rewriting systems we will also single out a suitable category theoretic framework for the calculus.

💡 Research Summary

The paper presents a comprehensive extension of a previously introduced diagrammatic calculus for traditional three‑term syllogisms to the general case of n‑term syllogisms. The authors begin by recalling the classic Aristotelian framework, where a syllogism consists of two premises linking three terms, and note that the earlier diagrammatic approach represents each premise as a directed edge between term nodes in a graph. The core contribution is a systematic method for handling an arbitrary number of terms and premises.

In the extended calculus, each term is a vertex, and each premise is a directed edge (or a set of edges for compound premises) connecting two vertices. A collection of premises forms a labeled directed multigraph, called a “diagram”. The authors introduce two fundamental rewrite operations: Connect and Reduce. Connect merges two diagrams that share at least one common vertex, effectively concatenating the corresponding edges. Reduce eliminates redundant vertices and edges, collapsing sub‑graphs that represent intermediate terms into a single edge that directly links the initial and final terms. By iteratively applying these operations, any finite set of premises can be transformed into a normal form consisting of a single edge; this edge encodes the conclusion of the syllogism.

The paper proves that the rewrite system is terminating (every sequence of rewrites reaches a normal form after a finite number of steps) and confluent (different rewrite orders always converge to the same normal form). These properties guarantee that the calculus is both sound (only logically valid conclusions can be derived) and complete (every logically valid n‑term syllogism can be derived by the calculus). The authors formalize termination by showing that each rewrite strictly reduces a well‑founded measure (the total number of vertices plus edges), while confluence is established via a diamond‑property analysis of overlapping rewrite steps.

Beyond the operational perspective, the authors embed the calculus in a categorical framework. Diagrams are treated as objects in a category, while Connect and Reduce are morphisms. The merging of diagrams corresponds to a pushout construction, and the final conclusion edge arises as a co‑span. This categorical interpretation reveals that the diagrammatic calculus is a concrete instance of a free diagram category equipped with a set of rewriting rules, linking logical inference to well‑studied structures in category theory.

Several illustrative examples are provided. A four‑term syllogism such as “All humans are animals; all animals are living beings; all living beings are material” is represented as a chain of three edges. Applying Connect and Reduce yields a single edge “All humans are material”, demonstrating the method’s correctness. The paper also sketches how to handle disjunctive premises and negations by extending the graph language with labeled edges and additional rewrite rules, although a full treatment of these richer logics is left for future work.

In the discussion, the authors argue that the diagrammatic calculus offers both pedagogical and computational benefits. Visually, it makes the flow of logical dependence transparent, aiding students in tracing arguments and spotting fallacies. Computationally, the rewrite system’s guaranteed termination and confluence make it suitable for implementation in automated theorem provers or logic programming environments. The categorical viewpoint further suggests connections to existing proof‑theoretic frameworks, such as string diagrams for monoidal categories, opening avenues for cross‑disciplinary research.

The conclusion summarizes the achievements: a sound, complete, and algorithmically tractable calculus for n‑term syllogisms, a rigorous link to rewriting theory, and a categorical semantics that situates the work within modern mathematical logic. The authors propose future extensions to handle quantified statements, modal operators, and to develop software tools that realize the calculus in practice.