EXPLORING THE LANDSCAPE OF RELATIONAL SYLLOGISTIC LOGICS
-
Published:2020-10-21
Issue:3
Volume:14
Page:728-765
-
ISSN:1755-0203
-
Container-title:The Review of Symbolic Logic
-
language:en
-
Short-container-title:The Review of Symbolic Logic
Author:
KRUCKMAN ALEX,MOSS LAWRENCE S.
Abstract
AbstractThis 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.
Publisher
Cambridge University Press (CUP)
Subject
Logic,Philosophy,Mathematics (miscellaneous)
Reference12 articles.
1. The Relational Syllogistic Revisited
2. Automatic recognition of tractability in inference relations
3. [12] Spaan, E . (1993). Complexity of Modal Logics. Ph.D. Thesis, ILLC, University of Amsterdam.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Epistemic Syllogistic: First Steps;Electronic Proceedings in Theoretical Computer Science;2023-07-11