SearcharxivSearch

arXiv · 2307.02944

The General Apple Property and Boolean terms in Integral Bounded Residuated Lattice-ordered Commutative Monoids

Abstract

In this paper we give equational presentations of the varieties of {\em integral bounded residuated lattice-ordered commutative monoids} (bounded residuated lattices for short) satisfying the \emph{General Apple Property} (GAP), that is, varieties in which all of its directly indecomposable members are local. This characterization is given by means of Boolean terms: \emph{A variety $\mathsf{V}$ of \brl s has GAP iff there is an unary term $b(x)$ such that $\mathsf{V}$ satisfies the equations $b(x)\lor\neg b(x)\approx \top$ and $(x^k\to b(x))\cdot(b(x)\to k.x)\approx \top$, for some $k>0$}. Using this characterization, we show that for any variety $\mathsf{V}$ of bounded residuated lattice satisfying GAP there is $k>0$ such that the equation $k.x\lor k.\neg x\approx \top$ holds in $\mathsf{V}$, that is, $\mathsf{V} \subseteq \mathsf{WL_\mathsf{k}}$. As a consequence we improve Theorem 5.7 of \cite{CT12}, showing in theorem that a\emph{ variety of \brls\ has Boolean retraction term if and only if there is $k>0$ such that it satisfies the equation $k.x^k\lor k.(\neg x)^k\approx\top$.} We also see that in Bounded residuated lattices GAP is equivalent to Boolean lifting property (BLP) and so, it is equivalent to quasi-local property (in the sense of \cite{GLM12}). Finally, we prove that a variety of \brl s has GAP and its semisimple members form a variety if and only if there exists an unary term which is simultaneously Boolean and radical for this variety.

Explore related subjects

Keep this discovery

BibTeXRIS

Antoni Torrens Torrell. 2023-07-06. The General Apple Property and Boolean terms in Integral Bounded Residuated Lattice-ordered Commutative Monoids. https://arxiv.org/abs/2307.02944

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