Journal of Logic, Language and Information

, Volume 21, Issue 4, pp 433–459

# A System of Relational Syllogistic Incorporating Full Boolean Reasoning

Article

DOI: 10.1007/s10849-012-9165-1

Ivanov, N. & Vakarelov, D. J of Log Lang and Inf (2012) 21: 433. doi:10.1007/s10849-012-9165-1

## Abstract

We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form:
$$\begin{array}{ll}\mathbf{Some}\, a \,{\rm are} \,R-{\rm related}\, {\rm to}\, \mathbf{some} \,b;\\ \mathbf{Some}\, a \,{\rm are}\,R-{\rm related}\, {\rm to}\, \mathbf{all}\, b;\\ \mathbf{All}\, a\, {\rm are}\,R-{\rm related}\, {\rm to}\, \mathbf{some}\, b;\\ \mathbf{All}\, a\, {\rm are}\,R-{\rm related}\, {\rm to}\, \mathbf{all} \,b.\end{array}$$
Such primitives formalize sentences from natural language like ‘All students read some textbooks’. Here a, b denote arbitrary sets (of objects), and R denotes an arbitrary binary relation between objects. The language of the logic contains only variables denoting sets, determining the class of set terms, and variables denoting binary relations between objects, determining the class of relational terms. Both classes of terms are closed under the standard Boolean operations. The set of relational terms is also closed under taking the converse of a relation. The results of the paper are the completeness theorem with respect to the intended semantics and the computational complexity of the satisfiability problem.

### Keywords

Relational syllogistics Completeness Complexity