Residuation is a fundamental concept of ordered structures and categories. In this survey we consider the consequences of adding a residuated monoid operation to lattices. The resulting residuated lattices have been studied in several branches of mathematics, including the areas of lattice-ordered groups, ideal lattices of rings, linear logic and multi-valued logic. Our exposition aims to cover...

The aim of this paper is to introduce two new types of fuzzy integrals, namely, ⊗-fuzzy integral and →-fuzzy integral, where ⊗ and → are the multiplication and residuum of a complete residuated lattice, respectively. The first integral is based on a fuzzy measure of L-fuzzy sets and the second one on a complementary fuzzy measure of L-fuzzy sets, where L is a complete residuated lattice. Some o...

In the theory of lattice-ordered groups, there are interesting examples of properties — such as projectability — that are defined in terms of the overall structure of the lattice-ordered group, but are entirely determined by the underlying lattice structure. In this paper, we explore the extent to which projectability is a lattice-theoretic property for more general classes of algebras of logic...

In this paper, we introduce a special algebra called EQ-algebra which has three binary operations (meet, product, fuzzy equality) and a top element. The fuzzy equality is reflexive, symmetric and transitive with respect to the product. EQ-algebra is a natural algebra proposed as an algebra of truth values on the basis of which the fuzzy type theory (a higher-order fuzzy logic) should be develop...

Residuated frames provide relational semantics for substructural logics and are a natural generalization of Kripke frames in intuitionistic and modal logic, and of phase spaces in linear logic. We explore the connection between Gentzen systems and residuated frames and illustrate how frames provide a uniform treatment for semantic proofs of cut-elimination, the finite model property and the fin...

Proof theory can provide useful tools for tackling problems in algebra. In particular, Gentzen systems admitting cut-elimination have been used to establish decidability, complexity, amalgamation, admissibility, and generation results for varieties of residuated lattices corresponding to substructural logics. However, for classes of algebras bearing some family resemblance to groups, such as la...

In this paper, we define a kind of lattice-valued convergence spaces based on the notion of $top$-filters, namely $top$-convergence spaces, and show the category of $top$-convergence spaces is Cartesian-closed. Further, in the lattice valued context of a complete $MV$-algebra, a close relation between the category of$top$-convergence spaces and that of strong $L$-topological spaces is establish...

in this paper, let $l$ be a completeresiduated lattice, and let {bf set} denote the category of setsand mappings, $lf$-{bf pos} denote the category of $lf$-posets and$lf$-monotone mappings, and $lf$-{bf cslat}$(sqcup)$, $lf$-{bfcslat}$(sqcap)$ denote the category of $lf$-completelattices and $lf$-join-preserving mappings and the category of$lf$-complete lattices and $lf$-meet-preserving mapping...

We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e., lattices of Dyck paths) and give a recursive construction for them. The last section is devoted to the presentation of a couple of open problems.

A very simple proof of the finite embeddability property for residuated distributivelattice-ordered groupoids and some related classes of algebras is presented. In particular, this gives an answer to the question posed in [3, Problem 4.2]. The presented construction allows for improvement of the upper bound on the complexity of the decision procedure for the universal theory of residuated distr...