| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 391036 | Fuzzy Sets and Systems | 2008 | 5 Pages |
Abstract
In this paper, Ying's prenex normal form theorem for linguistic quantifiers is strengthened so that it behaves like the one in the classical logic. This result further shows elegant logical properties of Ying's framework.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
