SearcharxivSearch

arXiv · 2607.16598

Conuclei on varieties of hoops

Abstract

A conucleus $\delta$ on a partially ordered monoid $\mathbf{A}$ is an interior operator that satisfies $\delta(a) \cdot \delta(b) \leq \delta(a \cdot b)$ and $\delta(a) \cdot \delta(1) = \delta(a)$ for all $a,b \in A$. A conucleus is multiplicative if the equality $\delta(a \cdot b) = \delta(a) \cdot \delta(b)$ holds for all $a,b \in A$. In this article we focus on the study of conuclei on hoops, structures which generalize well-known classes of algebras, such as the class of MV-algebras and BL-algebras. Among several results, we provide a Glivenko-type theorem for conuclei. Special emphasis is given to term definable conuclei. The main result of this article is an explicit description of all terms that define a multiplicative conucleus on every structure of an arbitrary proper variety of Wajsberg hoops. We also show that the problem of finding terms that define (multiplicative) conuclei on a variety of basic hoops or BL-algebras is equivalent to finding such terms on some variety or some pair of varieties of Wajsberg hoops. We provide nontrivial interesting examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Sebastián Buss, Diego Castaño, José Patricio Díaz Varela. 2026-07-18. Conuclei on varieties of hoops. https://arxiv.org/abs/2607.16598

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

KEEP EXPLORING

Related papers

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

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

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