In this study, some (fuzzy) filters of a Sheffer stroke BL-algebra and its properties are presented. To show relationship between filter fuzzy BL-algebra, we prove that f is (ultra) C if only fp either empty or for each p ∈ [0, 1], it satisfied = f(1) the characteristic function nonempty subset BL-algebra.

Bisimulations have beenwidely used inmany areas of computer science tomodel equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the st...

In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...

In this paper we study and equationally characterize the subvarieties of BL, the variety of BL-algebras, which are generated by families of single-component BL-chains, i.e. MV-chains, Product-chain or Gödel-chains. Moreover, it is proved that they form a segment of the lattice of subvarieties of BL which is bounded by the Boolean variety and the variety generated by all single-component chains,...

The reticulation of an algebra was first defined for commutative rings by Simmons [19] and it was extended by Belluce to non-commutative rings [3]. As for the algebras of fuzzy logics, Belluce also constructed the reticulation of an MV-algebra [2], G. Georgescu defined the reticulation of a quantale [8] and L. Leuştean made this construction for BL-algebras [13, 14]. In each of the papers cited...

Pseudo-BL algebras and pseudo-effect algebras arose in two rather different fields: fuzzy logics and quantum logics. In this paper, by introducing the notion of pseudo-weak MV-effect algebra which is non-commutative generalization of weak MV-effect algebra, we investigate the mutual relationship between pseudo-BL algebras and pseudo-effect algebras. We prove that dual pseudo-BL algebra under ce...

A pseudo-addition in BL-algebras is a binary operation that is associative and non commutative. The aim of this paper is to use the notion of pseudo-addition to study the notion of ideal and fuzzy ideal as a natural generalization of that of ideal and fuzzy ideal in MV-algebras. Using a pseudo-addition, we characterize fuzzy ideals and also obtain a concrete description of the fuzzy ideals gene...

Automata theory plays a key role in computational theory as many computational problems can be solved with its help. Formal grammar is a special type of automata designed for linguistic purposes. Formal grammar generates formal languages. Rough grammar and rough languages were introduced to incorporate the imprecision of real languages in formal languages. These languages have limitations on un...