2000 character limit reached
On the Complexity of the Numerically Definite Syllogistic and Related Fragments
Published 6 Jan 2007 in cs.LO, cs.AI, and cs.CC | (0701039v1)
Abstract: In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of some recently proposed proof-systems for these logics.
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.