A System of Relational Syllogistic Incorporating Full Boolean Reasoning

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
Categories (categorize this paper)
DOI 10.1007/s10849-012-9165-1
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,765
Through your library
References found in this work BETA
Logics for the Relational Syllogistic.Ian Pratt-hartmann & Lawrence S. Moss - 2009 - Review of Symbolic Logic 2 (4):647-683.
Fragments of Language.Ian Pratt-Hartmann - 2004 - Journal of Logic, Language and Information 13 (2):207-223.
More Fragments of Language.Ian Pratt-Hartmann & Allan Third - 2006 - Notre Dame Journal of Formal Logic 47 (2):151-177.

View all 14 references / Add more references

Citations of this work BETA
Equivalential Structures for Binary and Ternary Syllogistics.Selçuk Topal - 2018 - Journal of Logic, Language and Information 27 (1):79-93.

Add more citations

Similar books and articles
Almost Weakly 2-Generic Sets.Stephen A. Fenner - 1994 - Journal of Symbolic Logic 59 (3):868-887.
Degrees Joining to 0'. [REVIEW]David B. Posner & Robert W. Robinson - 1981 - Journal of Symbolic Logic 46 (4):714 - 722.
Relational Complexes.Joop Leo - 2013 - Journal of Philosophical Logic 42 (2):357-390.
Diverse Classes.John T. Baldwin - 1989 - Journal of Symbolic Logic 54 (3):875-893.
New Consecution Calculi for $R^{T}_{\To}$.Katalin Bimbó & J. Michael Dunn - 2012 - Notre Dame Journal of Formal Logic 53 (4):491-509.
Complexity: From Formal Analysis to Final Action.Douglas Frye & Philip David Zelazo - 1998 - Behavioral and Brain Sciences 21 (6):836-837.
Added to PP index

Total downloads
22 ( #252,091 of 2,214,520 )

Recent downloads (6 months)
1 ( #408,327 of 2,214,520 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature