2010/02/09 by Ruggero Pagnan, Pagnan, Ruggero
Computer Science · Mathematics · #03B99 #18A15 #Algebraic structures and combinatorial models #Category Theory (math.CT) #FOS: Mathematics #Logic (math.LO) #Logic, programming, and type systems #math.CT #math.LO #msc:03B99 #msc:18A15 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1002.1868
20 pages
arxiv created 2010/02/09 · openalex publication_date 2010/02/09 · arxiv updated 2010/02/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.