SearcharxivSearch

arXiv · 2205.05148

Transfer theorems for finitely subdirectly irreducible algebras

Abstract

We show that under certain conditions, well-studied algebraic properties transfer from the class $\mathcal{Q}_{_\text{RFSI}}$ of the relatively finitely subdirectly irreducible members of a quasivariety $\mathcal{Q}$ to the whole quasivariety, and, in certain cases, back again. First, we prove that if $\mathcal{Q}$ is relatively congruence-distributive, then it has the $\mathcal{Q}$-congruence extension property if and only if $\mathcal{Q}_{_\text{RFSI}}$ has this property. We then prove that if $\mathcal{Q}$ has the $\mathcal{Q}$-congruence extension property and $\mathcal{Q}_{_\text{RFSI}}$ is closed under subalgebras, then $\mathcal{Q}$ has a one-sided amalgamation property (equivalently, for $\mathcal{Q}$, the amalgamation property) if and only if $\mathcal{Q}_{_\text{RFSI}}$ has this property. We also establish similar results for the transferable injections property and strong amalgamation property. For each property considered, we specialize our results to the case where $\mathcal{Q}$ is a variety -- so that $\mathcal{Q}_{_\text{RFSI}}$ is the class of finitely subdirectly irreducible members of $\mathcal{Q}$ and the $\mathcal{Q}$-congruence extension property is the usual congruence extension property -- and prove that when $\mathcal{Q}$ is finitely generated and congruence-distributive, and $\mathcal{Q}_{_\text{RFSI}}$ is closed under subalgebras, possession of the property is decidable. Finally, as a case study, we provide a complete description of the subvarieties of a notable variety of BL-algebras that have the amalgamation property.

Explore related subjects

Keep this discovery

BibTeXRIS

Wesley Fussner, George Metcalfe. 2022-05-10. Transfer theorems for finitely subdirectly irreducible algebras. https://arxiv.org/abs/2205.05148

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