Anti Fuzzy Deductive Systems of BL-Algebras

Anti Fuzzy Deductive Systems of BL-Algebras

Cyrille Nganteu Tchikapa (Department of Mathematics, GHS of Batchenga, Batchenga, Cameroon)
Copyright: © 2012 |Pages: 9
DOI: 10.4018/jalr.2012070103
OnDemand PDF Download:
$37.50

Abstract

The aim of this paper is to introduce the notion of anti fuzzy (prime) deductive system in BL-algebra and to investigate their properties. It is shown that the set of all deductive systems (with the empty set) of a BL-algebra X is equipotent to a quotient of the set of all anti fuzzy deductive systems of X. The anti fuzzy prime deductive system theorem of BL-algebras is also proved.
Article Preview

2. Preliminaries

We recollect some definitions and results which will be used in the following and weshall not cite them every time they are used.

  • Definition 2.1: A BL-algebra is an algebra of type (2; 2; 2; 2; 0; 0) that satisfies the following conditions:

  • BL-1: is a bounded lattice;

  • BL-2:is an commutative monoid, i.e., is commutative and associative with ;

  • BL-3: iff (Residuation);

  • BL-4: (Divisibility);

  • BL-5: (Prelinearity).

  • Example 2.1:

    • 1.

      Let X be a nonempty set and let P(X) be the family of all subsets of X. Define operations and by: and for all respectively. Then is a BL-algebra called the power BL-algebra of X.

    • 2.

      where is the residuum of a continuous t-norm is a BL-algebra.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 7: 2 Issues (2017): 1 Released, 1 Forthcoming
Volume 6: 2 Issues (2016)
Volume 5: 1 Issue (2015)
Volume 4: 1 Issue (2014)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing