The association between hyperstructures and binary relations had been intensively studied 5,6,10,11,2,4,20 . Chvalina 5,6 and Hort 2 use ordered structures for the construction of semigroups and hypergroups. Rosenberg 4 associated with any binary relation of full domain, a hypergroupoid and found conditions on , such that is a hypergroup. Corsini and Leoreanu 16 study hypergroups and binary rel...

The paper deals with fuzzy Horn logic (FHL) which is a fragment of predicate fuzzy logic with evaluated syntax. Formulas of FHL are of the form of simple implications between identities. We show that one can have Pavelka-style completeness of FHL w. r. t. semantics over the unit interval [0, 1] with (residuated lattices given by) left-continuous t-norm and a residuated implication, provided tha...

In this paper, we introduce triangle algebras: a variety of residuated lattices equipped with approximation operators, and with a third angular point u, different from 0 and 1. We show that these algebras serve as an equational representation of intervalvalued residuated lattices (IVRLs). Furthermore, we present Triangle Logic (TL), a system of many-valued logic capturing the tautologies of IVR...

There are two kinds of bisimulation, namely crisp and fuzzy, between fuzzy structures such as automata, labeled transition systems, Kripke models interpretations in description logics. Fuzzy bisimulations automata over a complete residuated lattice have been introduced by ?iri? et al. 2012. Logical characterizations (respectively, logics) the [0,1] with Gödel t-norm provided Fan 2015 Nguyen 202...

A notion of reticulation which provides topological properties on algebras has introduced on commutative rings in 1980 by Simmons in [5]. For a given commutative ring A, a pair (L, λ) of a bounded distributive lattice and a mapping λ : A → L satisfying some conditions is called a reticulation on A, and the map λ gives a homeomorphism between the topological space Spec(A) consisting of prime fil...

The paper presents generalizations of results on so-called Horn logic, well-known in universal algebra, to the setting of fuzzy logic. The theories we consider consist of formulas which are implications between identities (equations) with premises weighted by truth degrees. We adopt Pavelka style: theories are fuzzy sets of formulas and we consider degrees of provability of formulas from theori...

The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. Bounded residuated lattice ordered monoids (Rl-monoids) are common generalizations of BL-algebras, i.e., algebras of the propositional basic fuzzy logic, and Heyting algebras, i.e., algebras of the propositional intuitionistic logic. From the point of view of uncertain i...

The present paper has been an attempt to investigate the general fuzzy automata on the basis of complete residuated lattice-valued ($L$-GFAs). The study has been chiefly inspired from the work by Mockor cite{15, 16, 17}. Regarding this, the categorical issue of $L$-GFAs has been studied in more details. The main issues addressed in this research include: (1) investigating the relationship betwe...

A b s t r a c t. In this paper, we prove the semisimplicity of free biresiduated lattices, more precisely, integral residuated lattices. In [4], authors show that variety of residuated lattices, more precisely, commutative integral residuated lattices, is generated by its finite simple members. The result is obtained by showing that every free residuated lattice is semisimple and then showing t...

We investigate the variety of residuated lattices with a commutative and idempotent monoid reduct. A residuated lattice is an algebra A = (A,∨,∧, ·, e, /, \) such that (A,∨,∧) is a lattice, (A, ·, e) is a monoid and for every a, b, c ∈ A ab ≤ c ⇔ a ≤ c/b ⇔ b ≤ a\c. The last condition is equivalent to the fact that (A,∨,∧, ·, e) is a lattice-ordered monoid and for every a, b ∈ A there is a great...