On the Complexity of the Numerically Definite Syllogistic and Related Fragments
<|reference_start|>On the Complexity of the Numerically Definite Syllogistic and Related Fragments: 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.<|reference_end|>
@article{pratt-hartmann2007on,
    title={On the Complexity of the Numerically Definite Syllogistic and Related
  Fragments},
    author={Ian Pratt-Hartmann},
    journal={Bulletin of Symbolic Logic, 14(1), 2008, pp. 1--28},
    year={2007},
    doi={10.2178/bsl/1208358842},
    archivePrefix={arXiv},
    eprint={cs/0701039},
    primaryClass={cs.LO cs.AI cs.CC}
}