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.
翻译:本文探讨关系线逻辑,这是一套逻辑系统,与古典逻辑扩展中关系推理相关的逻辑系统,所有这些都是可分解的逻辑系统。 我们证明了关系线逻辑的自然亚系列的完整性理论和复杂性结果,由构建者对术语和刑期进行平衡。