SearcharxivSearch

arXiv · 1907.11758

Equivalence \`a la Mundici for commutative lattice-ordered monoids

Abstract

We provide a generalization of Mundici's equivalence between unital Abelian lattice-ordered groups and MV-algebras: the category of unital commutative lattice-ordered groups is equivalent to the category of MV-monoidal algebras. Roughly speaking, the structures we call unital commutative lattice-ordered groups are unital Abelian lattice-ordered groups without the unary operation $x \mapsto -x$. The primitive operations are $+$, $\lor$, $\land$, $0$, $1$, $-1$. A prime example of these structures is $\mathbb{R}$, with the obvious interpretation of the operations. Analogously, MV-monoidal algebras are MV-algebras without the negation $x \mapsto \lnot x$. The primitive operations are $\oplus$, $\odot$, $\lor$, $\land$, $0$, $1$. A motivating example of MV-monoidal algebra is the negation-free reduct of the standard MV-algebra $[0, 1] \subseteq \mathbb{R}$. We obtain the original Mundici's equivalence as a corollary of our main result.

Explore related subjects

Keep this discovery

BibTeXRIS

Marco Abbadini. 2019-07-26. Equivalence \`a la Mundici for commutative lattice-ordered monoids. https://doi.org/10.1007/s00012-021-00736-3

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