SearcharxivSearch

arXiv · 2404.17322

Filtered Boolean powers of finite simple non-abelian Mal'cev algebras

Abstract

Let $\mathbf{A}$ be a finite simple non-abelian Mal'cev algebra (e.g. a group, loop, ring). We investigate the Boolean power $\mathbf{D}$ of $\mathbf{A}$ by the countable atomless Boolean algebra $\mathbf{B}$ filtered at some idempotents $e_1,\dots,e_n$ of $\mathbf{A}$. When $e_1,\dots,e_n$ are all idempotents of $\mathbf{A}$ we establish two concrete representations of $\mathbf{D}$: as the Fra\"iss\'e limit of the class of finite direct powers of $\mathbf{A}$, and as congruence classes of the countable free algebra in the variety generated by $\mathbf{A}$. Further, for arbitrary $e_1,\dots,e_n$, we show that $\mathbf{D}$ is $\omega$-categorical and that its automorphism group has the small index property, strong uncountable cofinality and the Bergman property. As necessary background we establish some general properties of congruences and automorphisms of filtered Boolean powers of $\mathbf{A}$ by any Boolean algebra $\mathbf{B}$, including a semidirect decomposition for their automorphism groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter Mayr, Nik Ruškuc. 2024-04-26. Filtered Boolean powers of finite simple non-abelian Mal'cev algebras. https://arxiv.org/abs/2404.17322

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