SearcharxivSearch

arXiv · 2510.04960

Filters and congruences in weakly complemented lattices

Abstract

In this paper, we show that given a weakly dicomplemented lattice (WDL) $\mathcal{L}=(L; \vee, \wedge, ^{\Delta}, ^{\nabla}, 0, 1)$, $^{\Delta}$ induces a structure of a dual weakly complemented lattice in the lattice $(F(L), \subseteq)$ of filters of $\mathcal{L}$. We prove that the set of dense elements of $F(L)$ forms a nearlattice, and the set of principal filters of $\mathcal{L}$ forms a dual weakly complemented lattice that is dually isomorphic to the weakly complemented lattice (WCL) $(L,\wedge, \vee, ^{\Delta}, 0, 1)$.\par Each filter of the dual skeleton $\overline{S}(L)$ of $L$ constitutes a base of some filter in $L$, called an S-filter, and it is proved that S-filters form a complete lattice isomorphic to the complete lattice of filters of $\overline{S}(L)$. S-primary filters are introduced and investigated, and it is shown that there exists a bijection between the set of prime filters of $\overline{S}(L)$ and the set of S-primary filters of $\mathcal{L}$. Furthermore, each maximal filter of a WDL $\mathcal{L}$ is a primary filter, though there exist primary filters of $\mathcal{L}$ that are not maximal.The congruences generated by filters in a distributive weakly complemented lattice are characterized. Finally, simple and subdirectly irreducible distributive weakly complemented lattices are also characterized using S-filters.

Explore related subjects

Keep this discovery

BibTeXRIS

Yannick Léa Tenkeu Jeufack, Leonard Kwuida. 2025-10-06. Filters and congruences in weakly complemented lattices. https://arxiv.org/abs/2510.04960

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