A system of relational syllogistic incorporating full Boolean reasoning
From MaRDI portal
Publication:2255203
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4148058 (Why is no real title available?)
- scientific article; zbMATH DE number 1989660 (Why is no real title available?)
- scientific article; zbMATH DE number 218546 (Why is no real title available?)
- scientific article; zbMATH DE number 218547 (Why is no real title available?)
- scientific article; zbMATH DE number 5241969 (Why is no real title available?)
- A logic for natural language
- A qualitative approach to syllogistic reasoning
- Aristotelian syllogisms and generalized quantifiers
- Aristotle's syllogistic from the standpoint of modern formal logic
- Basic quantifier theory
- Complexity of the two-variable fragment with counting quantifiers
- Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
- Dynamic logics of the region-based theory of discrete spaces
- Extracting java library subsets for deployment on embedded systems
- Fragments of language
- LOGICS FOR THE RELATIONAL SYLLOGISTIC
- More fragments of language.
- Natural language syntax and first-order inference
- No Syllogisms for the Numerical Syllogistic
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
- On the interpretation of Aristotelian syllogistic
- Syllogistic logic with complements
- Syllogistic logics with verbs
- 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
- scientific article; zbMATH DE number 2063838 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 2079033 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1416393 (Why is no real title available?)
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)
