On the Complexity of the Numerically Definite Syllogistic and Related Fragments
Logic in Computer Science
2024-04-19 v1 Artificial Intelligence
Computational Complexity
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.
Cite
@article{arxiv.cs/0701039,
title = {On the Complexity of the Numerically Definite Syllogistic and Related Fragments},
author = {Ian Pratt-Hartmann},
journal= {arXiv preprint arXiv:cs/0701039},
year = {2024}
}
Comments
24 pages 1 figure