Associated with any [0, 1]-valued propositional logic with a complete algebraic semantics, one can consider algebras of families of fuzzy sets over a classical universe, endowed with the appropriate operations. For the three most important schematic extensions of Hájek’s Basic (Fuzzy) Logic, we investigate the existence and the structure of such algebras of fuzzy sets in the corresponding algeb...

A fuzzy method for incorporating the contextual constraints into a text recognition system is presented here. The method takes as input all the internal result that an Isolated Character Classifier (ICC) computes for an input letter, instead of an unique output character. The internal result is handled here as a fuzzy set which is then processed by a Deformed System. Such a Deformed System repr...

The notion of a state is an analogue of a probability measure and was first introduced by Kôpka and Chovanec for MV-algebras and by Riec̆an for BLalgebras. The states have also been studied for different types of non-commutative fuzzy structures such as pseudo-MV algebras, pseudo-BL algebras, bounded R`monoids, residuated lattices and pseudo-BCK semilattices. In this paper we investigate the sta...

We investigate the applicability of divisible residuated lattices (DRLs) as a general evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs are in fact natural candidates for this role, since they form the algebraic semantics of a large family of substructural and fuzzy logics [GJKO07, Háj98]. We present the following results. (i) We show that DRLs subsume important v...

in this note first by considering the notion of general fuzzy automata (for simplicity gfa), we define the notions of direct product, restricted direct product and join of two gfa. also, we introduce some operations on (fuzzy) sets and then prove some related theorems. finally we construct the general fuzzy recognizers and recognizable sets and give the notion of (trim) reversal of a given gfa....

We present some model theoretic results for {L}ukasiewiczpredicate logic by using the methods of continuous model theorydeveloped by Chang and Keisler.We prove compactness theorem with respect to the class of allstructures taking values in the {L}ukasiewicz $texttt{BL}$-algebra.We also prove some appropriate preservation theorems concerning universal and inductive theories.Finally, Skolemizatio...

Fuzzy set theoretical approach to numerous problems of applied mathematics and, especially, fuzzy logical analysis of those problems become frequent in the modern mathematical modelling of the real world. It is desirable to offer the mathematically oriented reader a summary of the background of the principles of fuzzy logic in a lucid and compact form. The referred book aims to offer such summa...

In this paper, we de ne the concepts of general fuzzy recognizer, language recognized by a general fuzzy recognizer, the accessible and the coac- cessible parts of a general fuzzy recognizer and the reversal of a general fuzzy recognizer. Then we obtain the relationships between them and construct a topology and some hypergroups on a general fuzzy recognizer.