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: Xiao, Lei | Liu, Lianzhen*
Affiliations: School of Science, Jiangnan University, Wuxi, China
Correspondence: [*] Corresponding author. Lianzhen Liu, School of Science, Jiangnan University, 214122 Wuxi, China. Tel.: +86 18915328585; Fax: +86 051085910532; E-mail: [email protected].
Abstract: Recently, the notions of EIMTL-filters, associative filters, t-filters and I-filters were introduced in MTL-algebras and residuated lattices, respectively. In this paper, we consider these filters in residuated lattices and study some properties of them. We prove that t-filters and I-filters coincide in residuated lattices. The conditions under which an EIMTL-filter is a t-filter, and under which a residuated lattice has a proper associative filter are established. We also study the existence of a proper EIMTL-filter and prove that every maximal filter is an EIMTL-filter, and hence all residuated lattices have proper EIMTL-filters.
Keywords: Residuated lattice, EIMTL-filter, associative filter, t-filter
DOI: 10.3233/IFS-151774
Journal: Journal of Intelligent & Fuzzy Systems, vol. 30, no. 1, pp. 493-500, 2016
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]