Authors
Michiro Kondo, Wiesław A Dudek
Publication date
2008/3
Journal
Soft Computing
Volume
12
Pages
419-423
Publisher
Springer-Verlag
Description
In this paper we consider fundamental properties of some types of filters (Boolean, positive implicative, implicative and fantastic filters) of BL algebras defined in Haveshki et al. (Soft Comput 10:657–664, 2006) and Turunen (Arch Math Logic 40:467–473, 2001). It is proved in Haveshki et al. (2006) that if F is a maximal and (positive) implicative filter then it is a Boolean filter. In that paper there is an open problem
Under what condition are Boolean filters positive implicative filters?
One of our results gives an answer to the problem, that is, we need no more conditions. Moreover, we give simple characterizations of those filters by an identity form ∀ x, y(t(x, y) ∈ F), where t(x, y) is a term containing x, y.
Total citations
200820092010201120122013201420152016201720182019202020212022202320243118121614211413946108763
Scholar articles
M Kondo, WA Dudek - Soft Computing, 2008