A System of Relational Syllogistic Incorporating Full Boolean Reasoning
Journal of Logic, Language and Information 21 (4):433-459 (2012)
| 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 | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesIan Pratt-Hartmann (2008). On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics. The Bulletin of Symbolic Logic 14 (1):1 - 28.
Stephen A. Fenner (1994). Almost Weakly 2-Generic Sets. Journal of Symbolic Logic 59 (3):868-887.
David B. Posner & Robert W. Robinson (1981). Degrees Joining to 0'. Journal of Symbolic Logic 46 (4):714 - 722.
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.
Katalin Bimbó & J. Michael Dunn (2012). New Consecution Calculi for $R^{T}_{\To}$. Notre Dame Journal of Formal Logic 53 (4):491-509.
Hajnal Andréka & Szabolcs Mikulás (1994). Lambek Calculus and its Relational Semantics: Completeness and Incompleteness. Journal of Logic, Language and Information 3 (1):1-37.
Silvio Ghilardi & Giancarlo Meloni (1996). Relational and Partial Variable Sets and Basic Predicate Logic. Journal of Symbolic Logic 61 (3):843-872.
Wendy MacCaull (1998). Relational Semantics and a Relational Proof System for Full Lambek Calculus. Journal of Symbolic Logic 63 (2):623-637.
Joanna Golinska-Pilarek & Ewa Orlowska (2006). Relational Logics and Their Applications. In Harrie de Swart, Ewa Orlowska, Gunther Smith & Marc Roubens (eds.), Theory and Applications of Relational Structures as Knowledge Instruments II. Springer.
Damian P. Birney & Graeme S. Halford (2002). Cognitive Complexity of Suppositional Reasoning: An Application of the Relational Complexity Metric to the Knight-Knave Task. Thinking and Reasoning 8 (2):109 – 134.
Steven D. Leonhardi (1997). Generalized Nonsplitting in the Recursively Enumerable Degrees. Journal of Symbolic Logic 62 (2):397-437.
Douglas Frye & Philip David Zelazo (1998). Complexity: From Formal Analysis to Final Action. Behavioral and Brain Sciences 21 (6):836-837.
Juan Pascual-Leone (1998). To Appraise Developmental Difficulty or Mental Demand, Relational Complexity is Not Enough. Behavioral and Brain Sciences 21 (6):843-844.
Kenneth L. Manders (1979). The Theory of All Substructures of a Structure: Characterisation and Decision Problems. Journal of Symbolic Logic 44 (4):583-598.
Analytics
Monthly downloads |
Added to index2012-08-25Total downloads6 ( #145,547 of 549,065 )Recent downloads (6 months)1 ( #63,185 of 549,065 )How can I increase my downloads? |
My notes
Discussion
