Knowledge Mining about the Generalized Modal Syllogism E▯M◇F-2 with the Quantifiers in Square<i>{fewer than half of the}</i> and Square<i>{no}</i>
SCIREA Journal of Computer · 2019
DOI: 10.54647/computer520416 ↗At a glance
Journal article in SCIREA Journal of Computer, 2019. Written by Mingwei Ma and 1 co-authors.
Abstract (original language)
: On the basis of set theory, generalized quantifier theory, and modal logic, this paper mainly focuses on the knowledge mining about generalized modal syllogism with the quantifiers in Square{ fewer than half of the } and Square{ no }. To this end, this paper firstly proves the validity of the non-trivial syllogism E M ◇ F-2, and deduces other 22 valid non-trivial generalized modal syllogisms based on relative reduction operations. The reason why syllogisms with different figures and forms can be mutually reduced is that any quantifier in Square{ fewer than half of the } and Square{ no } can define the other three quantifiers, and the necessary and possible modality are mutually dual. Since all the proofs in this article are deductive reasoning, their conclusions are consistent.
Cite
APA
Ma, M., & Cao, Q. (2019). Knowledge Mining about the Generalized Modal Syllogism E▯M◇F-2 with the Quantifiers in Square{fewer than half of the} and Square{no}. SCIREA Journal of Computer. https://doi.org/10.54647/computer520416
Vancouver
Ma M, Cao Q. Knowledge Mining about the Generalized Modal Syllogism E▯M◇F-2 with the Quantifiers in Square{fewer than half of the} and Square{no}. SCIREA Journal of Computer. 2019. doi:10.54647/computer520416
BibTeX
@article{Ma2019,
author = {Ma, Mingwei and Cao, Qing},
title = {Knowledge Mining about the Generalized Modal Syllogism E▯M◇F-2 with the Quantifiers in Squarefewer than half of the and Squareno},
journal = {SCIREA Journal of Computer},
year = {2019},
doi = {10.54647/computer520416}
}
EUVIMED