EXPLORING THE LANDSCAPE OF RELATIONAL SYLLOGISTIC LOGICS

Autor:	Alex Kruckman, Lawrence S. Moss
Rok vydání:	2020
Předmět:	FOS: Computer and information sciences Computer Science - Logic in Computer Science Computer Science - Computation and Language Logic Syllogism Mathematics - Logic 0102 computer and information sciences 01 natural sciences Logic in Computer Science (cs.LO) Decidability Algebra Philosophy TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Mathematics (miscellaneous) 010201 computation theory & mathematics Computer Science::Logic in Computer Science Completeness (order theory) 03B20 03B65 FOS: Mathematics Natural (music) Logic (math.LO) Computation and Language (cs.CL) Mathematics
Zdroj:	The Review of Symbolic Logic. 14:728-765
ISSN:	1755-0211 1755-0203
DOI:	10.1017/s1755020320000386
Popis:	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
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c334983081b4aa251ff103fa3270b283 https://doi.org/10.1017/s1755020320000386 Zobrazit plný text záznamu