期刊
SOFT COMPUTING
卷 12, 期 5, 页码 419-423出版社
SPRINGER
DOI: 10.1007/s00500-007-0178-7
关键词
(positive) implicative filter; Boolean filter; fantastic filter; BL algebra
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 for all x, y(t(x, y) is an element of F), where t(x, y) is a term containing x, y.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据