EXPLORING THE LANDSCAPE OF RELATIONAL SYLLOGISTIC LOGICS

REVIEW OF SYMBOLIC LOGIC（2021）

引用 1|浏览10

暂无评分

摘要

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.

查看译文

关键词

natural logic, syllogistic logic, proof systems, completeness, computational complexity

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要