A system of relational syllogistic incorporating full Boolean reasoning
From MaRDI portal
Publication:2255203
DOI10.1007/s10849-012-9165-1zbMath1305.03025arXiv1102.4496MaRDI QIDQ2255203
Publication date: 9 February 2015
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.4496
03B65: Logic of natural languages
03B20: Subsystems of classical logic (including intuitionistic logic)
Related Items
Equivalential structures for binary and ternary syllogistics, Relational syllogisms with numerical quantifiers and beyond
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More fragments of language.
- Aristotelian syllogisms and generalized quantifiers
- A logic for natural language
- Natural language syntax and first-order inference
- A qualitative approach to syllogistic reasoning
- Fragments of language
- Extracting java library subsets for deployment on embedded systems
- Complexity of the two-variable fragment with counting quantifiers
- Aristotle's syllogistic from the standpoint of modern formal logic
- On the interpretation of Aristotelian syllogistic
- Syllogistic Logics with Verbs
- No Syllogisms for the Numerical Syllogistic
- Dynamic logics of the region-based theory of discrete spaces
- Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
- The Data Complexity of the Syllogistic Fragments of English
- Syllogistic Logic with Complements
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
- LOGICS FOR THE RELATIONAL SYLLOGISTIC
