A System of Relational Syllogistic Incorporating Full Boolean Reasoning

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


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,105
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Ian Pratt-Hartmann (2004). Fragments of Language. Journal of Logic, Language and Information 13 (2):207-223.

View all 12 references

Citations of this work BETA

No citations found.

Similar books and articles
Stephen A. Fenner (1994). Almost Weakly 2-Generic Sets. Journal of Symbolic Logic 59 (3):868-887.
Joop Leo (2013). Relational Complexes. Journal of Philosophical Logic 42 (2):357-390.
John T. Baldwin (1989). Diverse Classes. Journal of Symbolic Logic 54 (3):875-893.
Analytics

Monthly downloads

Added to index

2012-08-25

Total downloads

15 ( #108,396 of 1,101,679 )

Recent downloads (6 months)

7 ( #35,000 of 1,101,679 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.