SearcharxivSearch

arXiv · 1912.11905

Congruence pairs of principal MS-algebras and perfect extensions

Abstract

The notion of a congruence pair for principal MS-algebras, simpler than the one given by Beazer for $K_2$-algebras \cite{6}, is introduced. It is proved that the congruences of the principal MS-algebras $L$ correspond to the MS-congruence pairs on simpler substructures $L^{\circ\circ}$ and $D(L)$ of $L$ that were associated to~$L$ in \cite{4}. An analogy of a well-known Gr\"atzer's problem \cite[Problem 57]{11} formulated for distributive p-algebras, which asks for a characterization of the congruence lattices in terms of the congruence pairs, is presented here for the principal MS-algebras (Problem 1). Unlike a recent solution to such a problem for the principal p-algebras in \cite{2}, it is demonstrated here on the class of principal MS-algebras, that a possible solution to the problem, though not very descriptive, can be simple and elegant. As a step to a more descriptive solution of Problem 1, a special case is then considered when a principal MS-algebra $L$ is a perfect extension of its greatest Stone subalgebra $L_{S}$. It is shown that this is exactly when de Morgan subalgebra $L^{\circ\circ}$ of $L$ is a perfect extension of the Boolean algebra $B(L)$. Two examples illustrating when this special case happens and when it does not are presented.

Explore related subjects

Keep this discovery

BibTeXRIS

Abd El-Mohsen Badawy, Miroslav Haviar, Miroslav Ploščica. 2019-12-26. Congruence pairs of principal MS-algebras and perfect extensions. https://arxiv.org/abs/1912.11905

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