Related papers: Boolean Lifting Property for Residuated Lattices
An artinian graded algebra, $A$, is said to have the Weak Lefschetz property (WLP) if multiplication by a general linear form has maximal rank in every degree. A vast quantity of work has been done studying and applying this property,…
Using approximations, we give several characterizations of separability of bimodules. We also discuss how separability properties can be used to transfer some representation theoretic properties from one ring to another one: contravariant…
The aim of this paper is to study the profiniteness of compact topological residuated lattices and the existence of Hausdorff topological residuated lattices. Firstly, we study profinite residuated lattices and obtain sufficient and…
Hyperparameter tuning is an important task of machine learning, which can be formulated as a bilevel program (BLP). However, most existing algorithms are not applicable for BLP with non-smooth lower-level problems. To address this, we…
A common generalization of orthomodular lattices and residuated lattices is provided corresponding to bounded lattices with an involution and sectionally extensive mappings. It turns out that such a generalization can be based on integral…
Let $M$ be a free module of rank $m$ over a commutative unital ring $R$ and let $N$ be its free submodule. We consider the problem when a given element of the exterior product $\Lambda^pM$ is divisible, in a sense, over elements of the…
Ladders of recollements of abelian categories are introduced, and used to address three general problems. Ladders of a certain height allow to construct recollements of triangulated categories, involving derived categories and singularity…
The residuated lattices form one of the most important algebras of fuzzy logics and have been heavily studied by people from various different points of view. Sheaf presentations provide a topological approach to many algebraic structures.…
In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is isomorphic to some algebra over a finite base. This result…
We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…
We obtain a lifting property for finite quotients of algebraic groups, and applications to the structure of these groups.
A level graph is the data of a pair $(G,\pi)$ consisting of a finite graph $G$ and an ordered partition $\pi$ on the set of vertices of $G$. To each level graph on $n$ vertices we associate a polytope in $\mathbb R^n$ called its residue…
The aim of this paper is to investigate further properties of $z$-elements in multiplicative lattices. We utilize $z$-closure operators to extend several properties of $z$-ideals to $z$-elements and introduce various distinguished…
This paper studies algebras arising as algebraic semantics for logics used to model reasoning with incomplete or inconsistent information. In particular we study, in a uniform way, varieties of bilattices equipped with additional…
Residuated lattices play an important role in the study of fuzzy logic based of t-norm. In this paper, we introduced the notions of n-fold implicative filters, n-fold positive implicative filters, n-fold boolean filters, n-fold fantastic…
We characterize supersolvable lattices in terms of a certain modular type relation. McNamara and Thomas earlier characterized this class of lattices as those graded lattices having a maximal chain that consists of left-modular elements. Our…
In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
The Congruence Lattice Problem (CLP), stated by R. P. Dilworth in the forties, asks whether every distributive {∨, 0}-semilatticeS is isomorphic to the semilattice Conc L of compact congruences of a lattice L. While this problem is…
Relational Continuous Models (RCMs) represent joint probability densities over attributes of objects, when the attributes have continuous domains. With relational representations, they can model joint probability distributions over large…