1. *Corresponding Author: M. A. Hashemi, Email: m.a.hashemipnu@gmail.com
REVIEW ARTICLE
Available Online at
What is (fuzzy) fantastic filter in lattice implication algebras?
1
M. A. Hashemi*
1
*Department of Mathematics, Payame Noor University, P. O. Box: 19395-3697, Tehran, Iran
Received on: 08/03/2017, Revised on: 14/03/2017, Accepted on: 22/03/2017
ABSTRACT
In this paper we prove that the notion of (fuzzy) fantastic filters, introduced by Y. B. Jun in [1, 2]
, is
equivalent of (fuzzy)filter and it is not a different (fuzzy) filter in lattice implication algebras.
Keywords: Filter, fantastic filter. AMS:03 G10, 06B10, 54E15.
INTRODUCTION
Non-classical logic has become a considerable formal tool for computer science and artificial intelligence
to deal with fuzzy information and uncertainty information. Many-valued logic, a great extension and
development of classical logic, has always been a crucial direction in non-classical logic. In order to
research the many-valued logical system whose propositional value is given in a lattice, in 1990 Xu [3]
proposed the concept of lattice implication algebra. In lattice implication algebra, filters are important
substructures; they play a significant role in studying the structure and the properties of lattice implication
algebras [4]. In [1], Jun defined and studied the notion of fantastic filter in lattice implication algebras.
Then some other researchers worked on this filter [2, 5, 6]
. In this paper, we'll prove that the notation of
fantastic filters is equivalent of filter and it is not a different filter in lattice implication algebras.
Definition 1: Lattice implication algebra is defined to be a bounded lattice (L; ν; Λ; 0; 1) with order-
reversing involution "′" and a binary operation “→ ". In the sequel the binary operation "→" will be
denoted by juxtaposition. In a lattice implication algebra L, the following hold:
(I1) x (yz) = y(xz);
(I2) xx = 1;
(I3) xy = y′x′;
(I4) xy = yx = 1) x = y;
(I5) (xy) y = (yx) x;
(L1) (x ν y) z = (xz) ^ (yz);
(L2) (x ^ y)z = (xz) ν (yz);
For all x; y; z € L.
We can define a partial ordering ≤ on a lattice implication algebra L by x ≤ y if and only if xy = 1.
Definition 2. In a lattice implication algebra L, the following hold:
(P1) 0x = 1; 1x = x and x1 = 1.
(P2) xy ≤ (yz) (xz).
(P3) x ≤ y implies yz ≤ xz and zx ≤ zy.
(P4) x′ = x0.
(P5) x ν y = (xy)y.
(P6) ((yx) y′)′ = x ^ y = ((xy) x′) ′.
(P7) x ≤ (xy) y.
www.ajms.in
Asian Journal of Mathematical Sciences 2017; 1(2):105-106