Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2109.12615

New Results on Congruence Boolean Lifting Property

George Georgescu
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Lifting Idempotent Property ($LIP$) of ideals in commutative rings inspired the study of Boolean lifting properties in the context of other concrete algebraic structures ($MV$-algebras, commutative l-groups, $BL$-algebras, bounded distributive lattices, residuated lattices,etc.), as well as for some types of universal algebras (C. Muresan and the author defined and studied the Congruence Boolean Lifting Property ($CBLP$) for congruence modular algebras). A lifting ideal of a ring $R$ is an ideal of $R$ fulfilling $LIP$. In a recent paper, Tarizadeh and Sharma obtained new results on lifting ideals in commutative rings. The aim of this paper is to extend an important part of their results to congruences with $CBLP$ in semidegenerate congruence modular algebras. The reticulation of such algebra will play an important role in our investigations (recall that the reticulation of a congruence modular algebra $A$ is a bounded distributive lattice $L(A)$ whose prime spectrum is homeomorphic with Agliano's prime spectrum of $A$). Almost all results regarding $CBLP$ are obtained in the setting of semidegenerate congruence modular algebras having the property that the reticulations preserve the Boolean center. The paper contains several properties of congruences with $CBLP$. Among the results we mention a characterization theorem of congruences with $CBLP$. We achieve various conditions that ensure $CBLP$. Our results can be applied to a lot of types of concrete structures: commutative rings, $l$-groups, distributive lattices, $MV$-algebras, $BL$-algebras, residuated lattices, etc.

Explore related subjects

math.LOmath.RA

Keep this discovery

BibTeXRIS

George Georgescu. 2021-09-26. New Results on Congruence Boolean Lifting Property. https://arxiv.org/abs/2109.12615

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↗