On the Complexity of the Numerically Definite Syllogistic and Related Fragments

Details On the Complexity of the Numerically Definite Syllogistic and Related Fragments On the Complexity of the Numerically Definite Syllogistic and Related Fragments

2007-01-06

arxiv.org/abs/cs/0701039v1

Computer Science

Logic in Computer Science

24 pages 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Complexity of the Numerically Definite Syllogistic and Related Fragments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Complexity of the Numerically Definite Syllogistic and Related Fragments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of the Numerically Definite Syllogistic and Related Fragments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-305532