💻 computer science

The calculus of neo-Peircean relations

This paper demonstrates that by shifting from traditional cartesian syntax to a diagrammatic monoidal framework, it is possible to achieve a complete axiomatisation for the full calculus of relations—circumventing previous no-go theorems—by introducing the "calculus of neo-Peircean relations," which combines cartesian and linear bicategories to attain the expressiveness of first-order logic.

Original authors: Filippo Bonchi, Alessandro Di Giorgio, Nathan Haydon, Pawel Sobocinski

Published 2026-04-10

📖 4 min read☕ Coffee break read

CC BY 4.0

Original authors: Filippo Bonchi, Alessandro Di Giorgio, Nathan Haydon, Pawel Sobocinski

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to describe the world using only logic. For over a century, mathematicians have struggled with a specific tool called the Calculus of Relations. Think of this tool as a very strict, old-fashioned language for describing how things connect (like "Alice loves Bob" or "The key opens the door").

The problem with this old language is that it has a major flaw: it can't express everything. It's like trying to describe a complex movie using only a list of ingredients. You can list the actors and props, but you can't easily describe the plot twists, the "what-ifs," or the universal rules without getting stuck. In fact, for decades, experts thought it was impossible to create a perfect set of rules (axioms) to fix this language. It was considered "broken."

The Big Idea: Switching from Text to Pictures

This paper introduces a revolutionary new language called the Calculus of Neo-Peircean Relations. The authors' secret weapon? They stopped writing logic as text (like algebra) and started drawing it as pictures.

Here is the analogy:

The Old Way (Text): Imagine trying to explain how to build a house by writing a long, confusing paragraph. "First, take the bricks, then put them on the cement, but make sure the cement is wet..." It's hard to see the whole picture.
The New Way (Diagrams): Now, imagine you just draw the house. You see the walls, the roof, and the windows instantly. You can see how they connect without reading a single word.

In this new language, logical statements are string diagrams.

A wire represents a piece of data (like a person or an object).
A box represents a rule or a relationship (like "loves" or "is taller than").
Connecting wires shows how these rules interact.

The "Magic" of the New System

The authors discovered that by using these diagrams, they could solve the "broken" problem of the old language. Here is how they did it, using two simple concepts:

The White and Black Worlds:
Think of the diagram as having two layers of reality, like a photograph and its negative.
- The White Layer (Existential): This is the "Yes" world. It asks, "Does there exist at least one way this can happen?" (e.g., "Is there a key that opens this door?").
- The Black Layer (Universal): This is the "No/All" world. It asks, "Is it true for every single case?" (e.g., "Does this key work for every door?").
The old language could only handle the "White" layer well. The new language allows you to flip the picture (turn white to black) to handle the "Black" layer. By combining them, they can express everything in First-Order Logic (the standard language of modern math and computer science).
The "Tao of Logic":
The authors created a set of rules for how to move these boxes and wires around. They call this the "Tao of Logic."
- Imagine you are playing with magnetic tiles on a board. You can slide a tile, flip it over, or stack it.
- The paper proves that if you can turn one picture into another using these simple moves, then the two logical statements are equivalent.
- Most importantly, they proved that you can prove any true logical statement just by rearranging these tiles. This solves the 80-year-old mystery that Tarski posed: "Is there a complete set of rules for this?" The answer is Yes, but only if you use pictures instead of text.

Why Does This Matter?

No More "Empty" Traps: Traditional logic gets confused when you talk about "nothing" (empty sets). This new system handles empty spaces naturally, making it more robust.
Computer Proof Assistants: Because the rules are so visual and mechanical (like moving puzzle pieces), computers can easily check if a proof is correct. This is huge for verifying safety in AI, software, and hardware.
A Tribute to Peirce: The paper honors Charles Sanders Peirce, a 19th-century genius who invented "Existential Graphs" (early versions of these diagrams). Peirce was ahead of his time, but his ideas were forgotten. This paper brings his vision back to life, proving that his intuition was correct all along.

In a Nutshell

The authors took a broken, text-based logic system that couldn't express the full complexity of the world, and rebuilt it using visual diagrams. By treating logic like a game of connecting wires and flipping colors, they created a system that is:

Complete: It can prove anything that is true.
Simple: It uses visual intuition instead of confusing algebra.
Powerful: It unifies different branches of math and logic into one elegant framework.

They didn't just fix the old tool; they gave us a whole new toolbox where the rules are as simple as rearranging a puzzle.

1. Problem Statement

The paper addresses a long-standing limitation in the Calculus of Relations (CR), a relational algebraic system introduced by De Morgan and Peirce in the 19th century.

The Limitation: While CR offers a quantifier-free, purely equational logic (substituting equals for equals), it suffers from two critical flaws identified by Tarski and later proven by others:
1. Expressivity: It is strictly less expressive than First-Order Logic (FOL); it cannot express universal quantification or negation effectively within its original binary framework.
2. Axiomatizability: There is no finite complete axiomatization for CR or many of its fragments (no-go theorems).
The Goal: The authors aim to overcome these limitations by constructing a calculus that retains the benefits of CR (quantifier-free, equational reasoning) while achieving the full expressivity of FOL and admitting a complete, finite axiomatization.

2. Methodology

The authors propose a radical shift in syntax and semantics, moving from traditional Cartesian syntax (terms with variables and bindings) to a Diagrammatic (Monoidal) syntax based on string diagrams.

From Binary to Arbitrary Relations: Instead of restricting relations to binary sets ( $X \times X$ ), the calculus handles relations of arbitrary arity and coarity ( $X^n \times X^m$ ).
Dual Compositions: The calculus utilizes two distinct composition operations, inspired by Peirce's "Note B":
1. White Composition ( $\circ$ ): Corresponds to standard relational composition (existential quantification).
2. Black Composition ( $\bullet$ ): Corresponds to the De Morgan dual (universal quantification).
Categorical Structures: The methodology synthesizes three well-known categorical structures:
1. Cartesian Bicategories: Capture the existential-conjunctive fragment (white structure).
2. Cocartesian Bicategories: Capture the universal-disjunctive fragment (black structure).
3. Linear Bicategories: Provide the interaction rules (linear distributivity) between the two compositions.
First-Order Bicategories (fo-bicategories): The core innovation is the definition of a new structure, the fo-bicategory, which combines cartesian, cocartesian, and linear bicategories. It introduces linear adjunctions between white (co)monoids and black (co)monoids, and satisfies "linear Frobenius" laws.

3. Key Contributions

A. The Calculus of Neo-Peircean Relations (NPR)

The authors define NPR, a string diagrammatic language where:

Syntax: Terms are generated by a context-free grammar involving white and black constants (copiers, dischargers, symmetries) and operations.
Semantics: Interpreted over sets and relations. Crucially, the semantics allows for empty domains, a feature often forbidden in classical FOL but essential for capturing propositional logic within the same framework.
Expressivity: NPR is shown to be as expressive as full First-Order Logic with Equality. It can encode FOL, CR, Quine's Predicate Functor Logic (PFL), and Peirce's Existential Graphs.

B. Complete Axiomatization

The paper provides a finite, complete axiomatization for NPR.

The Axioms: Derived from the interaction of the three categorical structures (Figures 4–7 in the paper). Key axioms include linear distributivity ( $\circ$ over $\bullet$ ), linear adjunctions (relating white and black structures), and linear Frobenius laws.
Completeness Theorem: The authors prove that for any two terms $c, d$ , $c \leq d$ holds semantically if and only if $c \leq d$ is derivable syntactically using the axioms.
Proof Technique: The completeness proof is a diagrammatic adaptation of Henkin's proof for Gödel's completeness theorem. It constructs a "Henkin model" using the set of maps (constants) in the free theory. A significant novelty is the handling of trivial theories (those with empty domains), which correspond to propositional logic, extending Gödel completeness to include empty models.

C. "The Tao of Logic"

The authors present a visual summary of the axioms (dubbed "The Tao of Logic"), illustrating how white and black structures interact via linear adjunctions and Frobenius laws. This visual approach simplifies complex algebraic manipulations into "diagram surgery."

D. Deep Inference and Proof Theory

The calculus naturally aligns with Deep Inference systems (like the Calculus of Structures). Because the axioms can be applied anywhere within a diagram (not just at the root), the system avoids the bureaucratic overhead of variable binding and substitution, making it highly suitable for proof assistants.

4. Results

Completeness: The laws of fo-bicategories provide a complete axiomatization for First-Order Logic.
Expressivity: NPR subsumes CR, PFL, and EGs, proving that a quantifier-free, diagrammatic system can capture full FOL.
Empty Models: The calculus naturally handles empty domains. The authors show that theories with empty models are exactly the propositional theories, and the axiomatization simplifies to the deep inference rules of the Calculus of Structures in this limit.
Encoding: The paper provides explicit, semantics-preserving encodings from FOL, CR, and PFL into NPR, demonstrating the system's universality.

5. Significance

Solving Tarski's Problem: The paper offers a "yes" answer to Tarski's question about the axiomatizability of relational calculi, but with a caveat: one must abandon traditional Cartesian syntax in favor of diagrammatic (monoidal) syntax.
Unification: It unifies disparate logical systems (CR, FOL, PFL, EGs) under a single algebraic and categorical framework.
Computational Utility: By eliminating variable binding and substitution, the calculus offers a robust foundation for automated reasoning, database theory, and programming language semantics. The ability to perform "diagram surgery" allows for intuitive and rigorous proofs.
Categorical Foundations: It establishes fo-bicategories as a fundamental structure for logic, bridging the gap between algebraic logic and category theory. It suggests that Peirce's intuitions about graphical syntax were prescient of modern categorical logic.

In summary, the paper demonstrates that by moving to a diagrammatic syntax and utilizing the interaction between cartesian and linear bicategories, it is possible to create a complete, quantifier-free, and fully expressive calculus for First-Order Logic, effectively reviving and modernizing Peirce's vision.