Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2306.00109

Gluing residuated lattices

Nick Galatos·Sara Ugolini
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce and characterize various gluing constructions for residuated lattices that intersect on a common subreduct, and which are subalgebras, or appropriate subreducts, of the resulting structure. Starting from the 1-sum construction (also known as ordinal sum for residuated structures), where algebras that intersect only in the top element are glued together, we first consider the gluing on a congruence filter, and then add a lattice ideal as well. We characterize such constructions in terms of (possibly partial) operators acting on (possibly partial) residuated structures. As particular examples of gluing constructions, we obtain the non-commutative version of some rotation constructions, and an interesting variety of semilinear residuated lattices that are 2-potent. This study also serves as a first attempt toward the study of amalgamation of non-commutative residuated lattices, by constructing an amalgam in the special case where the common subalgebra in the V-formation is either a special (congruence) filter or the union of a filter and an ideal.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Nick Galatos, Sara Ugolini. 2023-05-31. Gluing residuated lattices. https://doi.org/10.1007/s11083-023-09626-w

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗