Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2007
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/cs/0701039 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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.