2000 character limit reached
A diagrammatic calculus of n-term syllogisms
Published 9 Feb 2010 in math.LO and math.CT | (1002.1868v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
