Diagrammatic Algebra of First Order Logic
Open Access
- 8 July 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-15
Abstract
We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the calculus of binary relations that has the same expressivity as first order logic and comes with a complete axiomatisation. The axioms are obtained by combining two well known categorical structures: cartesian and linear bicategories.Keywords
All Related Versions
This publication has 54 references indexed in Scilit:
- A String Diagrammatic Axiomatisation of Finite-State Automata2021
- Quotient Completion for the Foundation of Constructive MathematicsLogica Universalis, 2013
- Proof Pearl: Regular Expression Equivalence and Relation AlgebraJournal of Automated Reasoning, 2011
- A Survey of Graphical Languages for Monoidal Categories2010
- Cut Elimination inside a Deep Inference System for Classical Predicate LogicStudia Logica, 2006
- A New Approach to Abstract Syntax with Variable BindingFormal Aspects of Computing, 2002
- Axiomatizability of reducts of algebras of relationsAlgebra universalis, 2000
- Weakly distributive categoriesJournal of Pure and Applied Algebra, 1997
- The geometry of tensor calculus, IAdvances in Mathematics, 1991
- Cartesian bicategories IJournal of Pure and Applied Algebra, 1987