A system of relational syllogistic incorporating full Boolean reasoning
From MaRDI portal
Publication:2255203
DOI10.1007/S10849-012-9165-1zbMATH Open1305.03025arXiv1102.4496OpenAlexW2049055787MaRDI QIDQ2255203FDOQ2255203
Authors: Yanyan Li 
Publication date: 9 February 2015
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Abstract: We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some A are R-related to some B; Some A are R-related to all B; All A are R-related to some B; All A are R-related to all B. Such primitives formalize sentences from natural language like `All students read some textbooks'. Here A and 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.
Full work available at URL: https://arxiv.org/abs/1102.4496
Recommendations
Logic of natural languages (03B65) Subsystems of classical logic (including intuitionistic logic) (03B20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Aristotelian syllogisms and generalized quantifiers
- Complexity of the two-variable fragment with counting quantifiers
- On the interpretation of Aristotelian syllogistic
- Aristotle's syllogistic from the standpoint of modern formal logic
- LOGICS FOR THE RELATIONAL SYLLOGISTIC
- Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
- Syllogistic logics with verbs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dynamic logics of the region-based theory of discrete spaces
- More fragments of language.
- Fragments of language
- A logic for natural language
- Natural language syntax and first-order inference
- Syllogistic logic with complements
- A qualitative approach to syllogistic reasoning
- Extracting java library subsets for deployment on embedded systems
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
- Basic quantifier theory
- No Syllogisms for the Numerical Syllogistic
- The data complexity of the syllogistic fragments of English
Cited In (13)
- A generalized syllogistic inference system based on inclusion and exclusion relations
- Reasoning on relations, modalities, and sets
- Title not available (Why is that?)
- Boolean logics with relations
- Equivalential structures for binary and ternary syllogistics
- About relationships between two individuals
- Mechanizing logic. I: Map logic extended formally to relational arguments
- Title not available (Why is that?)
- Relational syllogisms with numerical quantifiers and beyond
- A relational syllogistic
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
- Exploring the landscape of relational syllogistic logics
- Title not available (Why is that?)
This page was built for publication: A system of relational syllogistic incorporating full Boolean reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2255203)
