Related papers: Residuation in modular lattices and posets
This article focuses on the construction of left-continuous t-norms on complete lattices. The concepts of $\mathfrak{f}$-mappings and weak $\mathfrak{f}$-mappings on complete lattices are first introduced, respectively. They are then…
We consider a version of a famous open problem formulated by Kadison, asking whether bounded representations of operator algebras are automatically completely bounded. We investigate this question in the context of amenable operator…
Divisible residuated lattices are algebraic structures corresponding to a more comprehensive logic than Hajek's basic logic with an important significance in the study of fuzzy logic. The purpose of this paper is to investigate commutative…
We present two results on the relation between the class of right regular bands (RRBs) and their underlying *associative posets*. The first one is a construction of a left adjoint to the forgetful functor that takes an RRB $(P,\cdot)$ to…
For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…
We employ the theory of canonical extensions to study residuation algebras whose associated relational structures are functional, i.e., for which the ternary relations associated to the expanded operations admit an interpretation as…
In this article we explain the theory of rigid residue complexes in commutative algebra and algebraic geometry, summarizing the background, recent results and anticipated future results. Unlike all previous approaches to Grothendiec…
Quasi-lattices are introduced in terms of 'join' and 'meet' operations. It is observed that quasi-lattices become lattices when these operations are associative and when these operations satisfy 'modularity' conditions. A fundamental…
Let $L$ be a finite-dimensional Lie algebra over a field of non-zero characteristic and let $S$ be a subalgebra. Suppose that $X$ is a finite set of finite-dimensional $L$-modules. Let $D$ be the category of all finite-dimensional…
A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…
We introduce the resolvent composition, a monotonicity-preserving operation between a linear operator and a set-valued operator, as well as the proximal composition, a convexity-preserving operation between a linear operator and a function.…
In this paper we introduce and study a new class of operators related to norm bounded sets on Banach Lattice and which brings together several classical classes of operators (as o-weakly compact operators, b-weakly compact operators,…
Let R be an associative ring with unity and let M be an R-module. We call M (ample) Rad-supplementing if M has a (ample) Rad-supplement in every extension. If M is Rad-supplementing, then every direct summand of M is Rad-supplementing, but…
In this paper, the class of quasicomplemented residuated lattices is introduced and investigated, as a subclass of residuated lattices in which any prime filter not containing any dense element is a minimal prime filter. The notion of…
Complete residue systems play an integral role in abstract algebra and number theory, and a description is typically found in any number theory textbook. This note provides a concise overview of complete residue systems, including a robust…
We survey the state of the art on amalgamation in varieties of semilinear residuated lattices. Our discussion emphasizes two prominent cases from which much insight into the general picture may be gleaned: idempotent varieties and their…
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
It is widely accepted that the logic of quantum mechanics is based on orthomodular posets. However, such a logic is not dynamic in the sense that it does not incorporate time dimension. To fill this gap, we introduce certain tense operators…
It is shown that operations of equivalence cannot serve for building algebras which would induce orthomodular lattices as the operations of implication can. Several properties of equivalence operations have been investigated. Distributivity…