Simple, subdirectly irreducible weakly dicomplemented lattices

Yannick Lea Tenkeu Jeufack; Leonard Kwuida

Home/Archive/arXiv

arXiv · 2601.11873

Simple, subdirectly irreducible weakly dicomplemented lattices

Yannick Lea Tenkeu Jeufack·Leonard Kwuida

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this work, we exhibit several subclasses of weakly dicomplemented lattices (WDLs) based on their skeletons and dual skeletons. We investigate normal filters (resp. ideals) and show that the set of normal filters (resp. ideals) forms a complete lattice, which is not a sublattice of the lattice of all filters (ideals). The normal filter (ideal) generated by a subset and the join of two normal filters (resp. ieals) are characterized. We further prove that the lattice of normal filters is isomorphic to the lattice of normal ideals, and that the only class of filters (or ideals) that generate a congruence in WDLs is the class of normal filters. For distributive WDLs, the congruences generated by filters are characterized. Using normal filters, we characterize simple, subdirectly irreducible, and regular WDLs. Moreover, it is shown that the congruences generated by normal filters are permutable, and that regular distributive WDLs are congruence-permutable and verify the congruence extension property (CEP). Finally, we prove that, under certain conditions, the lattice of normal filters is isomorphic to the lattice of filters of the Boolean center of a distributive WDL. It is also established that the lattice of normal filters of a WDL $L$ embeds into the lattice of normal filters of the power $L^{X}$ of $L$.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Yannick Lea Tenkeu Jeufack, Leonard Kwuida. 2026-01-17. Simple, subdirectly irreducible weakly dicomplemented lattices. https://arxiv.org/abs/2601.11873

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↗