Exploring the Landscape of Relational Syllogistic Logics
arXiv:1809.00656 · doi:10.1017/S1755020320000386
Abstract
This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and complexity results for a natural subfamily of relational syllogistic logics, parametrized by constructors for terms and for sentences.
Final version