Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: She, Yanhong* | He, Xiaoli
Affiliations: College of Science, Xi’an Shiyou University, Xi’an, China
Correspondence: [*] Corresponding author. Yanhong She, College of Science, Xi’an Shiyou University, Xi’an 710065, China. E-mail: [email protected].
Note: [1] Project supported by the National Nature Science Fund of China under Grant 61472471, the Natural Science Program for Basic Research of Shaanxi Province, China (No. 2014JQ1032).
Abstract: Equipping NM-algebras with a Brouwer-like negation ∼, we introduce a kind of algebra under the name BZNM-algebra in the present paper and investigate its algebraic properties in detail. By means of the Brouwer-like negation ∼ and the internal Kleene negation ¬ in NM-algebras, two types of modal operators μ and ν on BZNM-algebras are defined. For any element a of BZNM-algebra, μ (a) and ν (a) turn out to be the best approximation of a from the bottom and the top, respectively, with Boolean skeleton serving as the collection of sharp elements. It is also shown that these two modal operators turn to have an S5 behavior. Additionally, various types of sharp elements with respect to the negation operators including ∼, ¬, ♭ (an anti-intuitionistic negation) are defined, and the relationship between these sets and that of ⊗-idempotent (⊕-idempotent) elements are also investigated. It is then proved that the proposed BZNM-algebras are indeed equivalent to NM▵ algebras under a suitable transformation of operators. Furthermore, a special kind of BZNM-algebras, i.e., BZNM3-algebras, is investigated and its equivalent characterizations are given. A new type of rough approximation operators are proposed, and it is shown that such a pair of approximation operators is equivalent to the defined operators μ and ν. Finally, two interesting examples of BZNM-algebras are presented.
Keywords: Nilpotent minimum algebra, kleene negation, brouwer-like negation, rough set
DOI: 10.3233/IFS-141510
Journal: Journal of Intelligent & Fuzzy Systems, vol. 29, no. 4, pp. 1367-1380, 2015
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]