Filter theory of BL algebras

Authors:
Michiro Kondo;Wiesław A. Dudek
Affiliations:
Tokyo Denki University, School of Information Environment, 270-1382, Inzai, Japan;Wroclaw University of Technology, Institute of Mathematics, 50-370, Wroclaw, Poland
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Year:
2007

Citing 0
Cited 11

On v-filters and normal v-filters of a residuated lattice with a weak vt-operator

Information Sciences: an International Journal
Some types of generalized fuzzy filters of BL-algebras

Computers & Mathematics with Applications
On v-filters of residuated lattices with hedges

FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 6
On filter theory of residuated lattices

Information Sciences: an International Journal
Stone-like representation theorems and three-valued filters in R0- algebras (nilpotent minimum algebras)

Fuzzy Sets and Systems
Some types of filters in MTL-algebras

Fuzzy Sets and Systems
Algorithms and Computations in BL-Algebras

International Journal of Artificial Life Research
Folding Theory for Fantastic Filters in BL-Algebras

International Journal of Artificial Life Research
Anti Fuzzy Deductive Systems of BL-Algebras

International Journal of Artificial Life Research
Interval-valued $\mathcal{T}$-fuzzy filters and interval-valued $\mathcal{T}$-fuzzy congruences on residuated lattices

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Implication BL-algebras

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.